The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLIA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 16 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| Yices2 | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Yices2 | 0 | 21 | 0.069 | 0.204 | 0 | 0 |
| MathSATn | 0 | 21 | 0.277 | 0.277 | 0 | 0 |
| 2021-MathSAT5n | 0 | 21 | 0.312 | 0.328 | 0 | 0 |
| cvc5 | 0 | 21 | 0.318 | 0.31 | 0 | 0 |
| z3-4.8.17n | 0 | 21 | 0.423 | 0.402 | 0 | 0 |
| smtinterpol | 0 | 21 | 9.681 | 6.609 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Yices2 | 0 | 21 | 0.069 | 0.204 | 0 | 0 |
| MathSATn | 0 | 21 | 0.277 | 0.277 | 0 | 0 |
| cvc5 | 0 | 21 | 0.318 | 0.31 | 0 | 0 |
| 2021-MathSAT5n | 0 | 21 | 0.312 | 0.328 | 0 | 0 |
| z3-4.8.17n | 0 | 21 | 0.423 | 0.402 | 0 | 0 |
| smtinterpol | 0 | 21 | 9.681 | 6.609 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.