The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFIDL logic in the Parallel Track. Chart
Results were generated on 2025-08-11
Benchmarks: 36
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Sequential Performance | Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|---|
| - | SMTS | - | SMTS | - |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| SMTS | 0 | 13 | 519348.70 | 4571.65 | 13 | 0 | 13 | 23 | 0 | 21 | 0 |
| Yices2 | 0 | 3 | 88288.86 | 693.39 | 3 | 0 | 3 | 33 | 0 | 33 | 0 |
| SMTS (32 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 36 | 0 | 0 | 0 |
| SMTS (64 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 36 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| SMTS | 0 | 13 | 519348.70 | 4571.65 | 13 | 0 | 13 | 23 | 0 | 21 | 0 |
| Yices2 | 0 | 3 | 88288.86 | 693.39 | 3 | 0 | 3 | 33 | 0 | 33 | 0 |
| SMTS (32 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 36 | 0 | 0 | 0 |
| SMTS (64 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 36 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| SMTS (32 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 36 | 0 | 0 | 0 |
| SMTS (64 cores) n | 0 | 0 | 0.00 | 0.00 | 0 | 0 | 0 | 36 | 0 | 0 | 0 |