TSR Desk · mathematics · 3 October 2026, 01:00 UTC
G\"odel's and Scott's Variants of the Ontological Argument in Lean 4 and TPTP THF
- What
- G\"odel's and Scott's Variants of the Ontological Argument in Lean 4 and TPTP THF
- Who
- arxiv.org
- When
- 2 October 2026, 04:00 UTC
- Category
- Mathematics
- Primary source
- https://arxiv.org/abs/2609.26806
- What is not known
- This brief does not claim independent replication. Claims that appear only on X and not in the primary source stay unknown.
The Isabelle/HOL dataset of Benzm\"uller and Scott's study of G\"odel's ontological argument and Scott's variant (Monatshefte f\"ur Mathematik, 2025) is carried to Lean 4 and from there back to the automated provers, as a benchmark independent of either proof assistant. It comes from a paper posted to arXiv on 2 October 2026. The port covers all thirty theories, structure and names preserved: 548 statements compare identical as parsed, every named result is proved again, and five results the original reports without replaying them are proved here. For every theorem, #print axioms gives the postulates its proof consumes: Scott's necessary existence and modal collapse need only a symmetric frame, confirming that KB suffices. The benchmark, in TPTP THF and SMT-LIB, turns the steps of an argument debated in philosophy into 294 theorems, alongside 45 statements the original refutes or leaves open, ten left open there. Five THF provers, and cvc5 on SMT-LIB, prove 227 theorems within ten seconds on one core and 232 within sixty, and none proves any of the 45. E and Leo-II solve the most, although Leo-II's calculus has been unchanged for about a decade and was only repaired and modernised here, as release 2.2. Vampire, whose later version won the higher-order division of CASC-30, solves the most in no configuration. Only E and Leo-II are measured in their own automatic mode: Zipperposition proves 101 in a single mode and 213 with its developers' portfolio, Vampire 174 without options and 209 with a higher-order schedule that its CASC mode does not select, and Leo-III 159 alone and 177 with E as partner.
Why it counts
The Isabelle/HOL dataset of Benzm\"uller and Scott's study of G\"odel's ontological argument and Scott's variant (Monatshefte f\"ur Mathematik, 2025) is carried to Lean 4 and from there back to the automated provers, as a benchmark independent of either proof assistant. The benchmark, in TPTP THF and SMT-LIB, turns the steps of an argument debated in philosophy into 294 theorems, alongside 45 statements the original refutes or leaves open, ten left open there.
Sources
Primary source: primary source
What is not known
This brief does not claim independent replication. Claims that appear only on X and not in the primary source stay unknown.
No clip. The article still stands.