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 2020-07-04 11:47:56 +0000
Benchmarks: 1 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 | 84573 | 37.52 | 32.571 | 0 | 0 | 0 | |
| 2019-MathSAT-defaultn | 0 | 84573 | 40.369 | 35.368 | 0 | 0 | 0 | |
| z3n | 0 | 84573 | 47.878 | 43.69 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 84573 | 265.071 | 258.683 | 0 | 0 | 0 | |
| Yices2 incremental | 0 | 21551 | 1200.0 | 1200.0 | 63022 | 1 | 0 | |
| Yices2-fixed incrementaln | 0 | 19273 | 1200.0 | 1200.0 | 65300 | 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.