The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ABVFP logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 9214
Time Limit: 1200 seconds
Memory Limit: 20480 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 | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 275449 | 48135.660983 | 48144.310779 | 0 | 0 | 0 | 9214 | 0 | 27 | 0 |
| cvc5 | 0 | 244160 | 1.100202385727e+06 | 1.100214970529e+06 | 0 | 0 | 0 | 9214 | 0 | 1279 | 1 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 271286 | 5267.400194 | 5267.400194 | 0 | 0 | 0 | 9072 | 142 | 3 | 0 |
| cvc5 | 0 | 141112 | 13161.519516 | 13161.519516 | 0 | 0 | 0 | 6810 | 2404 | 139 | 0 |