The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_AUFBVNIA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 44
Time Limit: 1200 seconds
Memory Limit: 20480 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| Yices2 | - | - | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 72 | 8727.000355 | 8732.424099 | 0 | 0 | 0 | 44 | 0 | 4 | 0 |
| cvc5 | 0 | 63 | 18364.920254 | 18375.087551 | 0 | 0 | 0 | 44 | 0 | 13 | 0 |
| SMTInterpol | 0 | 30 | 26289.086667 | 24813.206378 | 0 | 0 | 0 | 44 | 0 | 17 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 53 | 117.621402 | 120.066617 | 0 | 0 | 0 | 31 | 13 | 0 | 0 |
| cvc5 | 0 | 31 | 91.893187 | 93.429481 | 0 | 0 | 0 | 18 | 26 | 0 | 0 |
| SMTInterpol | 0 | 13 | 313.189972 | 119.888965 | 0 | 0 | 0 | 16 | 28 | 0 | 0 |