The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FPLRA logic in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +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 | 48 | 0.171 | 0.169 | 0 | 0 | 0 |
cvc5 | 0 | 48 | 0.351 | 0.346 | 0 | 0 | 0 |
MathSATn | 0 | 48 | 0.501 | 0.499 | 0 | 0 | 0 |
z3-4.8.17n | 0 | 48 | 19.035 | 19.04 | 0 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.