Mathematics in the TPTP Problem Library (v1.2.1)
Download:
|
|
by Geoff Sutcliffe, Christian B. Suttner
http://www.cs.jcu.edu.au/ftp/pub/techreports/96-15.ps.gz
Add To MetaCart
Abstract:
The TPTP (Thousands of Problems for Theorem Provers) is a library of problems for automated theorem proving (ATP) systems, for the clause normal form (CNF) of 1st order logic. A large portion of the TPTP is concerned with various mathematical domains. This paper documents the mathematical domains of TPTP v1.2.1, and provides some insight into the performance of state-of-the-art ATP systems on the problems in these domains. For those new to the field this information provides an established starting point for research. For those already involved, this paper tells what has been achieved so far. 1
Citations
| 69 | A Survey of Modern Algebra – Birkhoff, MacLane - 1953 |
| 60 | Heterogeneous algebras – Birkhoff, Lipson - 1970 |
| 30 | Challenge problems in elementary calculus – Bledsoe - 1990 |
| 30 | Semantically guided first-order theorem proving using hyper-linking – Chu, Plaisted - 1994 |
| 20 | The Unit Proof and the Input Proof in Theorem Proving – Chang - 1970 |
| 15 | Automated proofs of the Moufang identities in alternative rings – Anantharaman, Hsiang - 1990 |
| 13 | Algebra I -- Chapters 1-3 – Bourbaki - 1989 |
| 6 | Argonne National Laboratory Problem Library. Available by anonymous ftp from info.msc.anl.gov – ANL |
| 6 | Quasigroup Identities and Mendelsohn Designs – Bennett - 1989 |
| 4 | Recognising Unnecessary Clauses in Resolution Based Systems – Benanav - 1992 |
