The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_NIRA logic in the Unsat Core Track. Chart
Results were generated on 2025-08-11
Benchmarks: 2
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Sequential Performance | Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|---|
| Yices2 | Yices2 | - | Yices2 | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 27 | 0.14 | 0.26 | 1 | 1 | 1 | 0 | 1 | 0 |
| SMTInterpol | 0 | 27 | 0.52 | 0.48 | 1 | 1 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 24 | 82.99 | 83.25 | 2 | 2 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 27 | 0.14 | 0.26 | 1 | 1 | 1 | 0 | 1 | 0 |
| SMTInterpol | 0 | 27 | 0.52 | 0.48 | 1 | 1 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 24 | 82.99 | 83.25 | 2 | 2 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 27 | 0.14 | 0.26 | 1 | 1 | 1 | 0 | 1 | 0 |
| SMTInterpol | 0 | 27 | 0.52 | 0.48 | 1 | 1 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 24 | 82.99 | 83.25 | 2 | 2 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 27 | 0.14 | 0.26 | 1 | 1 | 0 | 1 | 0 | 0 |
| SMTInterpol | 0 | 27 | 0.52 | 0.48 | 1 | 1 | 0 | 1 | 0 | 0 |
| cvc5 | 0 | 24 | 0.17 | 0.29 | 1 | 1 | 0 | 1 | 0 | 0 |