Refutation completeness refers to the ability of a logical system to derive a contradiction from any unsatisfiable set of formulas, ensuring that all false statements can be disproven within the system. It is a crucial property for automated theorem proving, as it guarantees that if a statement is false, the system can demonstrate its falsehood through a derivation of a contradiction.