The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFBV division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 1165 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 |
|---|---|---|---|---|---|---|---|---|
| 2018-Boolector (incremental)n | 0 | 2977 | 3079.019 | 3053.842 | 0 | 0 | 0 | |
| Yices 2.6.2 Incremental | 0 | 2976 | 3176.283 | 3152.33 | 1 | 1 | 0 | |
| Boolector (incremental) | 0 | 2976 | 3265.267 | 3240.045 | 1 | 1 | 0 | |
| Z3n | 0 | 2936 | 10929.165 | 10902.425 | 41 | 3 | 0 | |
| CVC4-inc | 0 | 2866 | 20749.837 | 20669.811 | 111 | 7 | 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.