The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFNIA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 506 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 |
---|---|---|---|---|---|---|---|
cvc5-inc | 0 | 98582 | 507.28 | 493.13 | 0 | 0 | 0 |
z3n | 0 | 98580 | 108.321 | 101.71 | 2 | 0 | 0 |
SMTInterpol | 0 | 96488 | 1578.724 | 624.59 | 2094 | 0 | 0 |
MathSAT5n | 0 | 84573 | 40.926 | 44.074 | 14009 | 0 | 0 |
2020-MathSAT5n | 0 | 84573 | 79.715 | 44.32 | 14009 | 0 | 0 |
Yices2 incremental | 0 | 19180 | 1201.749 | 1205.962 | 79402 | 1 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.