The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the BVFP 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 |
|---|---|---|---|---|---|---|---|---|
| 2019-CVC4-incn | 0 | 260 | 1200.0 | 1200.0 | 198 | 1 | 0 | |
| CVC4-inc | 0 | 260 | 1200.0 | 1200.0 | 198 | 1 | 0 | |
| UltimateEliminator+MathSAT | 0 | 231 | 13.94 | 10.775 | 227 | 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.