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 of superposition 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 coincide. From this
perspective the SCL calculus can be viewed as a generalization of the
superposition calculus.

通过固定减少顺序，基于超前法逻辑来推导非冗余子句，本研究展示了 SCL (FOL) 可以模拟无相等符号的一阶逻辑。我们建立一个地面部分模型，根据固定的顺序来执行基于超前法的推理，其中假面积分的最小 false 地面实例触发非冗余超级位置推论。我们定义了 SCL 计算的相应策略，使得由 SCL 学习的子句和超前法推论的子句重合。从这个角度来看，SCL 计算可以被看作是超前法计算的一般化。