scholarly journals Automated Theorem Proving using the TPTP Process Instruction Language

10.29007/f997 ◽  
2018 ◽  
Author(s):  
Muhammad Nassar ◽  
Geoff Sutcliffe
Keyword(s):  
Theorem Proving ◽  
Automated Theorem Proving ◽  
Input Output ◽  
Theorem Provers ◽  
And Control

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.

STRATEGY PARALLELISM IN AUTOMATED THEOREM PROVING

1999 ◽  
Vol 13 (02) ◽  
pp. 219-245 ◽  
Author(s):  
ANDREAS WOLF ◽  
REINHOLD LETZ
Keyword(s):  
Theorem Proving ◽  
Experimental Evaluation ◽  
Automated Theorem Proving ◽  
Search Strategies ◽  
Theorem Prover ◽  
Strategy Selection ◽  
Theorem Provers ◽  
Initial Strategy ◽  
Basic Concepts ◽  
Run Time

Automated theorem provers use search strategies. Unfortunately, there is no unique strategy which is uniformly successful on all problems. This motivates us to apply different strategies in parallel, in a competitive manner. In this paper, we discuss properties, problems, and perspectives of strategy parallelism in theorem proving. We develop basic concepts like the complementarity and the overlap value of strategy sets. Some of the problems such as initial strategy selection and run-time strategy exchange are discussed in more detail. The paper also contains the description of an implementation of a strategy parallel theorem prover (p-SETHEO) and an experimental evaluation.

scholarly journals The Thousands of Models for Theorem Provers (TMTP) Model Library - First Steps

10.29007/7dg5 ◽  
2018 ◽  
Author(s):  
Geoff Sutcliffe ◽  
Stephan Schulz
Keyword(s):  
Theorem Proving ◽  
Automated Theorem Proving ◽  
Theorem Provers ◽  
Model Library ◽  
Problems And Solutions ◽  
Model Finding ◽  
Problem Library

The TPTP World is a well established infrastructure that supports research,development, and deployment of Automated Theorem Proving (ATP) systems forclassical logics.The TPTP world includes the TPTP problem library, the TSTP solution library,standards for writing ATP problems and reporting ATP solutions, and itprovides tools and services for processing ATP problems and solutions.This work describes a new component of the TPTP world - the Thousands ofModels for Theorem Provers (TMTP) Model Library.This is a library of models for identified axiomatizations built fromaxiom sets in the TPTP problem library, along with functions for efficientlyevaluating formulae wrt models, and tools for examining and processingthe models.The TMTP supports the development of semantically guided theorem provingATP systems, provide examples for developers of model finding ATP systems,and provides insights into the semantics of axiomatizations.

scholarly journals Proof simplification and automated theorem proving

2019 ◽  
Vol 377 (2140) ◽  
pp. 20180034 ◽  
Author(s):  
Michael Kinyon
Keyword(s):  
Theorem Proving ◽  
Simple Proof ◽  
Automated Theorem Proving ◽  
Theme Issue ◽  
Theorem Provers ◽  
Open Question

The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper, I describe a technique for simplifying automated proofs. Hopefully, this discussion will stimulate interest in the larger, still open, question of what reasonable measures of proof simplicity might be. This article is part of the theme issue ‘The notion of ‘simple proof’ - Hilbert's 24th problem’.

scholarly journals Rewriting and Well-Definedness within a Proof System

10.29007/b7wc ◽  
2018 ◽  
Author(s):  
Issam Maamria ◽  
Michael Butler
Keyword(s):  
Theorem Proving ◽  
Automated Theorem Proving ◽  
Term Rewriting ◽  
Proof System ◽  
Proof Technique ◽  
Partial Functions ◽  
Deductive Proof ◽  
Theorem Provers ◽  
Theoretical Foundations

Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with potentially ill-defined terms. In this paper, we provide a basis for integrating rewriting with a deductive proof system that deals with well-definedness. The definitions and theorems presented in this paper are the theoretical foundations for an extensible rewriting-based prover that has been implemented for the set theoretical formalism Event-B.

scholarly journals Bayesian Optimisation for Premise Selection in Automated Theorem Proving (Student Abstract)

2020 ◽  
Vol 34 (10) ◽  
pp. 13919-13920
Author(s):  
Agnieszka Słowik ◽  
Chaitanya Mangla ◽  
Mateja Jamnik ◽  
Sean B. Holden ◽  
Lawrence C. Paulson
Keyword(s):  
Parameter Space ◽  
Theorem Proving ◽  
Automated Theorem Proving ◽  
Search Space ◽  
Large Set ◽  
Probabilistic Framework ◽  
Formal Proofs ◽  
Dimensional Parameter ◽  
Theorem Provers

Modern theorem provers utilise a wide array of heuristics to control the search space explosion, thereby requiring optimisation of a large set of parameters. An exhaustive search in this multi-dimensional parameter space is intractable in most cases, yet the performance of the provers is highly dependent on the parameter assignment. In this work, we introduce a principled probabilistic framework for heuristic optimisation in theorem provers. We present results using a heuristic for premise selection and the Archive of Formal Proofs (AFP) as a case study.

scholarly journals Defining the meaning of TPTP formatted proofs

10.29007/xtc2 ◽  
2018 ◽  
Author(s):  
Roberto Blanco ◽  
Tomer Libal ◽  
Dale Miller
Keyword(s):  
Theorem Proving ◽  
Automated Theorem Proving ◽  
Inference Rules ◽  
First Order ◽  
Theorem Provers

The TPTP library is one of the leading problem libraries in the automated theorem proving community. Along the years, support was added for problems beyond those in first-order clausal form. Another addition was the augmentation of the language to support proofs outputted from theorem provers and the maintenance of a proof library, called TSTP. In this paper we propose another augmentation of the language for the support of the semantics of the inference rules used in these proofs.

The 10th IJCAR automated theorem proving system competition – CASC-J10

2021 ◽  
pp. 1-15
Author(s):  
Geoff Sutcliffe
Keyword(s):  
Theorem Proving ◽  
Classical Logic ◽  
Automated Theorem Proving ◽  
Fully Automatic

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J10 was the twenty-fifth competition in the CASC series. Twenty-four ATP systems and system variants competed in the various competition divisions. This paper presents an outline of the competition design, and a commentated summary of the results.

Retrieval System and Dynamic Algorithm Looking for Axioms of Notions Defined by Programs

1993 ◽  
Vol 19 (3-4) ◽  
pp. 275-301
Author(s):  
Andrzej Biela
Keyword(s):  
Theorem Proving ◽  
Dynamic Process ◽  
Functional Equations ◽  
Automated Theorem Proving ◽  
Retrieval System ◽  
Formal System ◽  
Dynamic Algorithm ◽  
Algorithmic Logic ◽  
Correctness Of Programs

In this paper we shall introduce a formal system of algorithmic logic which enables us to formulate some problems connected with a retrieval system which provides a comprehensive tool in automated theorem proving of theorems consisting of programs, procedures and functions. The procedures and functions may occur in considered theorems while the program of the above mentioned system is being executed. We can get an answer whether some relations defined by programs hold and we can prove functional equations in a dynamic way by looking for a special set of axioms /assumptions/ during the execution of system. We formulate RS-algorithm which enables us to construct the set of axioms for proving some properties of functions and relations defined by programs. By RS-algorithm we get the dynamic process of proving functional equations and we can answer the question whether some relations defined by programs hold. It enables us to solve some problems concerning the correctness of programs. This system can be used for giving an expert appraisement. We shall provide the major structures and a sketch of an implementation of the above formal system.

Sign in / Sign up

Export Citation Format

Share Document