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 Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 196 Time Limit: 1200 seconds Memory Limit: 60 GB
This track is experimental. Solvers are only ranked by performance, but no winner is selected.
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 191 | 6063.191 | 6064.287 | 5 | 5 | 0 |
cvc5 | 0 | 180 | 15862.237 | 15819.763 | 16 | 11 | 0 |
smtinterpol | 0 | 65 | 133.871 | 72.04 | 131 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 191 | 6065.121 | 6064.097 | 5 | 5 | 0 |
cvc5 | 0 | 180 | 15864.577 | 15819.203 | 16 | 11 | 0 |
smtinterpol | 0 | 65 | 133.871 | 72.04 | 131 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.