The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_ALIA 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 | 530398 | 348.91 | 348.91 | 0 | 44 | 0 | 0 | 0 |
SMTInterpol | 0 | 530398 | 4155.97 | 4155.97 | 0 | 44 | 0 | 0 | 0 |
cvc5 | 0 | 530380 | 1550.43 | 1550.43 | 0 | 44 | 0 | 1 | 0 |
OpenSMT | 0 | 110015 | 51117.81 | 51117.81 | 0 | 44 | 0 | 40 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
Yices2 | 0 | 305040 | 74.04 | 74.04 | 0 | 38 | 6 | 0 | 0 |
SMTInterpol | 0 | 271617 | 524.89 | 524.89 | 0 | 36 | 8 | 0 | 0 |
cvc5 | 0 | 266439 | 355.29 | 355.29 | 0 | 36 | 8 | 0 | 0 |