The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the ANIA logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 3
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| cvc5 | - | - | cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 23488 | 35.11 | 35.11 | 0 | 3 | 0 | 0 | 0 |
| SMTInterpol | 0 | 23488 | 49.46 | 49.46 | 0 | 3 | 0 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 170 | 5.49 | 5.49 | 0 | 3 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 23488 | 35.11 | 35.11 | 0 | 3 | 0 | 0 | 0 |
| SMTInterpol | 0 | 12733 | 24.83 | 24.83 | 0 | 2 | 1 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 170 | 5.49 | 5.49 | 0 | 3 | 0 | 0 | 0 |