The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_BVFP logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 300
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| Bitwuzla | - | - | Bitwuzla |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 2080 | 1830.22 | 1830.22 | 0 | 300 | 0 | 3 | 0 |
| cvc5 | 0 | 2073 | 11535.48 | 11540.68 | 0 | 300 | 0 | 10 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 2068 | 245.44 | 245.44 | 0 | 291 | 9 | 3 | 0 |
| cvc5 | 0 | 2059 | 503.78 | 503.78 | 0 | 281 | 19 | 3 | 0 |