The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BVFP logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 1589 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Bitwuzla | Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 14446 | 15030.322 | 15025.427 | 19 | 0 |
Bitwuzla Fixedn | 0 | 14297 | 728.569 | 730.314 | 2 | 0 |
Bitwuzla | 0 | 14297 | 731.641 | 732.386 | 2 | 0 |
cvc5 | 0 | 13933 | 1968.259 | 1924.808 | 2 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 14446 | 15030.322 | 15025.427 | 19 | 0 |
Bitwuzla Fixedn | 0 | 14297 | 728.569 | 730.314 | 2 | 0 |
Bitwuzla | 0 | 14297 | 731.641 | 732.386 | 2 | 0 |
cvc5 | 0 | 13933 | 1968.259 | 1924.808 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.