The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABVFPLRA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 5 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
cvc5 | cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 1933 | 965.465 | 965.797 | 0 | 0 |
z3-4.8.17n | 0 | 1269 | 1765.055 | 1765.566 | 1 | 0 |
2021-Bitwuzlan | 0 | 0 | 0.023 | 0.059 | 0 | 0 |
Bitwuzla | 0 | 0 | 0.023 | 0.066 | 0 | 0 |
MathSATn | 0 | 0 | 0.155 | 0.156 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 1933 | 965.465 | 965.797 | 0 | 0 |
z3-4.8.17n | 0 | 1269 | 1765.325 | 1765.536 | 1 | 0 |
2021-Bitwuzlan | 0 | 0 | 0.023 | 0.059 | 0 | 0 |
Bitwuzla | 0 | 0 | 0.023 | 0.066 | 0 | 0 |
MathSATn | 0 | 0 | 0.155 | 0.156 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.