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 2020-07-04 11:47:56 +0000
Benchmarks: 6 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| UltimateEliminator+MathSAT |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| z3n | 0 | 25393 | 7.27 | 6.49 | 0 | 0 | 0 | |
| 2018-Z3 (incremental)n | 0 | 25393 | 8.812 | 8.12 | 0 | 0 | 0 | |
| UltimateEliminator+MathSAT | 0 | 25393 | 99.925 | 45.562 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 25393 | 61.139 | 59.865 | 0 | 0 | 0 | |
| SMTInterpol | 0 | 25391 | 85.648 | 21.19 | 2 | 0 | 0 | |
| SMTInterpol-fixedn | 0 | 25391 | 64.764 | 21.739 | 2 | 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.