The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Equality+NonLinearArith division in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 246 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 |
---|---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 225 | 26396.601 | 26369.424 | 21 | 0 | 21 | 0 |
cvc5 | 0 | 193 | 60355.929 | 60321.948 | 53 | 0 | 48 | 0 |
smtinterpol | 0 | 102 | 12721.97 | 12461.89 | 144 | 0 | 10 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 225 | 26402.101 | 26368.014 | 21 | 0 | 21 | 0 |
cvc5 | 0 | 193 | 60366.169 | 60319.298 | 53 | 0 | 48 | 0 |
smtinterpol | 0 | 102 | 12753.73 | 12252.247 | 144 | 0 | 9 | 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.