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 2023-07-06 16:05:43 +0000
Benchmarks: 100 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| cvc5 | SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2022-z3-4.8.17n | 0 | 325609 | 10496.848 | 10502.163 | 76 | 0 |
| cvc5 | 0 | 110188 | 9905.144 | 9906.579 | 85 | 0 |
| SMTInterpol | 0 | 97694 | 4902.481 | 3275.991 | 91 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2022-z3-4.8.17n | 0 | 325609 | 10496.848 | 10502.163 | 76 | 0 |
| SMTInterpol | 0 | 129110 | 20384.811 | 12304.307 | 82 | 0 |
| cvc5 | 0 | 110188 | 9905.144 | 9906.579 | 85 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.