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: A comprehensive library of the ATP test problems that are available today, in order to provide an overview and a simple, unambiguous reference mechanism. A comprehensive list of references and other interesting information for each problem. Arbitrary size instances of generic problems (e.g., the N-queens problem). A utility to convert the problems to existing ATP systems’ formats. General guidelines outlining the requirements for ATP system evaluation. Standards for input and output for ATP systems. 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.

References in zbMATH (referenced in 376 articles , 3 standard articles )

Showing results 1 to 20 of 376.
Sorted by year (citations)

1 2 3 ... 17 18 19 next

  1. Baumgartner, Peter; Schmidt, Renate A.: Blocking and other enhancements for bottom-up model generation methods (2020)
  2. Benzmüller, Christoph; Scott, Dana S.: Automating free logic in HOL, with an experimental application in category theory (2020)
  3. Burel, Guillaume; Bury, Guillaume; Cauderlier, Raphaël; Delahaye, David; Halmagrand, Pierre; Hermant, Olivier: First-order automated reasoning with theories: when deduction modulo theory meets practice (2020)
  4. Cialdea Mayer, Marta: A prover dealing with nominals, binders, transitivity and relation hierarchies (2020)
  5. Cristiá, Maximiliano; Rossi, Gianfranco: Solving quantifier-free first-order constraints over finite sets and binary relations (2020)
  6. Fandinno, Jorge; Lifschitz, Vladimir; Lühne, Patrick; Schaub, Torsten: Verifying tight logic programs with \textscanthemand \textscvampire (2020)
  7. Jakubův, Jan; Kaliszyk, Cezary: Relaxed weighted path order in theorem proving (2020)
  8. Teucke, Andreas; Weidenbach, Christoph: SPASS-AR: a first-order theorem prover based on approximation-refinement into the monadic shallow linear fragment (2020)
  9. Barbosa, Haniel; Reynolds, Andrew; El Ouraoui, Daniel; Tinelli, Cesare; Barrett, Clark: Extending SMT solvers to higher-order logic (2019)
  10. Bentkamp, Alexander; Blanchette, Jasmin; Tourret, Sophie; Vukmirović, Petar; Waldmann, Uwe: Superposition with lambdas (2019)
  11. Bhayat, Ahmed; Reger, Giles: Restricted combinatory unification (2019)
  12. Brown, Chad E.; Gauthier, Thibault; Kaliszyk, Cezary; Sutcliffe, Geoff; Urban, Josef: GRUNGE: a grand unified ATP challenge (2019)
  13. Ebner, Gabriel: Herbrand constructivization for automated intuitionistic theorem proving (2019)
  14. Ebner, Gabriel; Hetzl, Stefan; Leitsch, Alexander; Reis, Giselle; Weller, Daniel: On the generation of quantified lemmas (2019)
  15. Furbach, Ulrich; Krämer, Teresa; Schon, Claudia: Names are not just sound and smoke: word embeddings for axiom selection (2019)
  16. Li, Di Long; Tiu, Alwen: Combining proverif and automated theorem provers for security protocol verification (2019)
  17. Lifschitz, Vladimir; Lühne, Patrick; Schaub, Torsten: Verifying strong equivalence of programs in the input language of \textscgringo (2019)
  18. Mohamed Yacine El Haddad, Guillaume Burel, Frédéric Blanqui: EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract) (2019) arXiv
  19. Rawson, Michael; Reger, Giles: Old or heavy? Decaying gracefully with age/weight shapes (2019)
  20. Reger, Giles; Riener, Martin; Suda, Martin: Symmetry avoidance in MACE-style finite model finding (2019)

1 2 3 ... 17 18 19 next