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 2022-08-10 11:18:21 +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 |
|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 663 | 5.641 | 5.636 | 0 | 0 | 0 |
| 2021-Bitwuzla - fixedn | 0 | 663 | 5.783 | 5.77 | 0 | 0 | 0 |
| MathSATn | 0 | 663 | 18.782 | 18.753 | 0 | 0 | 0 |
| cvc5 | 0 | 663 | 19.602 | 19.491 | 0 | 0 | 0 |
| z3-4.8.17n | 0 | 663 | 73.547 | 73.566 | 0 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.