Automated Theorem Proving using the TPTP Process Instruction Language

9 pages•Published: July 5, 2015

Abstract

The TPTP (Thousands of Problems for Theorem Provers) World is a well established infrastructure for Automated Theorem Proving (ATP). In the context of the TPTP World, the TPTP Process Instruction (TPI) language provides capabilities to input, output and organize logical formulae, and control the execution of ATP systems. This paper reviews the TPI language, describes a shell interpreter for the language, and demonstrates their use in theorem proving.

Keyphrases: automated theorem proving, automated theorem proving process, tptp, tptp process instruction language

In: Stephan Schulz, Leonardo De Moura and Boris Konev (editors). PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning, vol 31, pages 67-75.

Links:	https://easychair.org/publications/paper/8
	https://doi.org/10.29007/f997

BibTeX entry

@inproceedings{PAAR-2014:Automated_Theorem_Proving_using,
  author    = {Muhammad Nassar and Geoff Sutcliffe},
  title     = {Automated Theorem Proving using the TPTP Process Instruction Language},
  booktitle = {PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Stephan Schulz and Leonardo De Moura and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {31},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/8},
  doi       = {10.29007/f997},
  pages     = {67-75},
  year      = {2015}}

Download PDF Open PDF in browser