The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UF division in the Incremental Track.
Page generated on 2021-07-14 14:12:24 +0000
Benchmarks: 1998 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| CVC4-inc |
Note: the division has disagreements
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| z3n | 0 | 85771 | 915196.49 | 915514.105 | 217050 | 706 | 0 | |
| CVC4-inc | 0 | 30525 | 715777.916 | 715751.644 | 272296 | 588 | 0 | |
| SMTInterpol | 0 | 26662 | 1642708.243 | 1635526.205 | 276159 | 1339 | 0 | |
| SMTInterpol-fixedn | 0 | 26647 | 1642655.397 | 1635644.581 | 276174 | 1338 | 0 | |
| UltimateEliminator+MathSAT | 0 | 0 | 6584.07 | 3039.56 | 302821 | 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.