The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFFP division in the Incremental Track.
Page generated on 2020-07-04 11:47:56 +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 | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| Bitwuzla-fixedn | 0 | 2 | 0.135 | 0.135 | 0 | 0 | 0 | |
| Bitwuzla | 0 | 2 | 0.138 | 0.138 | 0 | 0 | 0 | |
| CVC4-inc | 0 | 2 | 0.583 | 0.583 | 0 | 0 | 0 | |
| MathSAT5n | 0 | 2 | 1.199 | 1.199 | 0 | 0 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.