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 2022-08-10 11:18:51 +0000
Benchmarks: 1588 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 |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 14229 | 4035.175 | 4035.308 | 2 | 0 |
2021-Bitwuzlan | 0 | 14183 | 3794.164 | 3791.79 | 2 | 0 |
z3-4.8.17n | 0 | 13913 | 45680.391 | 45668.279 | 26 | 0 |
cvc5 | 0 | 11601 | 298846.162 | 298843.709 | 214 | 0 |
MathSATn | 0 | 125 | 26.7 | 27.384 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 14229 | 4035.735 | 4035.248 | 2 | 0 |
2021-Bitwuzlan | 0 | 14183 | 3794.344 | 3791.71 | 2 | 0 |
z3-4.8.17n | 0 | 13913 | 45684.871 | 45666.819 | 26 | 0 |
cvc5 | 0 | 11601 | 298869.942 | 298835.679 | 214 | 0 |
MathSATn | 0 | 125 | 26.7 | 27.384 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.