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 2022-08-10 11:18:21 +0000
Benchmarks: 3 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5 | 0 | 23488 | 84.844 | 81.927 | 0 | 0 | 0 |
smtinterpol | 0 | 23486 | 135.962 | 50.028 | 2 | 0 | 0 |
UltimateEliminator+MathSAT | 0 | 13284 | 3004.5 | 2969.417 | 10204 | 2 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.