The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the BV logic in the Incremental Track.
Page generated on 2023-07-06 16:05:23 +0000
Benchmarks: 18 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
2019-Z3n | 0 | 37107 | 4495.59 | 4497.26 | 1749 | 6 | 0 |
cvc5 | 0 | 35821 | 2939.26 | 2938.89 | 3035 | 7 | 0 |
Bitwuzla | 0 | 34666 | 779.09 | 779.36 | 4190 | 7 | 0 |
UltimateEliminator+MathSAT | 0 | 18912 | 437.98 | 237.24 | 19944 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.