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 Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 25 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 | 25 | 19.519 | 19.545 | 0 | 0 |
Bitwuzla Fixedn | 0 | 25 | 27.311 | 19.403 | 0 | 0 |
cvc5 | 0 | 25 | 111.459 | 111.479 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla Fixedn | 0 | 25 | 27.311 | 19.403 | 0 | 0 |
Bitwuzla | 0 | 25 | 19.519 | 19.545 | 0 | 0 |
cvc5 | 0 | 25 | 111.459 | 111.479 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.