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 Parallel Track.
Page generated on 2021-07-18 17:32:11 +0000
Benchmarks: 15 Time Limit: 1200 seconds Memory Limit: N/A GB
This track is experimental. Solvers are only ranked by performance, but no winner is selected.
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| cvc5-gg | 0 | 6 | 14319.933 | 6 | 0 | 6 | 9 | 9 | 0 |
| Par4n | 8 | 7 | 0.138 | 7 | 7 | 0 | 8 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5-gg | 0 | 0 | 8400.0 | 0 | 0 | 0 | 7 | 8 | 9 | 0 |
| Par4n | 8 | 7 | 0.138 | 7 | 7 | 0 | 0 | 8 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5-gg | 0 | 6 | 5919.933 | 6 | 0 | 6 | 2 | 7 | 9 | 0 |
| Par4n | 0 | 0 | 0.0 | 0 | 0 | 0 | 8 | 7 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| cvc5-gg | 0 | 0 | 360.0 | 0 | 0 | 0 | 15 | 15 | 0 |
| Par4n | 8 | 7 | 0.138 | 7 | 7 | 0 | 8 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.