The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the FPArith division in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 1 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| cvc5-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| 2019-CVC4-incn | 0 | 270 | 1200.0 | 1200.0 | 188 | 0 | 1 | 0 |
| cvc5-inc | 0 | 253 | 1200.0 | 1200.0 | 205 | 0 | 1 | 0 |
| UltimateEliminator+MathSAT | 0 | 231 | 50.67 | 44.062 | 227 | 0 | 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.