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 2021-07-18 17:30:28 +0000
Benchmarks: 274 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 | 1958 | 10563.054 | 10563.372 | 12 | 7 | 0 |
Bitwuzla - fixedn | 0 | 1958 | 10585.572 | 10585.965 | 12 | 7 | 0 |
2020-Bitwuzla-fixedn | 0 | 1958 | 10981.559 | 10982.002 | 12 | 7 | 0 |
cvc5-inc | 0 | 1956 | 12962.466 | 12959.252 | 14 | 8 | 0 |
2020-CVC4-incn | 0 | 1951 | 16283.742 | 16283.167 | 19 | 11 | 0 |
z3n | 0 | 1847 | 61749.455 | 61740.329 | 123 | 41 | 0 |
MathSAT5n | 1 | 1952 | 14865.367 | 14859.92 | 18 | 10 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.