The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 386 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 | 762722 | 175266.991 | 175209.006 | 3872 | 58 | 0 | |
| Z3n | 0 | 759715 | 198487.166 | 198467.982 | 6879 | 79 | 0 | |
| SMTInterpol | 0 | 757451 | 242787.652 | 241991.895 | 9143 | 95 | 0 | |
| CVC4-inc | 0 | 756992 | 210123.105 | 210094.716 | 9602 | 78 | 0 | |
| Yices 2.6.2 Incremental | 0 | 756304 | 192201.894 | 192186.035 | 10290 | 77 | 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.