The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFLIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 72 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-Yices (incremental)n | 0 | 4699864 | 3122.243 | 2935.725 | 0 | 0 | 0 | |
| Yices 2.6.2 Incremental | 0 | 4699864 | 3213.424 | 3029.451 | 0 | 0 | 0 | |
| Z3n | 0 | 4699864 | 10000.58 | 9796.64 | 0 | 0 | 0 | |
| SMTInterpol | 0 | 4699864 | 18585.171 | 17119.44 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 4291461 | 10556.18 | 10343.227 | 408403 | 1 | 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.