The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFFP logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 1
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 | 2 | 0.098119 | 0.098119 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 2 | 0.409504 | 0.409504 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 2 | 0.098119 | 0.098119 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 2 | 0.409504 | 0.409504 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |