The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the ALIA division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 24 Time Limit: 2400 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| CVC4-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2018-Z3 (incremental)n | 0 | 202552 | 173.467 | 160.628 | 0 | 0 | 0 | |
| Z3n | 0 | 202552 | 176.778 | 164.577 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 202552 | 528.248 | 499.547 | 0 | 0 | 0 | |
| SMTInterpol | 0 | 202537 | 789.48 | 335.292 | 15 | 0 | 0 | |
| UltimateEliminator+SMTInterpol | 0 | 201629 | 1041.102 | 453.264 | 923 | 0 | 0 | |
| UltimateEliminator+MathSAT-5.5.4 | 0 | 192386 | 5850.126 | 5581.645 | 10166 | 1 | 1 | |
| UltimateEliminator+Yices-2.6.1 | 0 | 0 | 72.12 | 36.021 | 202552 | 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.