The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLRA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 101 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
cvc5 | cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
z3-4.8.17n | 0 | 69 | 91.357 | 91.199 | 0 | 0 |
cvc5 | 0 | 69 | 1258.129 | 1258.523 | 0 | 0 |
2021-MathSAT5n | 0 | 66 | 111.176 | 113.991 | 0 | 0 |
MathSATn | 0 | 66 | 117.617 | 117.703 | 0 | 0 |
Yices2 | 0 | 58 | 20.94 | 21.338 | 0 | 0 |
smtinterpol | 0 | 54 | 4062.053 | 3781.267 | 3 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
z3-4.8.17n | 0 | 69 | 91.357 | 91.199 | 0 | 0 |
cvc5 | 0 | 69 | 1258.129 | 1258.523 | 0 | 0 |
2021-MathSAT5n | 0 | 66 | 111.176 | 113.991 | 0 | 0 |
MathSATn | 0 | 66 | 117.617 | 117.703 | 0 | 0 |
Yices2 | 0 | 58 | 20.94 | 21.338 | 0 | 0 |
smtinterpol | 0 | 54 | 4062.053 | 3781.267 | 3 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.