Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to first-order logic with equality. In this article, we port inprocessing techniques to work with superposition, a leading first-order proof calculus, and we strengthen known preprocessing techniques. Specifically, we look into elimination of hidden literals, variables (predicates), and blocked clauses. Our evaluation using the Zipperposition prover confirms that the new techniques usefully supplement the existing superposition machinery.

中文翻译：

---

SAT 启发的叠加消除

优化的 SAT 求解器不仅预处理子句集，还在求解过程中将其转换为处理中。一些预处理技术已经推广到具有相等性的一阶逻辑。在本文中，我们移植了处理技术以与叠加（一种领先的一阶证明演算）一起使用，并且我们加强了已知的预处理技术。具体来说，我们研究了隐藏文字、变量（谓词）和阻塞子句的消除。我们使用 Zipperposition prover 进行的评估证实，新技术有效地补充了现有的叠加机制。