The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBV division in the Challenge Track (incremental).
Page generated on 2019-07-23 17:57:31 +0000
Benchmarks: 6 Time Limit: 43200 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-Yices (incremental)n | 0 | 86 | 44966.926 | 44969.741 | 0 | 0 | 0 | |
| Yices 2.6.2 Incremental | 0 | 86 | 54136.91 | 54137.84 | 0 | 0 | 0 | |
| Z3n | 0 | 77 | 199789.4 | 199791.0 | 9 | 4 | 0 | |
| CVC4-inc | 0 | 45 | 259186.2 | 259200.0 | 41 | 6 | 0 | |
| Boolector (incremental) | 0 | 0 | 0.081 | 0.285 | 86 | 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.