The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Equality+LinearArith division in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 799 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 742 | 17355.676 | 11877.239 | 57 | 0 | 57 | 0 |
cvc5-lfsc | 0 | 709 | 24092.367 | 24062.032 | 90 | 0 | 90 | 0 |
cvc5 | 0 | 274 | 3257.721 | 3230.369 | 525 | 0 | 523 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 742 | 17355.676 | 11877.239 | 57 | 0 | 57 | 0 |
cvc5-lfsc | 0 | 709 | 24092.367 | 24062.032 | 90 | 0 | 90 | 0 |
cvc5 | 0 | 274 | 3257.721 | 3230.369 | 525 | 0 | 523 | 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.