{"id":"https://openalex.org/W7165011577","doi":"https://doi.org/10.48550/arxiv.2606.17981","title":"Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs","display_name":"Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W7165011577","doi":"https://doi.org/10.48550/arxiv.2606.17981"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.17981","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17981","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.17981","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138825984","display_name":"Ning Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Ning","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027427564","display_name":"Nongyu Di","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Di, Nongyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138761050","display_name":"Zenan Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Zenan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138805640","display_name":"Yuan Yao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yao, Yuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138787740","display_name":"Xiaoxing Ma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ma, Xiaoxing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.7332000136375427,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.7332000136375427,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.07150000333786011,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.03310000151395798,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.9164000153541565},{"id":"https://openalex.org/keywords/proof-of-concept","display_name":"Proof of concept","score":0.6502000093460083},{"id":"https://openalex.org/keywords/automation","display_name":"Automation","score":0.6025000214576721},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.559499979019165},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5425000190734863},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.47600001096725464},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.47040000557899475},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.4255000054836273}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.9164000153541565},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.6502000093460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6309000253677368},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.6025000214576721},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.559499979019165},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5425000190734863},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.47600001096725464},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.47040000557899475},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.4255000054836273},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.4242999851703644},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4223000109195709},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.4077000021934509},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40639999508857727},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.38909998536109924},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.3440999984741211},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3075999915599823},{"id":"https://openalex.org/C2777431735","wikidata":"https://www.wikidata.org/wiki/Q1535975","display_name":"Burden of proof","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C13655849","wikidata":"https://www.wikidata.org/wiki/Q25294","display_name":"Hammer","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2700999975204468},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.2578999996185303},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.2567000091075897},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.17981","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17981","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.17981","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.17981","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"As":[0],"AI-generated":[1],"code":[2],"proliferates,":[3],"formal":[4],"verification,":[5],"particularly":[6],"through":[7],"interactive":[8],"theorem":[9],"provers":[10,29],"such":[11,28,57],"as":[12,58],"Rocq":[13,110,202],"and":[14,115,152,154],"Isabelle,":[15],"becomes":[16],"increasingly":[17],"important":[18],"for":[19],"ensuring":[20],"software":[21],"correctness.":[22],"However,":[23],"producing":[24],"machine-checked":[25],"proofs":[26,139],"in":[27,109,197],"remains":[30],"a":[31,81,119,133,182],"bottleneck.":[32],"Existing":[33],"solutions":[34],"bring":[35],"complementary":[36],"strengths":[37],"to":[38,98,195],"proof":[39,48,83,88,91,102,209],"automation:":[40],"large":[41],"language":[42],"models":[43],"(LLMs)":[44],"can":[45,60,211],"propose":[46,100],"high-level":[47],"strategies":[49],"but":[50,66],"lack":[51,67],"local":[52,64],"rigor,":[53],"while":[54,177],"automated":[55],"tactics":[56],"CoqHammer":[59,153],"reliably":[61],"discharge":[62],"many":[63],"goals":[65],"long-range":[68],"planning":[69,89,217],"capabilities.":[70],"To":[71],"combine":[72],"the":[73,190],"best":[74],"of":[75,142,150],"both":[76],"worlds,":[77],"we":[78],"present":[79],"Quarry,":[80],"planning-based":[82,169],"synthesis":[84],"framework":[85],"that":[86,123,168,207],"separates":[87],"from":[90],"execution.":[92],"Specifically,":[93],"Quarry":[94,147,187],"asks":[95],"an":[96],"LLM":[97],"actively":[99],"multiple":[101,158,162],"decompositions":[103],"with":[104,171,218],"arbitrary":[105],"sublemmas,":[106,114],"type-checks":[107],"them":[108],"under":[111],"temporarily":[112],"admitted":[113],"ranks":[116],"candidates":[117],"using":[118,157],"proof-state-based":[120],"difficulty":[121],"model":[122],"estimates":[124],"hammer":[125],"solvability.":[126],"It":[127],"then":[128],"recursively":[129],"proves":[130],"sublemmas":[131],"within":[132],"bounded":[134],"budget,":[135,186],"effectively":[136],"turning":[137],"long":[138],"into":[140],"sequences":[141],"hammer-solvable":[143],"obligations.":[144],"We":[145],"implement":[146],"on":[148],"top":[149],"SerAPI":[151],"evaluate":[155],"it":[156],"frontier":[159],"LLMs":[160],"across":[161,200],"benchmarks.":[163,203],"The":[164],"experimental":[165],"results":[166,205],"show":[167],"decomposition":[170],"solvability-aware":[172],"ranking":[173],"substantially":[174],"improves":[175,188],"automation":[176,210],"maintaining":[178],"predictable":[179],"cost.":[180],"Under":[181],"uniform":[183],"10-minute":[184],"wall-clock":[185],"over":[189],"strongest":[191],"baseline":[192],"by":[193,214],"7%":[194],"13%":[196],"success":[198],"rate":[199],"three":[201],"These":[204],"demonstrate":[206],"reliable":[208],"be":[212],"achieved":[213],"coordinating":[215],"neural":[216],"symbolic":[219],"execution":[220],"rather":[221],"than":[222],"replacing":[223],"either.":[224]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-18T00:00:00"}