The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_BVFP logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 300
Time Limit: 1200 seconds
Memory Limit: 20480 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| cvc5 | - | - | Bitwuzla |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 2041 | 13997.529915 | 14004.222684 | 0 | 0 | 0 | 300 | 0 | 11 | 0 |
| Bitwuzla | 0 | 2040 | 12985.269887 | 12993.289715 | 0 | 0 | 0 | 300 | 0 | 12 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 2022 | 213.302422 | 213.302422 | 0 | 0 | 0 | 278 | 22 | 3 | 0 |
| cvc5 | 0 | 2021 | 456.771371 | 456.771371 | 0 | 0 | 0 | 275 | 25 | 3 | 0 |