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 2020-07-04 11:47:56 +0000
Benchmarks: 10 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| CVC4-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| MathSAT5n | 0 | 4181657 | 1699.718 | 1484.131 | 0 | 0 | 0 | |
| 2019-MathSAT-defaultn | 0 | 4181657 | 1811.292 | 1592.561 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 3264119 | 8848.151 | 8745.155 | 917538 | 4 | 0 | |
| z3n | 0 | 2907905 | 4851.676 | 4724.22 | 1273752 | 3 | 0 | |
| Yices2-fixed incrementaln | 0 | 198160 | 12000.0 | 12000.0 | 3983497 | 10 | 0 | |
| Yices2 incremental | 4 | 110642 | 3915.8 | 3911.717 | 4071015 | 2 | 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.