AI RESEARCH
Mechanic: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving
arXiv CS.CL
•
ArXi:2603.24465v1 Announce Type: new Recent advances in large language models (LLMs) and LLM-based agents have substantially improved the capabilities of automated theorem proving. However, for problems requiring complex mathematical reasoning, current systems rarely succeed on the first try and must repeatedly modify their proof strategies. Existing approaches for handling failed attempts typically either discard the entire proof and regenerate it from scratch or iteratively fix errors within the proof.