{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/internlm2-5-stepprover-advancing-automated","title":"InternLM2.5-StepProver: Advancing Automated Theorem Proving via Expert Iteration on Large-Scale LEAN Problems","arxiv_id":"2410.15700","date":"2024-10-21","proceeding":null,"authors":["Zijian Wu","Suozhi Huang","Zhejian Zhou","Huaiyuan Ying","Jiayu Wang","Dahua Lin","Kai Chen"],"abstract":"Large Language Models (LLMs) have emerged as powerful tools in mathematical theorem proving, particularly when utilizing formal languages such as LEAN. The major learning paradigm is expert iteration, which necessitates a pre-defined dataset comprising numerous mathematical problems. In this process, LLMs attempt to prove problems within the dataset and iteratively refine their capabilities through self-training on the proofs they discover. We propose to use large scale LEAN problem datasets Lean-workbook for expert iteration with more than 20,000 CPU days. During expert iteration, we found log-linear trends between solved problem amount with proof length and CPU usage. We train a critic model to select relatively easy problems for policy models to make trials and guide the model to search for deeper proofs. InternLM2.5-StepProver achieves open-source state-of-the-art on MiniF2F, Lean-Workbook-Plus, ProofNet, and Putnam benchmarks. Specifically, it achieves a pass of 65.9% on the MiniF2F-test and proves (or disproves) 17.0% of problems in Lean-Workbook-Plus which shows a significant improvement compared to only 9.5% of problems proved when Lean-Workbook-Plus was released. We open-source our models and searched proofs at https://github.com/InternLM/InternLM-Math and https://huggingface.co/datasets/internlm/Lean-Workbook.","url_abs":"https://arxiv.org/abs/2410.15700v1","url_pdf":"https://arxiv.org/pdf/2410.15700v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"internlm2-5-stepprover-advancing-automated","repo_url":"https://github.com/internlm/internlm-math","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"automated-theorem-proving","task_name":"Automated Theorem Proving"},{"task_slug":null,"task_name":"CPU"},{"task_slug":"math","task_name":"Math"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2410.15700","atlas_url":"https://app.syntology.ai/?focus=2410.15700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15700"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2410.15700"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2410.15700"},"call":"get_harvested_code_for_paper(arxiv_id=\"2410.15700\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2410.15700"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2410.15700\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2410.15700"},"call":"get_concepts_for_paper(arxiv_id=\"2410.15700\")"}],"by_repo":[{"repo":"internlm/internlm-math","kind":"official","samples":8,"ran":8,"instrument":6,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2410.15700.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2410.15700.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/internlm/internlm-math","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"ran_draft_wrong":6,"ran":2},"n_samples":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":8,"ran":8,"n_ran_checked":2,"n_instrument":6,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":1,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":8,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"18f7e366cfc06dcf","code_sha256_prefix":"18f7e366cfc06dcf","entry":"chat_template_to_prompt","repo":"internlm/internlm-math","repo_kind":"official","path":"minif2f/proofsearch_internLM2-StepProver.py","file_url":"https://github.com/internlm/internlm-math/blob/HEAD/minif2f/proofsearch_internLM2-StepProver.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"prompt_list:list/1/dict","fixture_out_type":"str","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"18f7e366cfc06dcf"}},{"code_sha256":"6cd811d1cce3b5e7","code_sha256_prefix":"6cd811d1cce3b5e7","entry":"extract_answer","repo":"internlm/internlm-math","repo_kind":"official","path":"agent/math_agent.py","file_url":"https://github.com/internlm/internlm-math/blob/HEAD/agent/math_agent.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"pred_str:str/0/str, execute:bool/0/bool","fixture_out_type":"str","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","retrieve_with":{"tool":"get_code","code_sha256":"6cd811d1cce3b5e7"},"code_page":"/code/extract-answer","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6cd811d1cce3b5e7"}},{"code_sha256":"90b5c896e5eaea5e","code_sha256_prefix":"90b5c896e5eaea5e","entry":"last_boxed_only_string","repo":"internlm/internlm-math","repo_kind":"official","path":"agent/math_agent.py","file_url":"https://github.com/internlm/internlm-math/blob/HEAD/agent/math_agent.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"string:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"90b5c896e5eaea5e"},"code_page":"/code/last-boxed-only-string","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from trotsky1997/mathblackbox, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"90b5c896e5eaea5e"}},{"code_sha256":"456a2964e717bec5","code_sha256_prefix":"456a2964e717bec5","entry":"prompt_style_internlm_chat_0522_extractor","repo":"internlm/internlm-math","repo_kind":"official","path":"minif2f/proofsearch_internLM2-plus.py","file_url":"https://github.com/internlm/internlm-math/blob/HEAD/minif2f/proofsearch_internLM2-plus.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"result:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-26T01:55:17.694675+00:00","retrieve_with":{"tool":"get_code","code_sha256":"456a2964e717bec5"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"456a2964e717bec5"}},{"code_sha256":"8714ac414e59c631","code_sha256_prefix":"8714ac414e59c631","entry":"prompt_style_internlm_chat_stepprover_extractor","repo":"internlm/internlm-math","repo_kind":"official","path":"minif2f/proofsearch_internLM2-StepProver.py","file_url":"https://github.com/internlm/internlm-math/blob/HEAD/minif2f/proofsearch_internLM2-StepProver.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"result:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","retrieve_with":{"tool":"get_code","code_sha256":"8714ac414e59c631"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8714ac414e59c631"}},{"code_sha256":"0bb1f90bd9143446","code_sha256_prefix":"0bb1f90bd9143446","entry":"prompt_style_internlm_chat_stepprover_extractor","repo":"internlm/internlm-math","repo_kind":"official","path":"minif2f/proofsearch_internLM2.5-StepProver.py","file_url":"https://github.com/internlm/internlm-math/blob/HEAD/minif2f/proofsearch_internLM2.5-StepProver.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"result:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-26T01:55:17.694675+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0bb1f90bd9143446"}},{"code_sha256":"f227a3efda0fb0e6","code_sha256_prefix":"f227a3efda0fb0e6","entry":"resume_from","repo":"internlm/internlm-math","repo_kind":"official","path":"minif2f/proofsearch_internLM2.py","file_url":"https://github.com/internlm/internlm-math/blob/HEAD/minif2f/proofsearch_internLM2.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"results_filename:str/0/str, data:list/1/dict","fixture_out_type":"tuple","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f227a3efda0fb0e6"}},{"code_sha256":"d80926644fbab50a","code_sha256_prefix":"d80926644fbab50a","entry":"strip_string","repo":"internlm/internlm-math","repo_kind":"official","path":"agent/math_agent.py","file_url":"https://github.com/internlm/internlm-math/blob/HEAD/agent/math_agent.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"string:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","retrieve_with":{"tool":"get_code","code_sha256":"d80926644fbab50a"},"code_page":"/code/strip-string","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d80926644fbab50a"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"53bc7f65fd0bf826adec452b1fe778d7442013072c7f6f0295dc58bee601c699","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}