The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NRA logic in the Cloud Track.
Page generated on 2021-07-18 17:32:03 +0000
Benchmarks: 16 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 | 5 | 16541.378 | 5 | 3 | 2 | 11 | 11 | 0 |
cvc5-gg | 0 | 2 | 15643.111 | 2 | 1 | 1 | 14 | 13 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 3 | 6054.903 | 3 | 3 | 0 | 3 | 10 | 11 | 0 |
cvc5-gg | 0 | 1 | 6003.407 | 1 | 1 | 0 | 5 | 10 | 13 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 2 | 886.475 | 2 | 0 | 2 | 0 | 14 | 11 | 0 |
cvc5-gg | 0 | 1 | 1239.704 | 1 | 0 | 1 | 1 | 14 | 13 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
cvc5-gg | 0 | 1 | 339.407 | 1 | 1 | 0 | 15 | 14 | 0 |
Par4n | 0 | 0 | 384.0 | 0 | 0 | 0 | 16 | 16 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.