The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFFP logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 2 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
— | — |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
MathSAT5n | 0 | 0 | 0.035 | 0.035 | 0 | 0 |
Bitwuzla | 0 | 0 | 0.21 | 0.21 | 0 | 0 |
2020-Bitwuzlan | 0 | 0 | 0.21 | 0.211 | 0 | 0 |
2020-Bitwuzla-fixedn | 0 | 0 | 0.244 | 0.244 | 0 | 0 |
cvc5-uc | 0 | 0 | 0.711 | 0.71 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
MathSAT5n | 0 | 0 | 0.035 | 0.035 | 0 | 0 |
Bitwuzla | 0 | 0 | 0.21 | 0.21 | 0 | 0 |
2020-Bitwuzlan | 0 | 0 | 0.21 | 0.211 | 0 | 0 |
2020-Bitwuzla-fixedn | 0 | 0 | 0.244 | 0.244 | 0 | 0 |
cvc5-uc | 0 | 0 | 0.711 | 0.71 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.