The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the NIA logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 2 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 |
|---|---|---|---|---|---|---|
| z3n | 0 | 0 | 0.12 | 0.122 | 0 | 0 |
| cvc5-uc | 0 | 0 | 0.374 | 0.373 | 0 | 0 |
| 2020-CVC4-ucn | 0 | 0 | 0.38 | 0.38 | 0 | 0 |
| Vampire | 0 | 0 | 376.15 | 95.928 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 1215.486 | 1206.041 | 1 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| z3n | 0 | 0 | 0.12 | 0.122 | 0 | 0 |
| cvc5-uc | 0 | 0 | 0.374 | 0.373 | 0 | 0 |
| 2020-CVC4-ucn | 0 | 0 | 0.38 | 0.38 | 0 | 0 |
| Vampire | 0 | 0 | 376.15 | 95.928 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 1215.486 | 1206.041 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.