The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ANIA logic in the Incremental Track. Chart
Results were generated on 2026-07-25
Benchmarks: 5
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| SMTInterpol | - | - | SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 51724 | 110.01 | 110.01 | 0 | 5 | 0 | 0 | 0 |
| cvc5 | 0 | 23587 | 320.66 | 320.66 | 0 | 5 | 0 | 3 | 0 |
| Yices2 | 0 | 10802 | 5989.71 | 5989.71 | 0 | 5 | 0 | 5 | 0 |
| z3-BooledASS ne | 0 | 0 (base +0) | 0.03 | 0.04 | 0 | 5 | 0 | 0 | 0 |
| z3-BooledASS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 5 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 24668 | 46.34 | 46.34 | 0 | 3 | 2 | 0 | 0 |
| cvc5 | 0 | 15616 | 32.13 | 32.13 | 0 | 4 | 1 | 3 | 0 |
| z3-BooledASS ne | 0 | 0 (base +0) | 0.03 | 0.04 | 0 | 5 | 0 | 0 | 0 |
| z3-BooledASS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 5 | 0 | 0 | 0 |