The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABVFP logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 9214 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 | 279026 | 33914.73 | 34953.93 | 47 | 25 | 0 |
2022-Bitwuzlan | 0 | 278978 | 21558.9 | 22558.78 | 95 | 26 | 0 |
cvc5 | 0 | 238441 | 1637846.51 | 1639148.1 | 40632 | 1614 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.