Lash is a higher-order automated theorem prover created as a fork of the theorem prover Satallax. The basic underlying calculus of Satallax is a ground tableau calculus whose rules only use shallow information about the terms and formulas taking part in the rule. Lash uses new, efficient C representations of vital structures and operations. Most importantly, Lash uses a C representation of (normal) terms with perfect sharing along with a C implementation of normalizing substitutions. We describe the ways in which Lash differs from Satallax and the performance improvement of Lash over Satallax when used with analogous flag settings. With a 10s timeout Lash outperforms Satallax on a collection TH0 problems from the TPTP. We conclude with ideas for continuing the development of Lash.

翻译：Lash是一个更高层次的自动理论证明器,是作为理论证明Satallax的叉子而创建的。Satallax的基本基本微积分是地板微积分,其规则只使用关于参与规则的术语和公式的浅薄信息。Lash使用新的、高效的C表示关键结构和操作。最重要的是,Lash使用C表示(正常)术语,同时实施C表示的替代标准。我们描述了Lash与Satallax不同的方式,以及在使用类似的旗帜设置时,Lash在Satallax上的性能改进。在TP的收集问题中,Lash超过Satallax,我们最后提出继续开发Lash的想法。