The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLIA logic in the Incremental Track.
Page generated on 2022-08-10 11:18:22 +0000
Benchmarks: 386 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Yices2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
z3-4.8.17n | 0 | 488624 | 85744.806 | 85728.96 | 5930 | 67 | 0 |
2020-z3n | 0 | 488230 | 85369.556 | 85353.732 | 6324 | 67 | 0 |
MathSATn | 0 | 485973 | 117016.092 | 116996.636 | 8581 | 95 | 0 |
Yices2 | 0 | 484512 | 90954.815 | 90941.252 | 10042 | 71 | 0 |
smtinterpol | 0 | 484118 | 117873.049 | 115834.619 | 10436 | 91 | 0 |
cvc5 | 0 | 372893 | 112009.61 | 112008.283 | 121661 | 87 | 0 |
OpenSMT | 0 | 22173 | 119971.106 | 119913.881 | 472381 | 95 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.