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 Incremental Track.
Page generated on 2022-08-10 11:18:22 +0000
Benchmarks: 1 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
Bitwuzla | 0 | 2 | 0.14 | 0.14 | 0 | 0 | 0 |
2021-Bitwuzla - fixedn | 0 | 2 | 0.164 | 0.164 | 0 | 0 | 0 |
cvc5 | 0 | 2 | 0.557 | 0.556 | 0 | 0 | 0 |
MathSATn | 0 | 2 | 1.215 | 1.214 | 0 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.