Papers › Lyra: Orchestrating Dual Correction in Automated Theorem Proving

Lyra: Orchestrating Dual Correction in Automated Theorem Proving

27 Sep 2023arXiv:2309.15806archive 2025-07-28

Chuanyang Zheng, Haiming Wang, Enze Xie, Zhengying Liu, Jiankai Sun, Huajian Xin, Jianhao Shen, Zhenguo Li, Yu Li

Large Language Models (LLMs) present an intriguing avenue for exploration in the field of formal theorem proving. Nevertheless, their full potential, particularly concerning the mitigation of hallucinations and refinement through prover error messages, remains an area that has yet to be thoroughly investigated. To enhance the effectiveness of LLMs in the field, we introduce the Lyra, a new framework that employs two distinct correction mechanisms: Tool Correction (TC) and Conjecture Correction (CC). To implement Tool Correction in the post-processing of formal proofs, we leverage prior knowledge to utilize predefined prover tools (e.g., Sledgehammer) for guiding the replacement of incorrect tools. Tool Correction significantly contributes to mitigating hallucinations, thereby improving the overall accuracy of the proof. In addition, we introduce Conjecture Correction, an error feedback mechanism designed to interact with prover to refine formal proof conjectures with prover error messages. Compared to the previous refinement framework, the proposed Conjecture Correction refines generation with instruction but does not collect paired (generation, error & refinement) prompts. Our method has achieved state-of-the-art (SOTA) performance on both miniF2F validation (48.0% -> 55.3%) and test (45.5% -> 51.2%). We also present 3 IMO problems solved by Lyra. We believe Tool Correction (post-process for hallucination mitigation) and Conjecture Correction (subgoal adjustment from interaction with environment) could provide a promising avenue for future research in this field.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2309.15806")

Code

Syntology Ran 7 of 8 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 7 ran with no contract checked.

By repository: official repository: 8 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

chuanyang-zheng/lyra-theorem-prover officialmentioned in paperApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 7 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7ran
1unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from chuanyang-zheng/lyra-theorem-prover. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

MATH_example_template chuanyang-zheng/lyra-theorem-prover/src/autoformalization/prompts.py official repository ran Apache-2.0 (permissive) · 15fd5c7c3c95ffe6 · report
apply_subst chuanyang-zheng/lyra-theorem-prover/formal_system_servers/mm_server_backend.py official repository ran Apache-2.0 (permissive) · bd6230cf4c7dd610 · report
get_finish chuanyang-zheng/lyra-theorem-prover/src/autoformalization/utils.py official repository ran Apache-2.0 (permissive) · 3a7d6557aa829cee · report
get_problem_names chuanyang-zheng/lyra-theorem-prover/src/autoformalization/utils.py official repository ran Apache-2.0 (permissive) · e10458c4731d6819 · report
parse_tactic chuanyang-zheng/lyra-theorem-prover/formal_system_servers/mm_server_backend.py official repository ran Apache-2.0 (permissive) · d1ea6db0edebefb1 · report
prepare_generated_proof chuanyang-zheng/lyra-theorem-prover/run_interact.py official repository ran Apache-2.0 (permissive) · 0c6d2acafc44ef56 · report
recursive_extract chuanyang-zheng/lyra-theorem-prover/src/autoformalization/utils.py official repository ran Apache-2.0 (permissive) · 39367ca7096740ac · report
parse_tactic_state chuanyang-zheng/lyra-theorem-prover/formal_system_servers/mm_server_backend.py official repository unverified Apache-2.0 (permissive) · 6ef513fef14838a6 · report

Tasks

Automated Theorem ProvingHallucination

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Automated Theorem Proving miniF2F-test Lyra + GPT-4 ITP Isabelle #6 of 29 Archive leaderboard report
Automated Theorem Proving miniF2F-test Lyra + GPT-4 Pass@100 47.1 #6 of 29 Archive leaderboard report
Automated Theorem Proving miniF2F-test Lyra + GPT-4 cumulative 47.1 #6 of 29 Archive leaderboard report
Automated Theorem Proving miniF2F-valid Lyra + GPT-4 Pass@100 52.0 #9 of 10 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections