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 Unsat Core Track.
Page generated on 2020-07-04 11:49:33 +0000
Benchmarks: 2 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| — | — |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| MathSAT5n | 0 | 0 | 0.035 | 0.035 | 0 | 0 | |
| Bitwuzla | 0 | 0 | 0.219 | 0.219 | 0 | 0 | |
| Bitwuzla-fixedn | 0 | 0 | 0.237 | 0.237 | 0 | 0 | |
| CVC4-uc | 0 | 0 | 0.837 | 0.836 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| MathSAT5n | 0 | 0 | 0.035 | 0.035 | 0 | 0 | |
| Bitwuzla | 0 | 0 | 0.219 | 0.219 | 0 | 0 | |
| Bitwuzla-fixedn | 0 | 0 | 0.237 | 0.237 | 0 | 0 | |
| CVC4-uc | 0 | 0 | 0.837 | 0.836 | 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.