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 Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 10 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| OpenSMT |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2018-MathSAT (incremental)n | 0 | 1263 | 8695.231 | 8694.987 | 252 | 0 | 5 | 0 |
| MathSAT5n | 0 | 949 | 10527.161 | 10527.668 | 566 | 0 | 8 | 0 |
| OpenSMT | 0 | 942 | 9755.385 | 9754.021 | 573 | 0 | 6 | 0 |
| Yices2 incremental | 0 | 914 | 12000.0 | 12000.0 | 601 | 0 | 10 | 0 |
| cvc5-inc | 0 | 672 | 12000.0 | 12000.0 | 843 | 0 | 10 | 0 |
| SMTInterpol | 0 | 611 | 12000.0 | 12000.0 | 904 | 0 | 10 | 0 |
| z3n | 0 | 586 | 12000.0 | 12000.0 | 929 | 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.