The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the ANIA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 3 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2020-CVC4-incn | 0 | 23488 | 555.461 | 552.641 | 0 | 0 | 0 |
| SMTInterpol | 0 | 23486 | 130.868 | 46.033 | 2 | 0 | 0 |
| cvc5-inc | 0 | 23486 | 56.374 | 53.787 | 2 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 13023 | 3162.4 | 3122.431 | 10465 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.