The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LinearIntArith division in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 1442 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 | 1302 | 125249.973 | 94742.266 | 140 | 0 | 146 | 0 |
cvc5-lfsc | 0 | 841 | 51916.795 | 51831.058 | 601 | 0 | 597 | 0 |
cvc5 | 0 | 520 | 1840.757 | 1825.973 | 922 | 0 | 914 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 1302 | 125875.693 | 93344.519 | 140 | 0 | 140 | 0 |
cvc5-lfsc | 0 | 841 | 51916.795 | 51831.058 | 601 | 0 | 597 | 0 |
cvc5 | 0 | 520 | 1840.757 | 1825.973 | 922 | 0 | 914 | 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.