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 2019-07-23 17:57:24 +0000
Benchmarks: 10 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 | 3224 | 16839.111 | 16838.965 | 2831 | 7 | 0 | |
UltimateEliminator+MathSAT-5.5.4 | 0 | 2378 | 82.06 | 52.79 | 3677 | 0 | 0 | |
Z3n | 0 | 0 | 0.03 | 0.106 | 6055 | 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.