logic Definition Satisfiable Formula A formula is satisfiable if there exists at least one model under which it is true. Formally, a formula is satisfiable if In that case, is a model of . Equivalently, a formula is satisfiable exactly when it is not a contradiction.