{"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":"/dataset/minif2f","name":"MiniF2F","full_name":null,"description_markdown":"**MiniF2F** is a dataset of formal Olympiad-level mathematics problems statements intended to provide a unified cross-system benchmark for neural theorem proving. The miniF2F benchmark currently targets Metamath, Lean, and Isabelle and consists of 488 problem statements drawn from the AIME, AMC, and the International Mathematical Olympiad (IMO), as well as material from high-school and undergraduate mathematics courses.","description_withheld":null,"homepage":"https://github.com/openai/miniF2F","introduced_date":"2021-08-31","introduced_date_note":null,"introduced_by":{"paper":"/paper/minif2f-a-cross-system-benchmark-for-formal","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","first_author":"Kunhao Zheng","url":null},"license":null,"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Automated Theorem Proving","url":"/task/automated-theorem-proving","datasets_with_task":"/datasets/task/automated-theorem-proving"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["MiniF2F","miniF2F-valid","miniF2F-test"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/Tonic/MiniF2F","frameworks":["tf","pytorch","jax"]}],"num_papers_in_archive":84,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/automated-theorem-proving-on-minif2f-test","task":"Automated Theorem Proving","dataset_variant":"miniF2F-test","rows":29,"metrics":["cumulative","Pass@1","Pass@32","Pass@64","Pass@100","ITP","pass@1024","pass@8192"],"first_row_in_archive_order":{"model":"Kimina-Prover-Preview","paper":"/paper/kimina-prover-preview-towards-large-formal","metrics":{"ITP":"Lean","Pass@1":"52.94","Pass@32":"68.85","cumulative":"80.74","pass@1024":"77.87","pass@8192":"80.74"},"code_links":[{"title":"moonshotai/kimina-prover-preview","url":"https://github.com/moonshotai/kimina-prover-preview"},{"title":"cmu-l3/llmlean","url":"https://github.com/cmu-l3/llmlean"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/automated-theorem-proving-on-minif2f-valid","task":"Automated Theorem Proving","dataset_variant":"miniF2F-valid","rows":10,"metrics":["Pass@8","Pass@64","Pass@1","Pass@100"],"first_row_in_archive_order":{"model":"Lean GPT-f","paper":"/paper/minif2f-a-cross-system-benchmark-for-formal","metrics":{"Pass@1":"23.9","Pass@8":"29.3"},"code_links":[{"title":"openai/minif2f","url":"https://github.com/openai/minif2f"},{"title":"facebookresearch/minif2f","url":"https://github.com/facebookresearch/minif2f"},{"title":"yangky11/minif2f-lean4","url":"https://github.com/yangky11/minif2f-lean4"},{"title":"rah4927/lean-dojo-mew","url":"https://github.com/rah4927/lean-dojo-mew"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":17,"of":17,"counts":{"papers_with_a_benchmark_row":17,"with_a_code_link":14,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":17,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/kimina-prover-preview-towards-large-formal","slug":"kimina-prover-preview-towards-large-formal","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning","date":"2025-04-15","arxiv_id":"2504.11354","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["moonshotai/kimina-prover-preview"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kimina-prover-preview-towards-large-formal#ran","syntology_url":"https://syntology.ai/paper/2504.11354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.11354"}}}},{"paper":"/paper/efficient-neural-theorem-proving-via-fine","slug":"efficient-neural-theorem-proving-via-fine","title":"Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis","date":"2025-01-30","arxiv_id":"2501.18310","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/subgoalxl-subgoal-based-expert-learning-for","slug":"subgoalxl-subgoal-based-expert-learning-for","title":"SubgoalXL: Subgoal-based Expert Learning for Theorem Proving","date":"2024-08-20","arxiv_id":"2408.11172","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deepseek-prover-v1-5-harnessing-proof","slug":"deepseek-prover-v1-5-harnessing-proof","title":"DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search","date":"2024-08-15","arxiv_id":"2408.08152","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["deepseek-ai/deepseek-prover-v1.5"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepseek-prover-v1-5-harnessing-proof#ran","syntology_url":"https://syntology.ai/paper/2408.08152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08152"}}}},{"paper":"/paper/deepseek-prover-advancing-theorem-proving-in","slug":"deepseek-prover-advancing-theorem-proving-in","title":"DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data","date":"2024-05-23","arxiv_id":"2405.14333","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/an-empirical-study-of-data-ability-boundary","slug":"an-empirical-study-of-data-ability-boundary","title":"An Empirical Study of Data Ability Boundary in LLMs' Math Reasoning","date":"2024-02-23","arxiv_id":"2403.00799","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":2,"pointer_only_for_licence":11,"official":{"repos":["cyzhh/MMOS"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/an-empirical-study-of-data-ability-boundary#ran","syntology_url":"https://syntology.ai/paper/2403.00799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00799"}}}},{"paper":"/paper/llemma-an-open-language-model-for-mathematics","slug":"llemma-an-open-language-model-for-mathematics","title":"Llemma: An Open Language Model For Mathematics","date":"2023-10-16","arxiv_id":"2310.10631","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["EleutherAI/math-lm","eleutherai/gpt-neox","wellecks/llmstep"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llemma-an-open-language-model-for-mathematics#ran","syntology_url":"https://syntology.ai/paper/2310.10631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10631"}}}},{"paper":"/paper/a-language-agent-approach-to-formal-theorem","slug":"a-language-agent-approach-to-formal-theorem","title":"An In-Context Learning Agent for Formal Theorem-Proving","date":"2023-10-06","arxiv_id":"2310.04353","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/lego-prover-neural-theorem-proving-with","slug":"lego-prover-neural-theorem-proving-with","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","date":"2023-10-01","arxiv_id":"2310.00656","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/lyra-orchestrating-dual-correction-in","slug":"lyra-orchestrating-dual-correction-in","title":"Lyra: Orchestrating Dual Correction in Automated Theorem Proving","date":"2023-09-27","arxiv_id":"2309.15806","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["chuanyang-zheng/lyra-theorem-prover"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lyra-orchestrating-dual-correction-in#ran","syntology_url":"https://syntology.ai/paper/2309.15806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15806"}}}},{"paper":"/paper/decomposing-the-enigma-subgoal-based","slug":"decomposing-the-enigma-subgoal-based","title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving","date":"2023-05-25","arxiv_id":"2305.16366","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/draft-sketch-and-prove-guiding-formal-theorem","slug":"draft-sketch-and-prove-guiding-formal-theorem","title":"Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs","date":"2022-10-21","arxiv_id":"2210.12283","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/hypertree-proof-search-for-neural-theorem","slug":"hypertree-proof-search-for-neural-theorem","title":"HyperTree Proof Search for Neural Theorem Proving","date":"2022-05-23","arxiv_id":"2205.11491","rows_on_this_dataset":8,"code_links":0,"syntology":null},{"paper":"/paper/thor-wielding-hammers-to-integrate-language","slug":"thor-wielding-hammers-to-integrate-language","title":"Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers","date":"2022-05-22","arxiv_id":"2205.10893","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/formal-mathematics-statement-curriculum","slug":"formal-mathematics-statement-curriculum","title":"Formal Mathematics Statement Curriculum Learning","date":"2022-02-03","arxiv_id":"2202.01344","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/minif2f-a-cross-system-benchmark-for-formal","slug":"minif2f-a-cross-system-benchmark-for-formal","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","date":"2021-08-31","arxiv_id":"2109.00110","rows_on_this_dataset":6,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["openai/minif2f"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/minif2f-a-cross-system-benchmark-for-formal#ran","syntology_url":"https://syntology.ai/paper/2109.00110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00110"}}}},{"paper":"/paper/proof-artifact-co-training-for-theorem","slug":"proof-artifact-co-training-for-theorem","title":"Proof Artifact Co-training for Theorem Proving with Language Models","date":"2021-02-11","arxiv_id":"2102.06203","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jasonrute/lean-proof-recording-public","jasonrute/lean_proof_recording","jesse-michael-han/lean-step-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/proof-artifact-co-training-for-theorem#ran","syntology_url":"https://syntology.ai/paper/2102.06203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06203"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/kimina-prover-preview-towards-large-formal","slug":"kimina-prover-preview-towards-large-formal","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning","date":"2025-04-15","arxiv_id":"2504.11354","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["moonshotai/kimina-prover-preview"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kimina-prover-preview-towards-large-formal#ran","syntology_url":"https://syntology.ai/paper/2504.11354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.11354"}}}},{"paper":"/paper/efficient-neural-theorem-proving-via-fine","slug":"efficient-neural-theorem-proving-via-fine","title":"Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis","date":"2025-01-30","arxiv_id":"2501.18310","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/subgoalxl-subgoal-based-expert-learning-for","slug":"subgoalxl-subgoal-based-expert-learning-for","title":"SubgoalXL: Subgoal-based Expert Learning for Theorem Proving","date":"2024-08-20","arxiv_id":"2408.11172","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deepseek-prover-v1-5-harnessing-proof","slug":"deepseek-prover-v1-5-harnessing-proof","title":"DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search","date":"2024-08-15","arxiv_id":"2408.08152","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["deepseek-ai/deepseek-prover-v1.5"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepseek-prover-v1-5-harnessing-proof#ran","syntology_url":"https://syntology.ai/paper/2408.08152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08152"}}}},{"paper":"/paper/deepseek-prover-advancing-theorem-proving-in","slug":"deepseek-prover-advancing-theorem-proving-in","title":"DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data","date":"2024-05-23","arxiv_id":"2405.14333","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/an-empirical-study-of-data-ability-boundary","slug":"an-empirical-study-of-data-ability-boundary","title":"An Empirical Study of Data Ability Boundary in LLMs' Math Reasoning","date":"2024-02-23","arxiv_id":"2403.00799","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":2,"pointer_only_for_licence":11,"official":{"repos":["cyzhh/MMOS"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/an-empirical-study-of-data-ability-boundary#ran","syntology_url":"https://syntology.ai/paper/2403.00799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00799"}}}},{"paper":"/paper/llemma-an-open-language-model-for-mathematics","slug":"llemma-an-open-language-model-for-mathematics","title":"Llemma: An Open Language Model For Mathematics","date":"2023-10-16","arxiv_id":"2310.10631","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["EleutherAI/math-lm","eleutherai/gpt-neox","wellecks/llmstep"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llemma-an-open-language-model-for-mathematics#ran","syntology_url":"https://syntology.ai/paper/2310.10631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10631"}}}},{"paper":"/paper/a-language-agent-approach-to-formal-theorem","slug":"a-language-agent-approach-to-formal-theorem","title":"An In-Context Learning Agent for Formal Theorem-Proving","date":"2023-10-06","arxiv_id":"2310.04353","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/lego-prover-neural-theorem-proving-with","slug":"lego-prover-neural-theorem-proving-with","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","date":"2023-10-01","arxiv_id":"2310.00656","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/lyra-orchestrating-dual-correction-in","slug":"lyra-orchestrating-dual-correction-in","title":"Lyra: Orchestrating Dual Correction in Automated Theorem Proving","date":"2023-09-27","arxiv_id":"2309.15806","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["chuanyang-zheng/lyra-theorem-prover"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lyra-orchestrating-dual-correction-in#ran","syntology_url":"https://syntology.ai/paper/2309.15806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15806"}}}},{"paper":"/paper/decomposing-the-enigma-subgoal-based","slug":"decomposing-the-enigma-subgoal-based","title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving","date":"2023-05-25","arxiv_id":"2305.16366","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/draft-sketch-and-prove-guiding-formal-theorem","slug":"draft-sketch-and-prove-guiding-formal-theorem","title":"Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs","date":"2022-10-21","arxiv_id":"2210.12283","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/hypertree-proof-search-for-neural-theorem","slug":"hypertree-proof-search-for-neural-theorem","title":"HyperTree Proof Search for Neural Theorem Proving","date":"2022-05-23","arxiv_id":"2205.11491","rows_on_this_dataset":8,"code_links":0,"syntology":null},{"paper":"/paper/thor-wielding-hammers-to-integrate-language","slug":"thor-wielding-hammers-to-integrate-language","title":"Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers","date":"2022-05-22","arxiv_id":"2205.10893","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/formal-mathematics-statement-curriculum","slug":"formal-mathematics-statement-curriculum","title":"Formal Mathematics Statement Curriculum Learning","date":"2022-02-03","arxiv_id":"2202.01344","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/minif2f-a-cross-system-benchmark-for-formal","slug":"minif2f-a-cross-system-benchmark-for-formal","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","date":"2021-08-31","arxiv_id":"2109.00110","rows_on_this_dataset":6,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["openai/minif2f"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/minif2f-a-cross-system-benchmark-for-formal#ran","syntology_url":"https://syntology.ai/paper/2109.00110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00110"}}}},{"paper":"/paper/proof-artifact-co-training-for-theorem","slug":"proof-artifact-co-training-for-theorem","title":"Proof Artifact Co-training for Theorem Proving with Language Models","date":"2021-02-11","arxiv_id":"2102.06203","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jasonrute/lean-proof-recording-public","jasonrute/lean_proof_recording","jesse-michael-han/lean-step-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/proof-artifact-co-training-for-theorem#ran","syntology_url":"https://syntology.ai/paper/2102.06203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06203"}}}}],"papers_where_code_ran":7,"papers_where_code_ran_first_page":"/dataset/minif2f/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/minif2f/papers/ran/1","json":"/dataset/minif2f/papers/ran/1.json","rows":7}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":7,"samples_harvested":47,"samples_ran":42,"samples_constructed":0,"samples_ran_checked":27,"samples_ran_instrument_failed":15,"samples_unverified":5,"pointer_only_for_licence":14,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":7,"papers_with_a_run_with_no_instrument_failure":5,"papers_where_every_run_was_an_instrument_failure":2,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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)"},"since_archive_judged":{"papers":3,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/automated-theorem-proving-on-minif2f-test","since_archive":"/sota/automated-theorem-proving-on-minif2f-test#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/automated-theorem-proving-on-minif2f-valid","since_archive":"/sota/automated-theorem-proving-on-minif2f-valid#since-judged","papers_judged":1,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"f0c3de4921068a473d9cdcae657b8bc79f899d220507b389245c212c24325ded","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}