The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ANIA logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 5
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| SMTInterpol | - | - | cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 51724 | 96.92 | 96.92 | 0 | 5 | 0 | 0 | 0 |
| cvc5 | 0 | 39905 | 76.10 | 76.10 | 0 | 5 | 0 | 2 | 0 |
| Yices2 | 0 | 10424 | 5986.40 | 5986.40 | 0 | 5 | 0 | 5 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 39905 | 76.10 | 76.10 | 0 | 5 | 0 | 2 | 0 |
| SMTInterpol | 0 | 37716 | 62.81 | 62.81 | 0 | 4 | 1 | 0 | 0 |