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 Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 166 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 |
|---|---|---|---|---|---|---|---|
| 2020-Bitwuzla-fixedn | 0 | 663 | 5.543 | 5.535 | 0 | 0 | 0 |
| Bitwuzla - fixedn | 0 | 663 | 5.672 | 5.642 | 0 | 0 | 0 |
| Bitwuzla | 0 | 663 | 5.725 | 5.7 | 0 | 0 | 0 |
| MathSAT5n | 0 | 663 | 17.843 | 17.795 | 0 | 0 | 0 |
| cvc5-inc | 0 | 663 | 20.638 | 19.945 | 0 | 0 | 0 |
| 2020-CVC4-incn | 0 | 663 | 21.581 | 21.522 | 0 | 0 | 0 |
| z3n | 0 | 663 | 75.962 | 74.718 | 0 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.