While it is obvious that a satisfiable instance will have a simple yes-certificate, it is not known if for any unsatisfiable instance there is a short no-certificate (i.e. SAT is in NP, but believed not to be in coNP). The Jewish problems had to have simple solutions, while it could be hard to find a small proof of unsatisfiability of some large formula.
