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 2022-08-10 11:18:21 +0000
Benchmarks: 10 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| Bitwuzla |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 3418 | 7320.377 | 7320.435 | 2637 | 0 | 6 | 0 |
| cvc5 | 0 | 3224 | 8428.827 | 8428.57 | 2831 | 0 | 7 | 0 |
| UltimateEliminator+MathSAT | 0 | 2388 | 241.53 | 179.546 | 3667 | 0 | 0 | 0 |
| 2019-CVC4-incn | 0 | 260 | 1200.0 | 1200.0 | 198 | 0 | 1 | 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.