The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_DT logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 100 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 |
---|---|---|---|---|---|---|
2021-z3n | 0 | 186395 | 101334.508 | 101369.84 | 75 | 0 |
z3-4.8.17n | 0 | 186395 | 101622.822 | 101661.616 | 75 | 0 |
cvc5 | 0 | 76023 | 111076.974 | 111093.391 | 84 | 0 |
smtinterpol | 0 | 20833 | 115739.456 | 115047.948 | 94 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2021-z3n | 0 | 186395 | 101361.818 | 101366.23 | 75 | 0 |
z3-4.8.17n | 0 | 186395 | 101653.122 | 101658.056 | 75 | 0 |
cvc5 | 0 | 76023 | 111088.214 | 111089.741 | 84 | 0 |
smtinterpol | 0 | 56016 | 117410.656 | 113765.221 | 87 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.