The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFBVDT logic in the Unsat Core Track. Chart
Results were generated on 2025-08-11
Benchmarks: 3
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Sequential Performance | Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|---|
| SMTInterpol | SMTInterpol | - | SMTInterpol | cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 4188 | 1066.12 | 1009.96 | 3 | 3 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 1087 | 155.60 | 156.00 | 3 | 3 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 4188 | 1066.12 | 1009.96 | 3 | 3 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 1087 | 155.60 | 156.00 | 3 | 3 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 4188 | 1066.12 | 1009.96 | 3 | 3 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 1087 | 155.60 | 156.00 | 3 | 3 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 1004 | 8.53 | 8.80 | 2 | 2 | 0 | 1 | 0 | 0 |
| SMTInterpol | 0 | 177 | 21.12 | 7.28 | 2 | 2 | 0 | 1 | 0 | 0 |