The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFIDL logic in the Model Validation Track.
Page generated on 2022-08-10 11:19:11 +0000
Benchmarks: 206 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
smtinterpol | smtinterpol |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2021-SMTInterpoln | 0 | 198 | 20639.25 | 19212.276 | 8 | 0 |
smtinterpol | 0 | 198 | 20825.314 | 19217.49 | 8 | 0 |
z3-4.8.17n | 0 | 178 | 35510.505 | 35480.623 | 28 | 0 |
cvc5 | 0 | 172 | 68463.828 | 68480.776 | 34 | 0 |
Yices2 | 0 | 143 | 91628.575 | 91642.359 | 63 | 0 |
MathSATn | 0 | 106 | 120030.6 | 120056.516 | 100 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2021-SMTInterpoln | 0 | 198 | 20639.25 | 19212.276 | 8 | 0 |
smtinterpol | 0 | 198 | 20825.314 | 19217.49 | 8 | 0 |
z3-4.8.17n | 0 | 178 | 35512.705 | 35479.963 | 28 | 0 |
cvc5 | 0 | 172 | 68471.928 | 68478.946 | 34 | 0 |
Yices2 | 0 | 143 | 91637.735 | 91639.899 | 63 | 0 |
MathSATn | 0 | 106 | 120051.6 | 120051.626 | 100 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.