The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
First-Order Theorem Proving and Vampire
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
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
A Temporal Logic of Nested Calls and Returns
Alur, R., Etessami, K., & Madhusudan, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_35 · Cited by 3,339
Simple Word Problems in Universal Algebras
Knuth, D. E., & BENDIX, P. B. (1983) · Springer eBooks · doi:10.1007/978-3-642-81955-1_23 · Cited by 1,368
Disjunctive Tautologies as Synchronisation Schemes
Vincent Danos, A., & Krivine, J.-L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44622-2_19 · Cited by 1,112
Interpolation and SAT-Based Model Checking
McMillan, K. L. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45069-6_1 · Cited by 908
An Efficient Unification Algorithm
Martelli, A., & Montanari, U. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357169 · Cited by 776
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
Craig, W. (1957) · Journal of Symbolic Logic · doi:10.2307/2963594 · Cited by 667
Knuth, D. E., & BENDIX, P. B. (1970) · Elsevier eBooks · doi:10.1016/b978-0-08-012975-4.50028-x · Cited by 480
Bachmair, L., Ganzinger, H., McAllester, D., & Lynch, C. (2001) · Elsevier eBooks · doi:10.1016/b978-044450813-3/50004-7 · Cited by 472
The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, v3.5.0
Sutcliffe, G. (2009) · Journal of Automated Reasoning · doi:10.1007/s10817-009-9143-8 · Cited by 437
Cited by
INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving
Wu, Y., Jiang, A. Q., Ba, J., & Grosse, R. (2020) · arXiv · doi:10.48550/arxiv.2007.02924 · Cited by 30
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
Training a First-Order Theorem Prover from Synthetic Data
Firoiu, V., Aygun, E., Anand, A., Ahmed, Z., Glorot, X., Orseau, L., Zhang, L., Precup, D., & Mourad, S. (2021) · arXiv · doi:10.48550/arxiv.2103.03798 · Cited by 15
Solving Quantitative Reasoning Problems with Language Models
Lewkowycz, A., Andreassen, A., Dohan, D., Dyer, E., Michalewski, H., Ramasesh, V., Slone, A., Anil, C., Schlag, I., Gutman-Solo, T., et al. (2022) · arXiv · doi:10.48550/arxiv.2206.14858 · Cited by 358
Metadata
- Authors
- Kovács, L., & Voronkov, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 1-35
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1781094
- Cited by
- 485
- References
- 16
- FWCI
- 16.48
- Type
- conference paper
- 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: First-Order Theorem Proving and Vampire. https://app.cochat.ai/papers/10.1007/978-3-642-39799-8_1
- The paper
- Kovács, L., & Voronkov, A. (2013). First-Order Theorem Proving and Vampire. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-39799-8_1
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.
