The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ADT+LinArith division in the Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 673 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics: This division is experimental. Solvers are only ranked by performance, but no winner is selected.
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 670 | 3980.451 | 3060.965 | 0 | 0 | |
cvc5 | 0 | 611 | 13558.052 | 13557.831 | 62 | 0 | |
Yices2 | 0 | 32 | 0.127 | 0.342 | 11 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 670 | 3980.451 | 3060.965 | 0 | 0 | |
cvc5 | 0 | 611 | 13558.052 | 13557.831 | 62 | 0 | |
Yices2 | 0 | 32 | 0.127 | 0.342 | 11 | 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.