The ILTP library: benchmarking automated theorem provers for intuitionistic logic

Authors:
Thomas Raths;Jens Otten;Christoph Kreitz
Affiliations:
Institut für Informatik, University of Potsdam, Potsdam-Babelsberg, Germany;Institut für Informatik, University of Potsdam, Potsdam-Babelsberg, Germany;Institut für Informatik, University of Potsdam, Potsdam-Babelsberg, Germany
Venue:
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
2005

Citing 9
Cited 3

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
The TPTP Problem Library

Journal of Automated Reasoning
ileanTAP: An Intuitionistic Theorem Prover

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Logics Workbench 1.0

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Resolution Theorem Prover for Intuitonistic Logic

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
STRIP: Structural Sharing for Efficient Proof-Search

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Clausal connection-based theorem proving in intuitionistic first-order logic

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

A Labelled System for IPL with Variable Splitting

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Clausal connection-based theorem proving in intuitionistic first-order logic

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Strong cut-elimination systems for hudelmaier's depth-bounded sequent calculus for implicational logic

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Intuitionistic Logic Theorem Proving (ILTP) Library provides a platfom for testing and benchmarking theorem provers for first-order intuitionistic logic. It includes a collection of benchmark problems in a standardised syntax and performance results obtained by a comprehensive test of currently available intuitionistic theorem proving systems. These results are used to provide information about the status and the difficulty rating of the benchmark problems.