The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_AUFNIA logic in the Unsat Core Track. Chart
Results were generated on 2025-08-11
Benchmarks: 12
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Sequential Performance | Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|---|
| SMTInterpol | SMTInterpol | - | SMTInterpol | SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 20349 | 47.03 | 17.63 | 12 | 12 | 0 | 0 | 0 | 0 |
| Yices2 | 0 | 20191 | 9.14 | 10.61 | 12 | 12 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 16360 | 35.94 | 37.42 | 12 | 12 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 20349 | 47.03 | 17.63 | 12 | 12 | 0 | 0 | 0 | 0 |
| Yices2 | 0 | 20191 | 9.14 | 10.61 | 12 | 12 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 16360 | 35.94 | 37.42 | 12 | 12 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 20349 | 47.03 | 17.63 | 12 | 12 | 0 | 0 | 0 | 0 |
| Yices2 | 0 | 20191 | 9.14 | 10.61 | 12 | 12 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 16360 | 35.94 | 37.42 | 12 | 12 | 0 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 20349 | 47.03 | 17.63 | 12 | 12 | 0 | 0 | 0 | 0 |
| Yices2 | 0 | 20191 | 9.14 | 10.61 | 12 | 12 | 0 | 0 | 0 | 0 |
| cvc5 | 0 | 16360 | 35.94 | 37.42 | 12 | 12 | 0 | 0 | 0 | 0 |