The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the LIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 6 Time Limit: 2400 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2018-Z3 (incremental)n | 0 | 25393 | 8.565 | 7.721 | 0 | 0 | 0 | |
| Z3n | 0 | 25393 | 8.924 | 8.108 | 0 | 0 | 0 | |
| SMTInterpol | 0 | 25391 | 59.775 | 20.583 | 2 | 0 | 0 | |
| UltimateEliminator+SMTInterpol | 0 | 25383 | 91.89 | 32.496 | 10 | 0 | 0 | |
| UltimateEliminator+MathSAT-5.5.4 | 0 | 25383 | 97.09 | 39.91 | 10 | 0 | 0 | |
| CVC4-inc | 0 | 24486 | 2416.871 | 2415.9 | 907 | 1 | 0 | |
| UltimateEliminator+Yices-2.6.1 | 0 | 0 | 17.784 | 8.997 | 25393 | 0 | 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.