The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ABVFPLRA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 7
Time Limit: 1200 seconds
Memory Limit: 20480 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| Bitwuzla | - | - | cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 1876 | 60.267445 | 60.267445 | 0 | 0 | 0 | 7 | 0 | 0 | 0 |
| cvc5 | 0 | 1876 | 72.502372 | 72.502372 | 0 | 0 | 0 | 7 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 1549 | 43.687658 | 43.687658 | 0 | 0 | 0 | 6 | 1 | 0 | 0 |
| Bitwuzla | 0 | 845 | 28.175812 | 28.175812 | 0 | 0 | 0 | 6 | 1 | 0 | 0 |