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 2022-08-10 11:18:51 +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 |
|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 249324 | 5305.172 | 5290.658 | 0 | 0 |
| 2021-z3n | 0 | 248543 | 5780.874 | 5834.665 | 0 | 0 |
| Yices2 | 0 | 247446 | 4515.018 | 4517.43 | 0 | 0 |
| MathSATn | 0 | 246132 | 2117.673 | 2097.609 | 0 | 0 |
| smtinterpol | 0 | 244447 | 58828.821 | 45285.866 | 28 | 0 |
| cvc5 | 0 | 149371 | 7768.658 | 7754.053 | 1 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 249324 | 5305.172 | 5290.658 | 0 | 0 |
| smtinterpol | 0 | 248767 | 63383.691 | 42486.842 | 19 | 0 |
| 2021-z3n | 0 | 248543 | 5780.874 | 5834.665 | 0 | 0 |
| Yices2 | 0 | 247446 | 4515.018 | 4517.43 | 0 | 0 |
| MathSATn | 0 | 246132 | 2117.673 | 2097.609 | 0 | 0 |
| cvc5 | 0 | 149371 | 7768.948 | 7754.023 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.