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 Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 124 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 | 124 | 184.872 | 184.162 | 0 | 0 |
Bitwuzla Fixedn | 0 | 123 | 181.866 | 182.185 | 0 | 0 |
2022-Bitwuzlan | 0 | 120 | 146.277 | 146.311 | 1 | 0 |
cvc5 | 0 | 120 | 688.602 | 689.169 | 1 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 124 | 184.872 | 184.162 | 0 | 0 |
Bitwuzla Fixedn | 0 | 123 | 181.866 | 182.185 | 0 | 0 |
2022-Bitwuzlan | 0 | 120 | 146.277 | 146.311 | 1 | 0 |
cvc5 | 0 | 120 | 688.602 | 689.169 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.