The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BVFPLRA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 52 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 | 329 | 12827.968 | 12825.01 | 7 | 0 |
2021-Bitwuzlan | 0 | 319 | 12101.128 | 12103.026 | 9 | 0 |
z3-4.8.17n | 0 | 231 | 28641.434 | 28648.49 | 21 | 0 |
cvc5 | 0 | 53 | 42850.999 | 42855.578 | 33 | 0 |
MathSATn | 0 | 0 | 0.905 | 0.932 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 329 | 12829.728 | 12824.85 | 7 | 0 |
2021-Bitwuzlan | 0 | 319 | 12102.478 | 12102.626 | 9 | 0 |
z3-4.8.17n | 0 | 231 | 28646.994 | 28647.49 | 21 | 0 |
cvc5 | 0 | 53 | 42854.329 | 42854.588 | 33 | 0 |
MathSATn | 0 | 0 | 0.905 | 0.932 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.