The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBVNIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 44 Time Limit: 2400 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| MathSAT-na-ext |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| MathSAT-na-ext | 0 | 76 | 3445.139 | 3441.198 | 0 | 0 | 0 | |
| MathSAT-default | 0 | 75 | 3667.702 | 3664.174 | 1 | 1 | 0 | |
| CVC4-inc | 0 | 65 | 31841.888 | 31839.277 | 11 | 11 | 0 | |
| Z3n | 0 | 0 | 0.128 | 0.478 | 76 | 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.