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 2023-07-06 16:05:24 +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 | 5255 | 534.89 | 535.63 | 800 | 0 | 2 | 0 |
| 2022-Bitwuzlan | 0 | 3429 | 177.17 | 178.0 | 2626 | 0 | 6 | 0 |
| cvc5 | 0 | 3195 | 51.95 | 52.97 | 2860 | 0 | 7 | 0 |
| UltimateEliminator+MathSAT | 0 | 2388 | 240.0 | 173.42 | 3667 | 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.