Abstract We prove the SOS strategy for first-order resolution to be refutationally complete on a clause setNand set-of-supportSif and only if there exists a clause inSthat occurs in a resolution refutation from $$N\cup S$$ N∪S . This strictly generalizes and sharpens the original completeness result requiringNto be satisfiable. The generalized SOS completeness result supports automated reasoning on a new notion of relevance aiming at capturing the support of a clause in the refutation of a clause set. A clauseCisrelevantfor refuting a clause setNifCoccurs in every refutation ofN. The clauseCissemi-relevant, if it occurs in some refutation, i.e., if there exists an SOS refutation with set-of-support $$S = \{C\}$$ S={C} from $$N\setminus \{C\}$$ N\{C} . A clause that does not occur in any refutation fromNisirrelevant, i.e., it is not semi-relevant. Our new notion of relevance separates clauses in a proof that are ultimately needed from clauses that may be replaced by different clauses. In this way it provides insights towards proof explanation in refutations beyond existing notions such as that of an unsatisfiable core.