The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FPArith division in the Parallel Track.
Page generated on 2021-07-18 17:32:11 +0000
Benchmarks: 18 Time Limit: 1200 seconds Memory Limit: N/A GB
Logics: 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 | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5-gg | 0 | 7 | 16779.959 | 7 | 0 | 7 | 11 | 0 | 11 | 0 |
| Par4n | 9 | 9 | 0.165 | 9 | 9 | 0 | 9 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5-gg | 0 | 0 | 10800.0 | 0 | 0 | 0 | 9 | 9 | 11 | 0 |
| Par4n | 9 | 9 | 0.165 | 9 | 9 | 0 | 0 | 9 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5-gg | 0 | 7 | 5979.959 | 7 | 0 | 7 | 2 | 9 | 11 | 0 |
| Par4n | 0 | 0 | 0.0 | 0 | 0 | 0 | 9 | 9 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| cvc5-gg | 0 | 0 | 432.0 | 0 | 0 | 0 | 18 | 0 | 18 | 0 |
| Par4n | 9 | 9 | 0.165 | 9 | 9 | 0 | 9 | 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.