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 2023-07-06 16:06:18 +0000
Benchmarks: 242 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 | 214 | 781.709 | 746.209 | 28 | 0 | 28 | 0 |
cvc5 | 0 | 172 | 1495.327 | 1481.65 | 70 | 0 | 62 | 0 |
SMTInterpol | 0 | 94 | 1345.299 | 951.208 | 148 | 0 | 10 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 214 | 781.709 | 746.209 | 28 | 0 | 28 | 0 |
cvc5 | 0 | 172 | 1495.327 | 1481.65 | 70 | 0 | 62 | 0 |
SMTInterpol | 0 | 94 | 1345.299 | 951.208 | 148 | 0 | 10 | 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.