The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the AUFDTNIRA logic in the Parallel Track.
Page generated on 2022-08-10 14:49:55 +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 |
|---|---|---|---|---|---|---|---|---|---|
| Vampire | 0 | 0 | 10800.0 | 0 | 0 | 0 | 9 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Vampire | 0 | 0 | 0.0 | 0 | 0 | 0 | 0 | 9 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | N/A | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|
| Vampire | 0 | 0 | 0.0 | 0 | 0 | 0 | 0 | 9 | 0 | 0 |
| Solver | Error Score | Correct Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| Vampire | 0 | 0 | 216.0 | 0 | 0 | 0 | 9 | 9 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.