The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ABVFPLRA logic in the Model Validation Track. Chart
Results were generated on 2025-08-11
Benchmarks: 25
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Sequential Performance | Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|---|
| Bitwuzla | Bitwuzla | Bitwuzla | - | Bitwuzla |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 25 | 11.33 | 14.35 | 25 | 25 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 25 | 71.75 | 74.80 | 25 | 25 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 25 | 11.33 | 14.35 | 25 | 25 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 25 | 71.75 | 74.80 | 25 | 25 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 25 | 11.33 | 14.35 | 25 | 25 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 25 | 71.75 | 74.80 | 25 | 25 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 25 | 11.33 | 14.35 | 25 | 25 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 24 | 36.76 | 39.67 | 24 | 24 | 0 | 1 | 0 | 0 |