The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UF division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 383 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 |
|---|---|---|---|---|---|---|---|---|
| Yices 2.6.2 Incremental | 0 | 766 | 95.395 | 78.235 | 0 | 0 | 0 | |
| Z3n | 0 | 766 | 255.207 | 238.729 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 766 | 453.169 | 422.817 | 0 | 0 | 0 | |
| SMTInterpol | 0 | 766 | 1562.596 | 599.677 | 0 | 0 | 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.