We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses, or predicate symbols from the problem, with the aim of making it more amenable to automatic proof search. We also introduce a new technique, which we call quasipure literal elimination, that strictly subsumes pure literal elimination. The new techniques are implemented in the Zipperposition theorem prover. Our evaluation shows that they sometimes help prove problems originating from Isabelle formalizations and the TPTP library.

翻译：我们将若干命题逻辑预处理技术推广至更高阶逻辑，这些推广基于现有的一阶逻辑泛化方法。这些技术通过消解问题中的文字、子句或谓词符号，旨在提升自动证明搜索的可行性。我们同时提出一项名为准纯文字消解的新技术，该技术严格包含纯文字消解。新方法已在Zipperposition定理证明器中实现。评估表明，这些技术有时能有效辅助证明源自Isabelle形式化体系及TPTP库的问题。