{"id":"https://openalex.org/W4416203133","doi":"https://doi.org/10.1007/s10817-025-09745-6","title":"Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs","display_name":"Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs","publication_year":2025,"publication_date":"2025-11-12","ids":{"openalex":"https://openalex.org/W4416203133","doi":"https://doi.org/10.1007/s10817-025-09745-6"},"language":"en","primary_location":{"id":"doi:10.1007/s10817-025-09745-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-025-09745-6","pdf_url":null,"source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s10817-025-09745-6","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042128349","display_name":"Olaf Beyersdorff","orcid":"https://orcid.org/0000-0002-2870-1648"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Olaf Beyersdorff","raw_affiliation_strings":["Institute of Computer Science, Friedrich Schiller University Jena, Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109512042","display_name":"Benjamin B\u00f6hm","orcid":null},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Benjamin B\u00f6hm","raw_affiliation_strings":["Institute of Computer Science, Friedrich Schiller University Jena, Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020709378","display_name":"Meena Mahajan","orcid":"https://orcid.org/0000-0002-9116-4398"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]},{"id":"https://openalex.org/I200207707","display_name":"Homi Bhabha National Institute","ror":"https://ror.org/02bv3zr67","country_code":"IN","type":"education","lineage":["https://openalex.org/I200207707"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Meena Mahajan","raw_affiliation_strings":["The Institute of Mathematical Sciences (CI of Homi Bhabha National Institute), Chennai, India"],"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences (CI of Homi Bhabha National Institute), Chennai, India","institution_ids":["https://openalex.org/I59611059","https://openalex.org/I200207707"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020709378"],"corresponding_institution_ids":["https://openalex.org/I200207707","https://openalex.org/I59611059"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.41737473,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"69","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.4124999940395355,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.4124999940395355,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.2653000056743622,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.12370000034570694,"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.8817999958992004},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.7818999886512756},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.6432999968528748},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.6419000029563904},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6111999750137329},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6044999957084656},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.5755000114440918},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.49810001254081726}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8817999958992004},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.7818999886512756},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.6432999968528748},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.6419000029563904},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6111999750137329},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6044999957084656},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5755000114440918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5115000009536743},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.49810001254081726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.476500004529953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4453999996185303},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37279999256134033},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.35850000381469727},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34689998626708984},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.3285999894142151},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.304500013589859},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.28619998693466187},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.263700008392334},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.25589999556541443},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10817-025-09745-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-025-09745-6","pdf_url":null,"source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10817-025-09745-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-025-09745-6","pdf_url":null,"source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W25993968","https://openalex.org/W1778004173","https://openalex.org/W1851471023","https://openalex.org/W1976876676","https://openalex.org/W1988882144","https://openalex.org/W2005573219","https://openalex.org/W2051846104","https://openalex.org/W2070447189","https://openalex.org/W2121015471","https://openalex.org/W2131455536","https://openalex.org/W2131550405","https://openalex.org/W2171790376","https://openalex.org/W2215982992","https://openalex.org/W2280623821","https://openalex.org/W2493091936","https://openalex.org/W2547601025","https://openalex.org/W2592985765","https://openalex.org/W2797038806","https://openalex.org/W2918119152","https://openalex.org/W2952988220","https://openalex.org/W2963235336","https://openalex.org/W2997580674","https://openalex.org/W3006150593","https://openalex.org/W3135720677","https://openalex.org/W4206807714","https://openalex.org/W4285602404","https://openalex.org/W4393153351","https://openalex.org/W4401438417","https://openalex.org/W4404772566","https://openalex.org/W6929027710"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Conflict-driven":[1],"clause":[2],"learning":[3],"(CDCL)":[4],"is":[5,24,55,83,105],"the":[6,27,58,62,69,91,94,114,123],"dominating":[7],"algorithmic":[8],"paradigm":[9],"for":[10,30,52,129,134,151],"SAT":[11,38],"solving":[12,31],"and":[13,39,90,113],"hugely":[14],"successful":[15],"in":[16,61,80,97],"practice.":[17],"In":[18,36],"its":[19],"lifted":[20],"version":[21],"QCDCL,":[22],"it":[23,54],"one":[25],"of":[26,48,93,116],"main":[28],"approaches":[29],"quantified":[32],"Boolean":[33],"formulas":[34],"(QBF).":[35],"both":[37],"QBF,":[40],"proofs":[41,96,125],"can":[42],"be":[43],"efficiently":[44],"extracted":[45,95,124],"from":[46],"runs":[47],"(Q)CDCL":[49],"solvers.":[50],"While":[51],"CDCL,":[53],"known":[56],"that":[57,79,103],"proof":[59,64,137],"size":[60,92,115],"underlying":[63],"system":[65],"propositional":[66],"resolution":[67,99,119],"matches":[68],"CDCL":[70],"runtime":[71,89,112],"up":[72],"to":[73],"a":[74,108,135],"polynomial":[75],"factor,":[76],"we":[77],"show":[78],"QBF":[81,98,118],"there":[82],"an":[84,148],"exponential":[85,149],"gap":[86,109],"between":[87,110],"QCDCL":[88,111,139],"systems.":[100],"We":[101],"demonstrate":[102],"this":[104],"not":[106],"just":[107],"any":[117],"proof,":[120],"but":[121],"even":[122],"are":[126],"exponentially":[127],"smaller":[128],"some":[130,152],"instances.":[131,153],"Hence":[132],"searching":[133],"small":[136],"via":[138],"(even":[140],"with":[141],"non-deterministic":[142],"decision":[143],"policies)":[144],"will":[145],"provably":[146],"incur":[147],"overhead":[150]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-12T00:00:00"}