The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ALIA logic in the Model Validation Track. Chart
Results were generated on 2025-08-11
Benchmarks: 88
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 | - | SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 87 | 399.00 | 153.74 | 87 | 87 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 76 | 1113.38 | 1122.66 | 76 | 76 | 12 | 0 | 12 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 87 | 399.00 | 153.74 | 87 | 87 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 76 | 1113.38 | 1122.66 | 76 | 76 | 12 | 0 | 12 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 87 | 399.00 | 153.74 | 87 | 87 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 76 | 1113.38 | 1122.66 | 76 | 76 | 12 | 0 | 12 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 87 | 399.00 | 153.74 | 87 | 87 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 62 | 199.24 | 206.69 | 62 | 62 | 0 | 26 | 0 | 0 |