The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LRA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 10 Time Limit: 2400 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Yices 2.6.2 Incremental |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2018-MathSAT (incremental)n | 0 | 1293 | 14732.134 | 14731.654 | 222 | 5 | 0 | |
| Yices 2.6.2 Incremental | 0 | 1005 | 24000.0 | 24000.0 | 510 | 10 | 0 | |
| CVC4-inc | 0 | 777 | 24000.0 | 24000.0 | 738 | 10 | 0 | |
| SMTInterpol | 0 | 761 | 20684.205 | 20605.858 | 754 | 8 | 0 | |
| Z3n | 0 | 740 | 23594.26 | 23594.52 | 775 | 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.