The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFNRA logic in the Unsat Core Track. Chart
Results were generated on 2025-08-11
Benchmarks: 25
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 UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 362 | 24.17 | 27.25 | 25 | 25 | 0 | 0 | 0 | 0 |
| Yices2 | 0 | 100 | 4.48 | 6.06 | 13 | 13 | 12 | 0 | 12 | 0 |
| SMTInterpol | 0 | 66 | 25.48 | 11.66 | 11 | 11 | 14 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 362 | 24.17 | 27.25 | 25 | 25 | 0 | 0 | 0 | 0 |
| Yices2 | 0 | 100 | 4.48 | 6.06 | 13 | 13 | 12 | 0 | 12 | 0 |
| SMTInterpol | 0 | 66 | 25.48 | 11.66 | 11 | 11 | 14 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 362 | 24.17 | 27.25 | 25 | 25 | 0 | 0 | 0 | 0 |
| Yices2 | 0 | 100 | 4.48 | 6.06 | 13 | 13 | 12 | 0 | 12 | 0 |
| SMTInterpol | 0 | 66 | 25.48 | 11.66 | 11 | 11 | 14 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 362 | 24.17 | 27.25 | 25 | 25 | 0 | 0 | 0 | 0 |
| Yices2 | 0 | 100 | 4.48 | 6.06 | 13 | 13 | 0 | 12 | 0 | 0 |
| SMTInterpol | 0 | 66 | 25.48 | 11.66 | 11 | 11 | 14 | 0 | 0 | 0 |