The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ABVFP logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 9214
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 | 273878 | 48006.36 | 48017.10 | 0 | 9214 | 0 | 23 | 0 |
| cvc5 | 0 | 243779 | 1086437.29 | 1086442.65 | 0 | 9214 | 0 | 1267 | 2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 268669 | 4095.00 | 4095.00 | 0 | 9072 | 142 | 2 | 0 |
| cvc5 | 0 | 156924 | 14166.84 | 14166.84 | 0 | 6981 | 2233 | 145 | 0 |