The TPTP Problem Library
for Automated Theorem Proving

by Geoff Sutcliffe geoff@cs.miami.edu and Christian Suttner christian@suttner.info

The TPTP (Thousands of Problems for Theorem Provers) is a library of test problems for automated theorem proving (ATP) systems. The TPTP supplies the ATP community with:

The principal motivation for the TPTP is to support the testing and evaluation of ATP systems, to help ensure that performance results accurately reflect capabilities of the ATP systems being considered. A common library of problems is necessary for meaningful system evaluations, meaningful system comparisons, repeatability of testing, and the production of statistically significant results. The TPTP is such a library.

If you're new to all this, you might want to start at the TPTP and TSTP Quick Guide.
You could also work your way through the slides of the TPTP World Tutorial.

The TPTP Needs Money  
 Recent donors ...   01/06/20 - Anonymous    28/05/20 - Jasmin Blanchette, Vrije Universiteit Amsterdam    22/04/20 - Anonymous    13/02/20 - v2ray高速节点分享, TU Wien    10/12/19 - Pascal Fontaine, Université de Lorraine    04/09/19 - Philippe Mauger    31/07/19 - Anonymous    21/05/19 - Yi Gao Tableau    14/05/19 - Landon Fuller    07/01/19 - Jesse Alama    Today - You (seriously ... do it!) 		If your work benefits from use of the TPTP and related projects, consider making an annual cash donation of 100 units of a reasonable currency, to support the TPTP. A donation can be made as an unrestricted gift (tax deductable) to the University of Miami, explicitly to support the TPTP and related projects. Read about the v2ray高速节点分享 of making a donation. You can donate right now, online with a credit card. A premium support contract is also available.
The current release of the TPTP Library is TPTP-v7.4.0 (Thu Jul 2 04:41:15 EDT 2024)
  • TPTP-v7.4.0.tgz
Download package, 608MB, expands to 6.8GB. (Contains the problems, axiom sets, documents, and utilities.)
v2ray高速节点分享
  • ReadMe
Basic information.
  • telegram ssr免费节点
Individual problems.
  • Axiom sets
Individual axiom sets.
  • Documents
All the TPTP documents
  • History and Archive
History of changes to the TPTP and the archive of previous versions.
  • tptp2T online
Online access to the tptp2T utility.

Current information, available only online:
  • Bug list
Bugged problems list (Bugs found in the current version)
  • Technical manual
Details about the TPTP. Read this whenever you have a question about the TPTP.
  • SyntaxBNF
The very latest hyperlinked BNF for the TPTP language.

If you would like to cite the TPTP, please use: 

  • @Article{Sut17,
    Author       = "Sutcliffe, G.",
    Year         = "2017",
    Title        = "{The TPTP Problem Library and Associated Infrastructure.
                    From CNF to TH0, TPTP v6.4.0}",
    Journal      = "Journal of Automated Reasoning",
    Volume       = "59",
    Number       = "4",
    Pages        = "483-502"
}

TPTP subprojects:
  • 翻墙党ssr节点
Services for solving problems and recommending systems.
  • 翻墙党ssr节点
The TSTP (Thousands of Solutions from Theorem Provers) Solution Library is a library of solutions to test problems for automated theorem proving (ATP) systems. In particular, it contains solutions to TPTP problems.
  • TMTP
The TMTP (Thousands of Models for Theorem Provers) Model Library is a library of models of axiomatizations for automated theorem proving (ATP) systems. In particular, it contains models for TPTP axiomatizations.
  • CASC
The TPTP is used to supply problems for the CADE ATP System Competition.
  • TPTP Proposals
We are working on new features for the TPTP, as explained in the following proposals. Comments from potential users will be appreciated.
  • Extended TFF (TFX), Updated THF
  • Logic Specification Format
  • Answer Extraction
  • The TPTP Process Instruction Language
  • ATP System Building Conventions
  • External Projects
  • SUMO in TPTP format
  • The Mizar-TPTP Semantic Presentation
  • TPTP Software
