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 2023-07-06 16:05:24 +0000
Benchmarks: 506 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 |
---|---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 14646 | 39.91 | 72.66 | 0 | 0 | 0 |
cvc5 | 0 | 14632 | 17723.81 | 17773.45 | 14 | 1 | 0 |
Yices2 Fixedn | 0 | 14472 | 1622.62 | 1653.69 | 174 | 6 | 0 |
Yices2 | 0 | 14472 | 1643.2 | 1675.03 | 174 | 6 | 0 |
SMTInterpol | 0 | 11929 | 1371.97 | 583.8 | 2717 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.