The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFBV logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 327 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Yices2 | Yices2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2022-Bitwuzlan | 0 | 827563 | 9960.054 | 9961.547 | 2 | 0 |
Yices2 | 0 | 624070 | 1280.059 | 1281.041 | 46 | 0 |
Bitwuzla Fixedn | 0 | 224917 | 11437.396 | 11438.072 | 2 | 0 |
Bitwuzla | 0 | 224917 | 11468.963 | 11470.64 | 2 | 0 |
cvc5 | 0 | 3655 | 14005.946 | 13954.895 | 9 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2022-Bitwuzlan | 0 | 827563 | 9960.054 | 9961.547 | 2 | 0 |
Yices2 | 0 | 624070 | 1280.059 | 1281.041 | 46 | 0 |
Bitwuzla Fixedn | 0 | 224917 | 11437.396 | 11438.072 | 2 | 0 |
Bitwuzla | 0 | 224917 | 11468.963 | 11470.64 | 2 | 0 |
cvc5 | 0 | 3655 | 11606.406 | 11554.725 | 9 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.