[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-504947-105":59,"doc-detail-504947-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","proceedings-of-sat-competition-2022-solver-and-benchmark-descriptions","Proceedings of SAT Competition 2022 - Solver and Benchmark Descriptions","","Proceedings of SAT Competition 2022 compiles nonpeer-reviewed solver and benchmark descriptions submitted for SAT Competition 2022 (SC 2022). The preface explains the role of SAT solver competitions in advancing Boolean satisfiability solving through new algorithms, improved heuristics, and refined implementation techniques. It outlines four SC 2022 tracks, describes how contributors submit solvers or benchmark instances with short descriptions, and acknowledges community support and compute resources used for the event.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/proceedings-of-sat-competition-2022-solver-and-benchmark-descriptions/504947/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/proceedings-of-sat-competition-2022-solver-and-benchmark-descriptions/504947.png","ImageObject",300,407,{"name":92,"@type":93},"Damian","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-22","2026-10-04",true,{"@type":102,"interactionType":103,"userInteractionCount":29},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What is the purpose of these SAT Competition 2022 proceedings?","Question",{"text":112,"@type":113},"The proceedings collect short, nonpeer-reviewed descriptions of solvers and benchmark instances contributed to SC 2022, enabling consistent citation and comparison of state-of-the-art approaches.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How many tracks were included in SC 2022, and what were they?",{"text":117,"@type":113},"SC 2022 had four tracks: Main Track (including CaDiCaL 1.4 Hack and No Limits sub-tracks), Parallel Track, Cloud Track, and a special Anniversary Track.",{"name":119,"@type":110,"acceptedAnswer":120},"What are the two ways to contribute to SC 2022 described in the preface?",{"text":121,"@type":113},"Contributors could submit one or more SAT solvers to participate, or submit benchmark instances on which the submitted solvers would be evaluated.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},504947,1791108163,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":29,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145},137451208677,"https://ap-avatar.wpscdn.com/davatar_155a257f0dc6eb9ab79c44ca47cae57d","[https://helda.helsinki.fi](https://helda.helsinki.fi)[ ](https://helda.helsinki.fi)Helda  \n| Proceedings of SAT Competition 2022 : Solver and Benchmark Descriptions\u003Cbr>2022 |\n| --- |\n| Balyo, T, Heule, M J H, Iser, M, Järvisalo, M & Suda, M (eds) 2022, Proceedings of SAT Competition 2022 : Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2022-1, Department of Computer Science, University of Helsinki, Helsinki. |\n| [http://hdl.handle.net/10138/359079](http://hdl.handle.net/10138/359079) |\n| unspecified\u003Cbr>publishedVersion |\n\nDownloaded from Helda, University of Helsinki institutional repository. This is an electronic reprint of the original article.  \nThis reprint may differ from the original in pagination and typographic detail. Please cite the original version.  \nProceedings of  \nSAT COMPETITION 2022  \nSolver and Benchmark Descriptions  \nTomá Balyo, MarijnJ. H. Heule, Markus Iser, MattiJärvisalo, and Martin Suda (editors)  \nUniversity of Helsinki Department of Computer Science Series of Publications B  \nReport B-2022-1  \nHelsinki 2022  \nPREFACE  \nThe area of Boolean satisfiability (SAT) solving keeps on making progress. Besides new algorithmsand better heuristics, refined implementation techniques turned out to be vital for the success story of SAT solving. To keep up the driving force in improving SAT solvers, SAT solver competitions provide opportunities for solver developers to present their work to a broader audience and to objectively compare the performance of their own solvers with that of other state-of-the-art solvers.  \nSAT Competition 2022 (SC 2022, [https://satcompetition.github.io/2022/](https://satcompetition.github.io/2022/) ), a competitive event for SAT solvers, was organized as a satellite event of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) . SC 2022 stands in the tradition of the previously organized main competitive events for SAT solvers: the SAT Competitions held 2002- 2005, biannually during 2007-2013, 2014, 2016–2018, and 2020–2021; the SAT Races held in 2006, 2008, 2010, 2015, and 2019; and SAT Challenge 2012 .  \nSC 2022 consisted of a total of four tracks: Main Track (with CaDiCaL 1.4 Hack and No Limits sub-tracks), Parallel Track, Cloud Track and a special Anniversary Track in celebration of the 20th anniversary of this series of SAT Competitions (as well as the 30th anniversity of the first competition) . The benchmarks for the anniversary track comprise of all benchmark instances which have been used in Application, Crafted, and Main Tracks of previous SAT competitions.  \nThere were two ways of contributing to SC 2022: by submitting one or more solvers to participate in the competition and by submitting interesting benchmark instances on which the submitted solvers could be evaluated in the competition. The rules of SC 2022 required all contributors to submit a short, 1-2 page long description as part of their contribution. This book contains these nonpeer-reviewed descriptions in a single volume, providing a way of consistently citing the individual descriptions and finding out more details on the individual solvers and benchmarks.  \nSuccessfully running SC 2022 would not have been possible without active support from the community at large. We would like to thank the StarExec initiative ([http://www.starexec.org](http://www.starexec.org) ) for the computing resources needed to run SC 2022 . Many thanks go to Aaron Stump for his invaluable help in setting up StarExec to accommodate for the competition's needs. Furthermore, we thank Amazon for providing the resources and support to develop parallel and distributed solvers on the AWS cloud and for executing the Cloud and Parallel tracks.  \nFinally, we would like to emphasize that a competition does not exist without participants: we thank all those who contributed to SC 2022 by submitting either solvers or benchmarks and the related description.  \nT","cbCaifv1Vs03mW6Z","https://ap.wps.com/l/cbCaifv1Vs03mW6Z","pdf",6968333,93,"English","# Preface\n# Solver Descriptions\n## Gimsatul, IsaSAT, Kissat Entering the SAT Competition 2022\n## BreakID-kissat and BreakID-kissat-WithUNSATCertificates in SAT Competition 2022\n## Kissat_MAB: Upper Confidence Bound Strategies to Combine VSIDS and CHB\n## CDCL Solvers based on Bounded Exploration and the Glue Bumping method\n## Kissat-ELS and its friends at the SAT Competition 2022\n## Combining Hybrid Walking Strategy with Kissat_MAB, CaDiCaL, and LStech-Maple","[{\"question\":\"What is the purpose of these SAT Competition 2022 proceedings?\",\"answer\":\"The proceedings collect short, nonpeer-reviewed descriptions of solvers and benchmark instances contributed to SC 2022, enabling consistent citation and comparison of state-of-the-art approaches.\"},{\"question\":\"How many tracks were included in SC 2022, and what were they?\",\"answer\":\"SC 2022 had four tracks: Main Track (including CaDiCaL 1.4 Hack and No Limits sub-tracks), Parallel Track, Cloud Track, and a special Anniversary Track.\"},{\"question\":\"What are the two ways to contribute to SC 2022 described in the preface?\",\"answer\":\"Contributors could submit one or more SAT solvers to participate, or submit benchmark instances on which the submitted solvers would be evaluated.\"}]","Proceedings of SAT Competition 2022 - Solver and Benchmark Descriptions | PDF",1791080432,234]