The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBVFP logic in the Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 1 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 Fixedn | 0 | 1 | 0.477 | 0.477 | 0 | 0 |
Bitwuzla | 0 | 1 | 0.478 | 0.478 | 0 | 0 |
cvc5 | 0 | 0 | 0.0 | 0.0 | 1 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla Fixedn | 0 | 1 | 0.477 | 0.477 | 0 | 0 |
Bitwuzla | 0 | 1 | 0.478 | 0.478 | 0 | 0 |
cvc5 | 0 | 0 | 0.0 | 0.0 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.