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 Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 25 Time Limit: 2400 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 |
|---|---|---|---|---|---|---|---|---|
| Yices 2.6.2 Incremental | 0 | 876 | 5946.253 | 5946.003 | 5 | 2 | 0 | |
| 2018-Yices (incremental)n | 0 | 874 | 5874.48 | 5874.247 | 7 | 2 | 0 | |
| Z3n | 0 | 806 | 17486.527 | 17487.115 | 75 | 6 | 0 | |
| CVC4-inc | 0 | 657 | 25189.383 | 25189.066 | 224 | 10 | 0 | |
| Boolector (incremental) | 0 | 123 | 169.761 | 169.892 | 758 | 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.