The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_BV logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 1295
Time Limit: 1200 seconds
Memory Limit: 20480 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| Bitwuzla | - | - | STP |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 29333 | 20275.606322 | 20377.608299 | 0 | 0 | 0 | 1295 | 0 | 8 | 0 |
| Yices2 | 0 | 29324 | 23726.756392 | 23833.77976 | 0 | 0 | 0 | 1295 | 0 | 11 | 0 |
| STP | 0 | 29049 | 19705.397791 | 19810.815701 | 0 | 0 | 0 | 1295 | 0 | 12 | 0 |
| cvc5 | 0 | 28980 | 64688.163711 | 64794.0917 | 0 | 0 | 0 | 1295 | 0 | 13 | 0 |
| SMTInterpol | 0 | 21202 | 479046.314438 | 442633.03147 | 0 | 0 | 0 | 1295 | 0 | 344 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| STP | 0 | 27614 | 2115.656556 | 2212.00226 | 0 | 0 | 0 | 1262 | 33 | 0 | 0 |
| Yices2 | 0 | 27611 | 2034.534085 | 2132.656593 | 0 | 0 | 0 | 1230 | 65 | 0 | 0 |
| Bitwuzla | 0 | 23568 | 1906.86321 | 2005.808091 | 0 | 0 | 0 | 1179 | 116 | 0 | 0 |
| SMTInterpol | 0 | 13097 | 9060.970135 | 3409.062639 | 0 | 0 | 0 | 807 | 488 | 0 | 0 |
| cvc5 | 0 | 11346 | 1057.31527 | 1148.478547 | 0 | 0 | 0 | 1027 | 268 | 0 | 0 |