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 2022-08-10 11:19:33 +0000
Benchmarks: 2361 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 | 2223 | 177944.257 | 174134.025 | 138 | 0 | 139 | 0 |
cvc5-lfsc | 0 | 2214 | 179557.598 | 179616.658 | 147 | 0 | 146 | 1 |
cvc5 | 0 | 2209 | 182463.11 | 182523.789 | 152 | 0 | 151 | 1 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
smtinterpol | 0 | 2223 | 178792.487 | 172419.322 | 138 | 0 | 132 | 0 |
cvc5-lfsc | 0 | 2214 | 179609.848 | 179608.638 | 147 | 0 | 146 | 1 |
cvc5 | 0 | 2209 | 182517.4 | 182515.019 | 152 | 0 | 151 | 1 |
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.