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 Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 1230 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics: This track is experimental. Solvers are only ranked by performance, but no winner is selected.
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 1113 | 22092.909 | 17963.974 | 117 | 0 | 125 | 0 |
cvc5-lfsc | 0 | 1092 | 50.012 | 48.97 | 138 | 0 | 138 | 0 |
cvc5 | 0 | 1092 | 52.622 | 51.047 | 138 | 0 | 138 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 1113 | 24799.319 | 16481.669 | 117 | 0 | 117 | 0 |
cvc5-lfsc | 0 | 1092 | 50.012 | 48.97 | 138 | 0 | 138 | 0 |
cvc5 | 0 | 1092 | 52.622 | 51.047 | 138 | 0 | 138 | 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.