The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LinearRealArith division in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 295 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 | 231 | 26535.04 | 22018.158 | 64 | 0 | 65 | 0 |
cvc5-lfsc | 0 | 209 | 22705.914 | 22698.852 | 86 | 0 | 86 | 0 |
cvc5 | 0 | 61 | 1040.447 | 1030.886 | 234 | 0 | 224 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 231 | 26536.88 | 21969.078 | 64 | 0 | 64 | 0 |
cvc5-lfsc | 0 | 209 | 22705.914 | 22698.852 | 86 | 0 | 86 | 0 |
cvc5 | 0 | 61 | 1040.447 | 1030.886 | 234 | 0 | 224 | 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.