The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the ABVFP division in the Incremental Track.
Page generated on 2019-07-23 17:57:24 +0000
Benchmarks: 4 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 |
|---|---|---|---|---|---|---|---|---|
| CVC4-inc | 0 | 818 | 2409.8 | 2409.773 | 1451 | 1 | 0 | |
| UltimateEliminator+MathSAT-5.5.4 | 0 | 248 | 15.44 | 7.191 | 2021 | 0 | 0 | |
| Z3n | 0 | 0 | 0.012 | 0.041 | 2269 | 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.