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 Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 631 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 | 1405 | 43314.701 | 43195.342 | 9 | 6 | 0 | |
| Yices 2.6.2 Incremental | 0 | 1401 | 18497.165 | 18462.896 | 13 | 7 | 0 | |
| Boolector (incremental) | 0 | 1397 | 60950.004 | 60901.921 | 17 | 17 | 0 | |
| CVC4-inc | 0 | 1248 | 47224.672 | 47162.899 | 166 | 18 | 0 | |
| Z3n | 0 | 1243 | 324608.121 | 324543.857 | 171 | 116 | 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.