Extending E Prover with Fully Use Binary Clauses Algorithm Based on Standard Contradiction Separation Rule

After nearly two decades of development, E prover has made great progress and is a state-of-the-art automated theorem prover for first-order logic in the world. E has routinely come in as one of the top three provers in all CASC competitions since 1999. However, up to now, E still cannot resolve or effectively resolve many problems of the latest benchmarks database TPTP. And the inference rule of E essentially is binary resolution method which lacks the synergetic processing ability for multi-clause. Standard contradiction separation (S-CS) inference rule is a recently proposed theoretical method to overcome the limitation of binary resolution inference rule. Based on this theory, this paper proposes a novel S-CS dynamic deduction algorithm that fully uses binary clauses (in short FUBC). While maintaining the advantages of E, we implement FUBC algorithm on E, forming an extending E prover, denoted as E_FUBC. Then we use the latest benchmarks database TPTP (such as problems of FOF division from CASC-J10 and CASC-27) to evaluate E_FUBC. Experimental results show E-FUBC outperforms E itself and FUBC algorithm effectively improves E prover’s ability.