The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LIA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 982 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 | 4823265 | 5531.657 | 5466.209 | 16 | 1 |
2022-MathSATn | 0 | 4368369 | 8412.885 | 8371.089 | 53 | 0 |
cvc5 | 0 | 3460115 | 16667.289 | 16620.28 | 64 | 0 |
SMTInterpol | 0 | 3438608 | 20337.73 | 15113.034 | 37 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Yices2 | 0 | 4823265 | 5531.657 | 5466.209 | 16 | 1 |
2022-MathSATn | 0 | 4368369 | 8412.885 | 8371.089 | 53 | 0 |
cvc5 | 0 | 3460115 | 10668.189 | 10619.97 | 64 | 0 |
SMTInterpol | 0 | 3438608 | 20337.73 | 15113.034 | 37 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.