Answers are grounded in this paper and cite their sources.
Case study demonstrates LLM-generated proof of irrationality in logic programming context, suggesting innovative proof methods.
We present the interactions with an LLM (Large Language Model) aiming at proving that √ 2 is not a rational number in an LP (Logic Programming) context.We start from a few basic pure logic programming predicate definitions.We rely on the LPTP (Logic Program Theorem Prover) system written by Robert Stärk for stating and proving properties about logic programs.As the proof language of LPTP is based on natural deduction, the proofs are human readable.In our case study, we sketch in LPTP the usual proof showing the irrationality of √ 2. Then we describe the interactions we had with the LLM.We end up with a complete formal proof, partially generated by an LLM and fully proof-checked by LPTP.
No takes yet. Share an insight, caveat, or question.
Mesnard et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: