The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFNIA logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 506
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| cvc5 | - | - | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 13835 | 5765.79 | 5765.79 | 0 | 506 | 0 | 0 | 0 |
| Yices2 | 0 | 13702 | 680.54 | 680.54 | 0 | 506 | 0 | 5 | 0 |
| SMTInterpol | 0 | 12131 | 452.98 | 452.98 | 0 | 506 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 12768 | 357.84 | 357.84 | 0 | 500 | 6 | 4 | 0 |
| SMTInterpol | 0 | 12131 | 452.98 | 452.98 | 0 | 506 | 0 | 0 | 0 |
| cvc5 | 0 | 10181 | 821.73 | 821.73 | 0 | 470 | 36 | 0 | 0 |