The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UFLRA division in the Incremental Track.
Page generated on 2020-07-04 11:47:56 +0000
Benchmarks: 748 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 |
|---|---|---|---|---|---|---|---|---|
| 2019-Z3n | 0 | 320367 | 126981.498 | 127163.425 | 247884 | 45 | 0 | |
| z3n | 0 | 318483 | 128587.8 | 128416.24 | 249768 | 49 | 0 | |
| CVC4-inc | 0 | 114150 | 34510.895 | 34426.728 | 454101 | 5 | 0 | |
| SMTInterpol-fixedn | 0 | 107995 | 308557.774 | 303038.54 | 460256 | 179 | 0 | |
| SMTInterpol | 0 | 107994 | 308570.494 | 303019.731 | 460257 | 178 | 0 | |
| UltimateEliminator+MathSAT | 0 | 0 | 2280.39 | 1072.083 | 568251 | 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.