The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFNIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 1 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 | 84573 | 39.347 | 34.324 | 0 | 0 | 0 | |
| MathSAT-na-ext | 0 | 84573 | 40.409 | 35.394 | 0 | 0 | 0 | |
| Z3n | 0 | 84573 | 54.544 | 50.258 | 0 | 0 | 0 | |
| 2018-Z3 (incremental)n | 0 | 84573 | 61.195 | 56.702 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 84573 | 259.433 | 253.015 | 0 | 0 | 0 | |
| Yices 2.6.2 Incremental | 0 | 39 | 2400.0 | 2400.0 | 84534 | 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.