The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the LRA division in the Incremental Track.
Page generated on 2020-07-04 11:47:56 +0000
Benchmarks: 5 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| CVC4-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| CVC4-inc | 0 | 15969 | 125.364 | 124.63 | 0 | 0 | 0 | |
| UltimateEliminator+MathSAT | 0 | 13822 | 61.999 | 28.335 | 2147 | 0 | 0 | |
| z3n | 0 | 13584 | 3611.116 | 3610.86 | 2385 | 3 | 0 | |
| SMTInterpol-fixedn | 0 | 12719 | 1230.937 | 1210.565 | 3250 | 1 | 0 | |
| SMTInterpol | 0 | 12719 | 1231.048 | 1210.58 | 3250 | 1 | 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.