We show that SCL(FOL) can simulate the derivation of non-redundant clauses by superposition for first-order logic without equality. Superposition based reasoning is performed with respect to a fixed reduction ordering. The completeness proof relies on the grounding of the clause set. It builds a ground partial model according to the fixed ordering, where minimal false ground instances of clauses then trigger non-redundant superposition inferences. We define a respective strategy for the SCL calculus such that clauses learned by SCL and superposition inferences eventually coincide. From this perspective the SCL calculus can be viewed as a generalization of the superposition calculus.