The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFFP logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +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 | Timeout | Memout |
|---|---|---|---|---|---|---|
| MathSATn | 0 | 0 | 0.033 | 0.033 | 0 | 0 |
| cvc5 | 0 | 0 | 2399.99 | 2400.11 | 2 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| MathSATn | 0 | 0 | 0.033 | 0.033 | 0 | 0 |
| cvc5 | 0 | 0 | 2400.0 | 2400.0 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.