The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ANIA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 5
Time Limit: 1200 seconds
Memory Limit: 20480 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 | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 51724 | 263.881006 | 100.459748 | 0 | 0 | 0 | 5 | 0 | 0 | 0 |
| cvc5 | 0 | 51724 | 165.11587 | 165.459748 | 0 | 0 | 0 | 5 | 0 | 0 | 0 |
| Yices2 | 0 | 9526 | 6003.717469 | 6008.694307 | 0 | 0 | 0 | 5 | 0 | 5 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 37716 | 182.027248 | 64.494611 | 0 | 0 | 0 | 4 | 1 | 0 | 0 |
| cvc5 | 0 | 24668 | 45.40837 | 45.664842 | 0 | 0 | 0 | 3 | 2 | 0 | 0 |