The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FP logic in the Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 10137 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 |
---|---|---|---|---|---|---|
2022-Bitwuzlan | 0 | 10088 | 5802.058 | 5841.23 | 37 | 0 |
cvc5 | 0 | 10086 | 4365.286 | 4362.637 | 44 | 0 |
Bitwuzla | 0 | 10085 | 4475.793 | 4499.485 | 42 | 0 |
Bitwuzla Fixedn | 0 | 10085 | 4493.269 | 4547.67 | 42 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2022-Bitwuzlan | 0 | 10088 | 5802.058 | 5841.23 | 37 | 0 |
cvc5 | 0 | 10086 | 4365.286 | 4362.637 | 44 | 0 |
Bitwuzla | 0 | 10085 | 4475.793 | 4499.485 | 42 | 0 |
Bitwuzla Fixedn | 0 | 10085 | 4493.269 | 4547.67 | 42 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.