Satisfiable (Predicate Logic)

A formula is satisfiable if it admits a model, e.g. this formula is a contradiction: $(\forall x)(P(x)\to Q(x))$.