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 2023-07-06 16:05:24 +0000
Benchmarks: 636 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
Bitwuzla | 0 | 1691 | 12082.07 | 12129.87 | 18 | 18 | 0 |
Yices2 Fixedn | 0 | 1682 | 6096.38 | 6134.36 | 27 | 14 | 0 |
Yices2 | 0 | 1682 | 6234.93 | 6272.27 | 27 | 14 | 0 |
2022-Yices2n | 0 | 1682 | 6301.47 | 6341.32 | 27 | 14 | 0 |
cvc5 | 0 | 1228 | 16452.9 | 16498.95 | 481 | 197 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.