The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Datatypes division in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 200 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:Sequential Performance | Parallel Performance |
---|---|
cvc5 | SMTInterpol |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 1005452 | 35292.718 | 35308.285 | 96 | 0 | |
cvc5 | 0 | 211668 | 23425.685 | 23428.408 | 163 | 0 | |
SMTInterpol | 0 | 209336 | 15820.24 | 10452.566 | 173 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 1005452 | 35292.718 | 35308.285 | 96 | 0 | |
SMTInterpol | 0 | 294644 | 45436.96 | 27759.684 | 155 | 0 | |
cvc5 | 0 | 211668 | 23425.685 | 23428.408 | 163 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.