Abstract
AbstractThe TPTP World is a well established infrastructure that supports research, development, and deployment of Automated Theorem Proving (ATP) systems. There are key components that help make the TPTP World a success: the TPTP problem library was first released in 1993, the CADE ATP System Competition (CASC) was conceived after CADE-12 in 1994, problem difficulty ratings were added in 1997, the current TPTP language was adopted in 2003, the SZS ontologies were specified in 2004, the TSTP solution library was built starting around 2005, the Specialist Problem Classes (SPCs) have been used to classify problems since 2010, the SystemOnTPTP service has been offered from 2011, the StarExec service was started in 2013, and a world of TPTP users have helped all along. This paper reviews these stepping stones in the development of the TPTP World.
Publisher
Springer Nature Switzerland
Reference56 articles.
1. Lecture Notes in Computer Science;E Bartocci,2019
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);JC Blanchette,2013
3. Blanchette, J., Urban, J. (eds.): Proceedings of the 3rd International International Workshop on Proof Exchange for Theorem Proving. No. 14 in EPiC Series in Computing, EasyChair Publications (2013)
4. Boyer, R., Lusk, E., McCune, W., Overbeek, R., Stickel, M., Wos, L.: Set theory in first-order logic: clauses for Godel’s axioms. J. Autom. Reason. 2(3), 287–327 (1986)
5. Cok, D., Stump, A., Weber, T.: The 2013 evaluation of SMT-COMP and SMT-LIB. J. Autom. Reason. 55(1), 61–90 (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Formalizing Finite Ramsey Theory in Lean 4;Lecture Notes in Computer Science;2024