The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFFPDTNIRA logic in the Model Validation Track. Chart
Results were generated on 2026-07-25
Benchmarks: 24
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Sequential Performance | Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|---|
| cvc5 | cvc5 | cvc5 | - | cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 24 | 15.73 | 18.72 | 24 | 24 | 0 | 0 | 0 | 0 |
| z3-BooledASS ne | 0 | 0 (base +0) | 0.00 | 0.00 | 0 | 0 | 24 | 0 | 0 | 0 |
| z3-BooledASS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 24 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 24 | 15.73 | 18.72 | 24 | 24 | 0 | 0 | 0 | 0 |
| z3-BooledASS ne | 0 | 0 (base +0) | 0.00 | 0.00 | 0 | 0 | 24 | 0 | 0 | 0 |
| z3-BooledASS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 24 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 24 | 15.73 | 18.72 | 24 | 24 | 0 | 0 | 0 | 0 |
| z3-BooledASS ne | 0 | 0 (base +0) | 0.00 | 0.00 | 0 | 0 | 24 | 0 | 0 | 0 |
| z3-BooledASS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 24 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 24 | 15.73 | 18.72 | 24 | 24 | 0 | 0 | 0 | 0 |
| z3-BooledASS ne | 0 | 0 (base +0) | 0.00 | 0.00 | 0 | 0 | 24 | 0 | 0 | 0 |
| z3-BooledASS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 23 | 1 | 0 | 0 |