The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NIA logic in the Parallel Track.
Page generated on 2021-07-18 17:32:11 +0000
Benchmarks: 17 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 |
---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 6 | 14439.011 | 6 | 5 | 1 | 11 | 11 | 0 |
cvc5-gg | 0 | 1 | 16850.639 | 1 | 1 | 0 | 16 | 14 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 5 | 7231.771 | 5 | 5 | 0 | 5 | 7 | 11 | 0 |
cvc5-gg | 0 | 1 | 10850.639 | 1 | 1 | 0 | 9 | 7 | 14 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 1 | 1207.24 | 1 | 0 | 1 | 1 | 15 | 11 | 0 |
cvc5-gg | 0 | 0 | 1200.0 | 0 | 0 | 0 | 2 | 15 | 14 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 3 | 348.777 | 3 | 2 | 1 | 14 | 14 | 0 |
cvc5-gg | 0 | 0 | 360.0 | 0 | 0 | 0 | 17 | 15 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.