The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UF logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 2061 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| Yices2 | SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2022-z3-4.8.17n | 0 | 300004 | 5425.663 | 5410.913 | 0 | 0 |
| Yices2 | 0 | 298721 | 3592.775 | 3531.785 | 0 | 0 |
| SMTInterpol | 0 | 295571 | 25591.551 | 12139.659 | 27 | 0 |
| cvc5 | 0 | 218164 | 6292.54 | 6236.887 | 1 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2022-z3-4.8.17n | 0 | 300004 | 5425.663 | 5410.913 | 0 | 0 |
| SMTInterpol | 0 | 299885 | 36659.761 | 17773.2 | 21 | 0 |
| Yices2 | 0 | 298721 | 3592.775 | 3531.785 | 0 | 0 |
| cvc5 | 0 | 218164 | 5092.66 | 5036.777 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.