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 Model Validation Track.
Page generated on 2022-08-10 11:19:11 +0000
Benchmarks: 7028 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 | 7027 | 1771.778 | 1786.847 | 1 | 0 |
z3-4.8.17n | 0 | 7026 | 3987.758 | 3940.438 | 1 | 0 |
MathSATn | 0 | 7020 | 1406.962 | 1397.743 | 0 | 0 |
cvc5 | 0 | 7020 | 1516.141 | 1515.245 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 7027 | 1771.838 | 1786.777 | 1 | 0 |
z3-4.8.17n | 0 | 7026 | 3988.018 | 3940.398 | 1 | 0 |
MathSATn | 0 | 7020 | 1406.962 | 1397.743 | 0 | 0 |
cvc5 | 0 | 7020 | 1516.141 | 1515.245 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.