The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFLIA logic in the Parallel Track. Chart
Results were generated on 2025-08-11
Benchmarks: 19
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Sequential Performance | Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|---|
| - | Yices2 | Yices2 | - | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 7 | 355486.10 | 2787.29 | 7 | 7 | 0 | 12 | 0 | 12 | 0 |
| SMTS | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 19 | 0 | 17 | 0 |
| SMTS (32 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 19 | 0 | 0 | 0 |
| SMTS (64 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 19 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 7 | 355486.10 | 2787.29 | 7 | 7 | 0 | 0 | 12 | 0 | 0 |
| SMTS | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 7 | 12 | 7 | 0 |
| SMTS (32 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 7 | 12 | 0 | 0 |
| SMTS (64 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 7 | 12 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 1 | 2772.26 | 22.77 | 1 | 1 | 0 | 0 | 18 | 0 | 0 |
| SMTS (32 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 19 | 0 | 0 | 0 |
| SMTS (64 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 19 | 0 | 0 | 0 |