The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFNRA logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 1
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| Yices2 | - | - | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 6 | 0.01 | 0.01 | 0 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 6 | 0.02 | 0.02 | 0 | 1 | 0 | 0 | 0 |
| SMTInterpol | 0 | 6 | 0.22 | 0.22 | 0 | 1 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 6 | 0.01 | 0.01 | 0 | 1 | 0 | 0 | 0 |
| cvc5 | 0 | 6 | 0.02 | 0.02 | 0 | 1 | 0 | 0 | 0 |
| SMTInterpol | 0 | 6 | 0.22 | 0.22 | 0 | 1 | 0 | 0 | 0 |