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 Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 300 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 | 2001 | 11367.419 | 11348.658 | 10 | 6 | 0 |
2021-Bitwuzla - fixedn | 0 | 2000 | 11624.675 | 11625.344 | 11 | 7 | 0 |
cvc5 | 0 | 1995 | 16860.254 | 16859.483 | 16 | 11 | 0 |
MathSATn | 0 | 1992 | 19102.315 | 19096.881 | 19 | 14 | 0 |
z3-4.8.17n | 0 | 1959 | 54143.719 | 54145.555 | 52 | 32 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.