The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the BVFP logic in the Incremental Track.
Page generated on 2023-07-06 16:05:23 +0000
Benchmarks: 1 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
Bitwuzla | 0 | 458 | 19.58 | 19.61 | 0 | 0 | 0 |
2022-Bitwuzlan | 0 | 285 | 74.38 | 74.44 | 173 | 0 | 0 |
cvc5 | 0 | 231 | 1.66 | 1.69 | 227 | 1 | 0 |
UltimateEliminator+MathSAT | 0 | 231 | 47.88 | 41.16 | 227 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.