The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFNRA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 1 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
cvc5-inc |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
z3n | 0 | 6 | 0.033 | 0.032 | 0 | 0 | 0 |
cvc5-inc | 0 | 6 | 0.035 | 0.033 | 0 | 0 | 0 |
SMTInterpol | 0 | 6 | 0.558 | 0.361 | 0 | 0 | 0 |
MathSAT5n | 0 | 0 | 0.005 | 0.021 | 6 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.