The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_AUFLIA logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 72
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| SMTInterpol | - | - | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 3886093 | 18830.63 | 18830.63 | 0 | 72 | 0 | 2 | 0 |
| cvc5 | 0 | 3692246 | 21445.59 | 21445.59 | 0 | 72 | 0 | 7 | 0 |
| Yices2 | 0 | 2896701 | 1702.26 | 1702.26 | 0 | 72 | 0 | 0 | 0 |
| OpenSMT | 0 | 320160 | 5676.82 | 5679.66 | 0 | 72 | 0 | 4 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 346817 | 142.82 | 142.82 | 0 | 58 | 14 | 0 | 0 |
| SMTInterpol | 0 | 46905 | 201.09 | 201.09 | 0 | 48 | 24 | 0 | 0 |
| cvc5 | 0 | 37903 | 67.09 | 67.09 | 0 | 44 | 28 | 2 | 0 |
| OpenSMT | 0 | 32252 | 72.46 | 75.30 | 0 | 65 | 7 | 0 | 0 |