The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_AUFBVNIA logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 44
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| Yices2 | - | - | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 70 | 10007.82 | 10011.52 | 0 | 44 | 0 | 6 | 0 |
| cvc5 | 0 | 65 | 14732.08 | 14738.64 | 0 | 44 | 0 | 11 | 0 |
| SMTInterpol | 0 | 30 | 17328.77 | 16976.66 | 0 | 44 | 0 | 10 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 53 | 89.79 | 89.79 | 0 | 31 | 13 | 0 | 0 |
| cvc5 | 0 | 36 | 87.57 | 87.57 | 0 | 21 | 23 | 0 | 0 |
| SMTInterpol | 0 | 14 | 93.06 | 93.06 | 0 | 19 | 25 | 0 | 0 |