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 2021-07-18 17:31:25 +0000
Benchmarks: 10031 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 |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 92 | 8823.195 | 8737.012 | 0 | 0 |
2020-Bitwuzlan | 0 | 90 | 7922.137 | 7747.106 | 0 | 0 |
2020-Bitwuzla-fixedn | 0 | 89 | 7537.58 | 7435.228 | 0 | 0 |
cvc5-uc | 0 | 84 | 26169.199 | 25926.23 | 2 | 0 |
z3n | 0 | 25 | 910783.789 | 910801.694 | 710 | 0 |
MathSAT5n | 0 | 0 | 183.069 | 197.948 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 92 | 8823.195 | 8737.012 | 0 | 0 |
2020-Bitwuzlan | 0 | 90 | 7922.137 | 7747.106 | 0 | 0 |
2020-Bitwuzla-fixedn | 0 | 89 | 7537.58 | 7435.228 | 0 | 0 |
cvc5-uc | 0 | 84 | 26169.329 | 25926.21 | 2 | 0 |
z3n | 0 | 25 | 910891.129 | 910769.334 | 710 | 0 |
MathSAT5n | 0 | 0 | 183.069 | 197.948 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.