First Order Logic - unsatisfiable set of formulas I know what is an unsatisfiable set of formulas in first order logic and I'm studying how to prove the unsatisfiability.
What I don't understand, I'm sorry a think as an engineer, is what get in practice when I prove that set of formulas is unsatisfiable. Can you intuitively explain this to me ?

Intuitively, proving that a set of formulas is unsatisfiable gives you something like the formal version of the engineering maxim: "Cheap. Fast. Reliable. Pick two."
Is this what you were asking?
