The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLRA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 1529 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 |
|---|---|---|---|---|---|---|---|---|
| Z3n | 0 | 8351 | 12199.05 | 11937.682 | 0 | 0 | 0 | |
| 2018-Z3 (incremental)n | 0 | 8351 | 15174.152 | 14906.169 | 0 | 0 | 0 | |
| Yices 2.6.2 Incremental | 0 | 8347 | 22895.649 | 22654.767 | 4 | 2 | 0 | |
| CVC4-inc | 0 | 8341 | 58141.839 | 57724.599 | 10 | 4 | 0 | |
| SMTInterpol | 0 | 8330 | 66045.196 | 58093.398 | 21 | 9 | 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.