The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABV logic in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 636 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 | 1296 | 19257.624 | 19219.013 | 30 | 13 | 0 |
| 2020-Yices2 incrementaln | 0 | 1295 | 18821.114 | 18790.361 | 31 | 13 | 0 |
| Bitwuzla | 0 | 1292 | 49647.347 | 49632.718 | 34 | 31 | 0 |
| MathSATn | 0 | 1239 | 27404.082 | 27341.327 | 87 | 19 | 0 |
| cvc5 | 0 | 1222 | 42843.418 | 42779.087 | 104 | 29 | 0 |
| z3-4.8.17n | 0 | 1147 | 178971.182 | 178944.208 | 179 | 134 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.