The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ANIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 5 Time Limit: 2400 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| CVC4-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2018-Z3 (incremental)n | 0 | 51724 | 56.624 | 53.178 | 0 | 0 | 0 | |
| Z3n | 0 | 51724 | 59.406 | 56.028 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 48503 | 2822.621 | 2818.974 | 3221 | 1 | 0 | |
| MathSAT-default | 0 | 12101 | 12.547 | 12.005 | 39623 | 0 | 0 | |
| MathSAT-na-ext | 0 | 12101 | 14.018 | 13.442 | 39623 | 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.