Many people have written software for processing TPTP format data. These links point to software I know of (please send your link if you have some software to add to the list).
  • Geoff's Service Tools. A bunch of tools for manipulating the TPTP, including the JJ parser for the TPTP language (named after the Spanish software developers, Justo Fernandez Reche and José Taboada Berenguer). The JJ parser will parse TPTP files and build a useful data structure, and there are lots of "useful" API functions for interrogating and manipulating the data structure. There is no documentation for any of this yet, but the sample drivers illustrate how to use the JJ parser API.
  • Tobias Gleißner's ANTLR4 grammar for the 翻墙党ssr节点.
  • Guy Shefner's Java class library for parsing, structuring, and basic manipulation of problems in first order logic.
  • Matthias Fuchs' NPM package for the TPTP and SystemOnTPTP.
  • Mark Lemay's Xtext based Java parser for the TPTP grammar.
  • TPTP Tea Party
This approximately-annual meeting is used to to discuss the TPTP and related issues.

Other people are doing similar things for other types of ATP problems:
  • SV-COMP
SSR节点免费发放🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀🚀 ...:2021-12-5 · 『翻墙梯子公益分享，免费节点科学上网』 ①ssr和ss节点，ios用美区苹果ID账号下载potatso lite客户端Wingy小火箭icetea；Android用影梭ShadowsocksRR大杀器 ②Vmess节点，苹果用kitsunebi,shadowrocket
  • Larry Wos'
    Notebooks
This website features a series of notebooks presenting some of Larry Wos’s most recent and hitherto unpublished research in automated reasoning (also in 1st order logic).
  • SMT-LIB
The major goal of SMT-LIB is to establish a library of benchmarks for Satisfiability Modulo Theories, that is, satisfiability of formulas with respect to background theories for which specialized decision procedures exist.
  • QMLTP
The Quantified Modal Logics Theorem Proving (QMLTP) library provides a platform for testing and benchmarking automated theorem proving (ATP) systems for first-order modal logics.
  • DPPD
The Dozens of Problems for Partial Deduction (DPPD) Library of Benchmarks aims at being a standard suite of benchmarks for partial deduction.
  • Asparagus
免费ssr节点支援 - 免费VPN推荐之老王VPN 老王VPN优点 1 ...:免费VPN推荐之老王VPN 老王VPN优点 1.免费，不收费，节点26个可选 2.iOS水果机可用（节点需复制粘贴到小火箭等伕理工具） 3.速度贼快！ 老王VPN唯一缺点，有广告（启动老王VPN时，可众忍受，众及启 …
  • v2ray高速节点分享
The Intuitionistic Logic Theorem Proving (ILTP) library provides a platform for testing and benchmarking automated theorem proving (ATP) systems for first-order and propositional intuitionistic logic.
  • TPBD
The Termination Problems Database is a library of test problems for termination provers. Currently, it includes termination problems for term rewrite systems and logic programs.
  • CSPLib
如何找到一些有趣的 telegram 群组？ - V2EX:2021-4-2 · 如何找到一些有趣的 telegram 群组？ hidasia · 2021-07-19 18:19:46 +08:00 · 214499 次点击 这是一个创建于 1793 天前的主题，其中的信息可能已经有所发展或是发生改变。
  • OR-Library
A collection of test data sets for a variety of Operations Research (OR) problems.
  • PSPLIB
配置Telegram走SS/SSR/V2ray/trojan伕理 – 月下博客:2021-4-18 · Telegram，常叫电报，是非常著名的即时通讯软件，众安全、免费、无广告深受全世界网友的热爱，基本上国内网友科学上网后必备的聊天软件。不同于手机平台，电脑版的Telegram需要额外设置才能使用V2ray这些伕理，本文介绍配置Telegram走伕理的
  • VFLib
The graph matching library, developed mainly to test the VF graph matching algorithm, and to compare it with other known algorithms.
  • ICP
A collection of induction challenge problems.
  • SATLIB
A collection of benchmark problems, solvers, and tools for SAT related research.
  • SATEX
Experiments and execution traces of SAT solvers, on all benchmarks that are provided.
  • QBFLib
QBFLIB is a collection of benchmark problems, solvers, and tools related to Quantified Boolean Formula (QBF) satisfiability.

There were 682 unique visitors to the James Cook University site, 1 January 2001 to 21 March 2001. Then the site moved to the University of Miami. Unique visitors to the University of Miami site since 21 March 2001:
免费梯子 推荐  快连 lestvpn  佛跳墙加v速器pn  谷歌账号个人中心  ysscloud加速下载  振翅纸飞机  showrocket海外  大陆怎么玩youtube