Unsatisfiable (Predicate Logic)

A formula is unsatisfiable (contradiction) if it does not admit any model, e.g. this formula is a tautology: $(\exists x)(P(x)\wedge \neg P(x))$.