The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFLIA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 386
Time Limit: 1200 seconds
Memory Limit: 20480 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 | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 758191 | 92666.446602 | 92750.163463 | 0 | 0 | 0 | 386 | 0 | 72 | 0 |
| SMTInterpol | 0 | 758032 | 167117.787822 | 116755.881342 | 0 | 0 | 0 | 386 | 0 | 92 | 0 |
| cvc5 | 0 | 636713 | 117316.44616 | 117433.387992 | 0 | 0 | 0 | 386 | 0 | 88 | 0 |
| OpenSMT | 0 | 97848 | 129862.910621 | 129977.295868 | 0 | 0 | 0 | 386 | 0 | 104 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 275059 | 136.879713 | 164.395293 | 0 | 0 | 0 | 297 | 89 | 0 | 0 |
| OpenSMT | 0 | 1246 | 293.98688 | 321.025098 | 0 | 0 | 0 | 272 | 114 | 0 | 0 |
| cvc5 | 0 | 961 | 121.097867 | 148.690216 | 0 | 0 | 0 | 276 | 110 | 0 | 0 |
| SMTInterpol | 0 | 882 | 620.547247 | 261.583342 | 0 | 0 | 0 | 273 | 113 | 0 | 0 |