The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the LRA 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 | 14266.698 | 6 | 2 | 4 | 11 | 11 | 0 |
Vampire | 0 | 4 | 15757.903 | 4 | 0 | 4 | 13 | 13 | 0 |
cvc5-gg | 0 | 0 | 0.0 | 0 | 0 | 0 | 17 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 2 | 609.597 | 2 | 2 | 0 | 0 | 15 | 11 | 0 |
cvc5-gg | 0 | 0 | 0.0 | 0 | 0 | 0 | 2 | 15 | 0 | 0 |
Vampire | 0 | 0 | 2400.0 | 0 | 0 | 0 | 2 | 15 | 13 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
Vampire | 0 | 4 | 9757.903 | 4 | 0 | 4 | 8 | 5 | 13 | 0 |
Par4n | 0 | 4 | 10057.101 | 4 | 0 | 4 | 8 | 5 | 11 | 0 |
cvc5-gg | 0 | 0 | 0.0 | 0 | 0 | 0 | 12 | 5 | 0 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 3 | 337.851 | 3 | 1 | 2 | 14 | 14 | 0 |
cvc5-gg | 0 | 0 | 0.0 | 0 | 0 | 0 | 17 | 0 | 0 |
Vampire | 0 | 0 | 408.0 | 0 | 0 | 0 | 17 | 17 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.