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 Incremental Track.
Page generated on 2022-08-10 11:18:22 +0000
Benchmarks: 889 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 15814 | 135.018 | 112.833 | 0 | 0 | 0 |
| z3-4.8.17n | 0 | 15814 | 295.046 | 270.049 | 0 | 0 | 0 |
| 2021-z3n | 0 | 15814 | 349.706 | 326.889 | 0 | 0 | 0 |
| cvc5 | 0 | 15814 | 1009.88 | 956.065 | 0 | 0 | 0 |
| smtinterpol | 0 | 15814 | 4322.347 | 1802.314 | 0 | 0 | 0 |
| OpenSMT | 0 | 15783 | 1179.768 | 1155.378 | 31 | 0 | 0 |
| MathSATn | 0 | 716 | 184.656 | 167.228 | 15098 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.