The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FP logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 10050 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
cvc5 | cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla Fixedn | 0 | 87 | 7890.666 | 7948.83 | 14 | 0 |
cvc5 | 0 | 86 | 5904.478 | 5901.56 | 17 | 0 |
2022-z3-4.8.17n | 0 | 20 | 9448.778 | 9323.769 | 733 | 0 |
Bitwuzla | 17* | 5 | 9060.007 | 9109.641 | 13 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla Fixedn | 0 | 87 | 7890.666 | 7948.83 | 14 | 0 |
cvc5 | 0 | 86 | 5904.478 | 5901.56 | 17 | 0 |
2022-z3-4.8.17n | 0 | 20 | 9448.778 | 9323.769 | 733 | 0 |
Bitwuzla | 17* | 5 | 9060.007 | 9109.641 | 13 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.
* The error score is caused by Bitwuzla using the wrong names in the unsat core output (syntactic problems). It does not indicate an unsoundness.