The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ALIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 44 Time Limit: 2400 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2018-Z3 (incremental)n | 0 | 530398 | 923.558 | 841.661 | 0 | 0 | 0 | |
| Z3n | 0 | 530398 | 933.481 | 854.46 | 0 | 0 | 0 | |
| SMTInterpol | 0 | 530398 | 2563.352 | 1609.971 | 0 | 0 | 0 | |
| Yices 2.6.2 Incremental | 0 | 530371 | 5144.499 | 5076.994 | 27 | 2 | 0 | |
| CVC4-inc | 0 | 506756 | 11793.137 | 11675.296 | 23642 | 4 | 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.