The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UFIDL logic in the Parallel Track.
Page generated on 2021-07-18 17:32:11 +0000
Benchmarks: 9 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 | 4 | 3607.836 | 4 | 0 | 4 | 5 | 3 | 0 |
Par4n | 0 | 1 | 10080.297 | 1 | 1 | 0 | 8 | 8 | 0 |
Vampire | 0 | 0 | 10800.0 | 0 | 0 | 0 | 9 | 9 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
Par4n | 0 | 1 | 480.297 | 1 | 1 | 0 | 0 | 8 | 8 | 0 |
cvc5-gg | 0 | 0 | 1200.0 | 0 | 0 | 0 | 1 | 8 | 3 | 0 |
Vampire | 0 | 0 | 1200.0 | 0 | 0 | 0 | 1 | 8 | 9 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|---|
cvc5-gg | 0 | 4 | 7.836 | 4 | 0 | 4 | 0 | 5 | 3 | 0 |
Par4n | 0 | 0 | 4800.0 | 0 | 0 | 0 | 4 | 5 | 8 | 0 |
Vampire | 0 | 0 | 4800.0 | 0 | 0 | 0 | 4 | 5 | 9 | 0 |
Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|---|---|
cvc5-gg | 0 | 4 | 79.836 | 4 | 0 | 4 | 5 | 3 | 0 |
Par4n | 0 | 0 | 216.0 | 0 | 0 | 0 | 9 | 9 | 0 |
Vampire | 0 | 0 | 216.0 | 0 | 0 | 0 | 9 | 9 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.