The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, v3.5.0
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Constructing Induction Rules for Deductive Synthesis Proofs
Bundy, A., Dixon, L., Gow, J., & Fleuriot, J. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.08.003 · Cited by 2,806
Yago: a core of semantic knowledge
Suchanek, F. M., Kasneci, G., & Weikum, G. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242667 · Cited by 2,512
(2010) · Cited by 698
System Description: Twelf — A Meta-Logical Framework for Deductive Systems
Pfenning, F., & Schürmann, C. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48660-7_14 · Cited by 595
Schulz, S. (2002) · Cited by 407
An Introduction to the Syntax and Content of Cyc i
Matuszek, C., Witbrock, M., Cabral, J., & DeOliveira, J. (2006) · doi:10.13016/m2j09w76t · Cited by 335
SATLIB: An Online Resource for Research on SAT
Hoos, H. H., Stützle, T., Gent, I. P., et al. (2000) · Cited by 306
OMDoc – An Open Markup Format for Mathematical Documents [version 1.2]
Kohlhase, M. (2006) · Lecture notes in computer science · doi:10.1007/11826095 · Cited by 238
Cited by
(2010) · Cited by 698
First-Order Theorem Proving and Vampire
Kovács, L., & Voronkov, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39799-8_1 · Cited by 485
Riegel, R., Gray, A., Luus, F., Khan, N., Makondo, N., Akhalwaya, I. Y., Qian, H., Fagin, R., Barahona, F., Sharma, U., et al. (2020) · arXiv · doi:10.48550/arxiv.2006.13155 · Cited by 95
Zombori, Z., Csiszárik, A., Michalewski, H., Kaliszyk, C., & Urban, J. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-86059-2_10 · Cited by 22
Metadata
- Authors
- Sutcliffe, G.
- Venue
- Journal of Automated Reasoning
- Published
- 2009-07-22
- Volume
- 43
- Issue
- 4
- Pages
- 337-362
- ISSN
- 0168-7433 (ISSN-L)
- 1573-0670
- OpenAlex
- W1573992413
- Cited by
- 437
- References
- 24
- FWCI
- 34.34
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, v3.5.0. https://app.cochat.ai/papers/10.1007/s10817-009-9143-8
- The paper
- Sutcliffe, G. (2009). The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, v3.5.0. Journal of Automated Reasoning. https://doi.org/10.1007/s10817-009-9143-8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
