The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the AUFNIA logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 3 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| — | — |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| UltimateEliminator+MathSAT | 0 | 0 | 19.56 | 8.789 | 0 | 0 |
| 2020-CVC4-ucn | 0 | 0 | 3598.9 | 3600.22 | 3 | 0 |
| cvc5-uc | 0 | 0 | 3599.55 | 3600.1 | 3 | 0 |
| z3n | 0 | 0 | 3599.61 | 3600.05 | 3 | 0 |
| Vampire | 0 | 0 | 3600.0 | 3600.0 | 3 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| UltimateEliminator+MathSAT | 0 | 0 | 19.56 | 8.789 | 0 | 0 |
| 2020-CVC4-ucn | 0 | 0 | 3600.0 | 3600.0 | 3 | 0 |
| cvc5-uc | 0 | 0 | 3600.0 | 3600.0 | 3 | 0 |
| Vampire | 0 | 0 | 3600.0 | 3600.0 | 3 | 0 |
| z3n | 0 | 0 | 3600.0 | 3600.0 | 3 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.