The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABV division in the Challenge Track (incremental).
Page generated on 2019-07-23 17:57:31 +0000
Benchmarks: 9 Time Limit: 43200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Boolector (incremental) |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| Boolector (incremental) | 0 | 135 | 10299.752 | 10298.927 | 0 | 0 | 0 | |
| 2018-Boolector (incremental)n | 0 | 133 | 55370.94 | 55373.66 | 2 | 0 | 0 | |
| Yices 2.6.2 Incremental | 0 | 130 | 147867.07 | 147872.72 | 5 | 2 | 0 | |
| Z3n | 0 | 119 | 332366.8 | 332380.4 | 16 | 7 | 0 | |
| CVC4-inc | 0 | 89 | 388787.5 | 388800.0 | 46 | 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.