The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFLIA logic in the Parallel Track. Chart
Results were generated on 2026-07-25
Benchmarks: 27
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Sequential Performance | Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|---|
| - | z3-parallel | z3-parallel | z3-parallel | - |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| z3-parallel | 0 | 11 | 99281.92 | 2745.74 | 11 | 8 | 3 | 16 | 0 | 16 | 0 |
| OpenSMT-SMTS ne | 0 | 0 (base +0) | 0.00 | 0.00 | 0 | 0 | 0 | 27 | 0 | 27 | 0 |
| OpenSMT-SMTS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 27 | 0 | 27 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| z3-parallel | 0 | 8 | 78111.77 | 2121.93 | 8 | 8 | 0 | 0 | 19 | 0 | 0 |
| OpenSMT-SMTS ne | 0 | 0 (base +0) | 0.00 | 0.00 | 0 | 0 | 0 | 8 | 19 | 8 | 0 |
| OpenSMT-SMTS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 8 | 19 | 8 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| z3-parallel | 0 | 3 | 21170.14 | 623.81 | 3 | 0 | 3 | 0 | 24 | 0 | 0 |
| OpenSMT-SMTS ne | 0 | 0 (base +0) | 0.00 | 0.00 | 0 | 0 | 0 | 3 | 24 | 3 | 0 |
| OpenSMT-SMTS-base n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 3 | 24 | 3 | 0 |