The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 10 Time Limit: 2400 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| MathSAT-default |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| MathSAT-default | 0 | 4181657 | 1765.619 | 1548.162 | 0 | 0 | 0 | |
| MathSAT-na-ext | 0 | 4181657 | 1798.052 | 1583.038 | 0 | 0 | 0 | |
| 2018-CVC4 (incremental)n | 0 | 4165515 | 9395.719 | 9121.03 | 16142 | 1 | 0 | |
| CVC4-inc | 0 | 3635509 | 14554.658 | 14363.525 | 546148 | 3 | 0 | |
| Z3n | 0 | 3250402 | 6375.376 | 6233.953 | 931255 | 2 | 0 | |
| Yices 2.6.2 Incremental | 0 | 37804 | 24000.0 | 24000.0 | 4143853 | 10 | 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.