FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover

FEMaLeCoP is a connection tableau theorem prover based on leanCoP which uses efficient implementation of internal learning-based guidance for extension steps. Despite the fact that exhaustive use of such internal guidance can incur a significant slowdown of the raw inferencing process, FEMaLeCoP trained on related proofs can prove many problems that cannot be solved by leanCoP. In particular on the MPTP2078 benchmark, FEMaLeCoP adds 90 15.7i¾?% more problems to the 574 problems that are provable by leanCoP. FEMaLeCoP is thus the first AI/ATP system convincingly demonstrating that guiding the internal inference algorithms of theorem provers by knowledge learned from previous proofs can significantly improve the performance of the provers. This paper describes the system, discusses the technology developed, and evaluates the system.

[1]  Cezary Kaliszyk,et al.  MaSh: Machine Learning for Sledgehammer , 2013, ITP.

[2]  Stephan Schulz,et al.  Learning search control knowledge for equational deduction , 2000, DISKI.

[3]  Cezary Kaliszyk,et al.  Stronger Automation for Flyspeck by Feature Weighting and Strategy Evolution , 2013, PxTP@CADE.

[4]  Cezary Kaliszyk,et al.  Hammering towards QED , 2016, J. Formaliz. Reason..

[5]  Josef Urban,et al.  MaLeCoP Machine Learning Connection Prover , 2011, TABLEAUX.

[6]  Cezary Kaliszyk,et al.  Certified Connection Tableaux Proofs for HOL Light and TPTP , 2014, CPP.

[7]  Jens Otten Restricting backtracking in connection calculi , 2010, AI Commun..

[8]  Jesse Alama,et al.  Premise Selection for Mathematics by Corpus Analysis and Kernel Methods , 2011, Journal of Automated Reasoning.

[9]  Cezary Kaliszyk,et al.  MizAR 40 for Mizar 40 , 2013, Journal of Automated Reasoning.

[10]  Karen Spärck Jones A statistical interpretation of term specificity and its application in retrieval , 2021, J. Documentation.

[11]  Wolfgang Bibel,et al.  leanCoP: lean connection-based theorem proving , 2003, J. Symb. Comput..

[12]  Josef Urban,et al.  Evaluation of Automated Theorem Proving on the Mizar Mathematical Library , 2010, ICMS.

[13]  Cezary Kaliszyk,et al.  Efficient Semantic Features for Automated Reasoning over Large Theories , 2015, IJCAI.

[14]  Thibault Gauthier,et al.  Matching Concepts across HOL Libraries , 2014, CICM.

[15]  Ortrun Ibens,et al.  Subgoal Alternation in Model Elimination , 1997, TABLEAUX.