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 Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 1965 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Bitwuzla | Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2020-Bitwuzlan | 0 | 16778 | 1501.743 | 1502.747 | 0 | 0 |
2020-Bitwuzla-fixedn | 0 | 16767 | 1599.112 | 1590.188 | 0 | 0 |
Bitwuzla | 0 | 16684 | 1576.345 | 1565.451 | 0 | 0 |
cvc5-uc | 0 | 16440 | 20873.006 | 20857.718 | 12 | 0 |
MathSAT5n | 0 | 70 | 158.621 | 164.135 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2020-Bitwuzlan | 0 | 16778 | 1501.743 | 1502.747 | 0 | 0 |
2020-Bitwuzla-fixedn | 0 | 16767 | 1599.112 | 1590.188 | 0 | 0 |
Bitwuzla | 0 | 16684 | 1576.345 | 1565.451 | 0 | 0 |
cvc5-uc | 0 | 16440 | 20875.506 | 20857.298 | 12 | 0 |
MathSAT5n | 0 | 70 | 158.621 | 164.135 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.