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 Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 7 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 | 1876 | 108.58 | 108.88 | 0 | 0 | 0 |
cvc5 | 0 | 1876 | 157.87 | 158.54 | 0 | 0 | 0 |
2022-Bitwuzlan | 0 | 1876 | 345.1 | 345.58 | 0 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.