{"id":20687236,"url":"https://github.com/leoprover/leo-iii","last_synced_at":"2025-08-21T11:32:22.024Z","repository":{"id":15179068,"uuid":"17906911","full_name":"leoprover/Leo-III","owner":"leoprover","description":"An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics","archived":false,"fork":false,"pushed_at":"2025-06-19T12:24:18.000Z","size":35641,"stargazers_count":49,"open_issues_count":11,"forks_count":10,"subscribers_count":17,"default_branch":"master","last_synced_at":"2025-08-16T03:11:25.549Z","etag":null,"topics":["atp","deduction-system","higher-order-logic","logic","reasoning","theorem-proving"],"latest_commit_sha":null,"homepage":"","language":"Scala","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-3-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/leoprover.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":"AUTHORS","dei":null,"publiccode":null,"codemeta":null}},"created_at":"2014-03-19T14:21:36.000Z","updated_at":"2025-07-19T22:01:55.000Z","dependencies_parsed_at":"2023-01-11T20:22:58.289Z","dependency_job_id":"1352090b-f25b-44ec-a14b-1bf9963a9ef9","html_url":"https://github.com/leoprover/Leo-III","commit_stats":null,"previous_names":[],"tags_count":21,"template":false,"template_full_name":null,"purl":"pkg:github/leoprover/Leo-III","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leoprover%2FLeo-III","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leoprover%2FLeo-III/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leoprover%2FLeo-III/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leoprover%2FLeo-III/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/leoprover","download_url":"https://codeload.github.com/leoprover/Leo-III/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leoprover%2FLeo-III/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271470220,"owners_count":24765349,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-21T02:00:08.990Z","response_time":74,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["atp","deduction-system","higher-order-logic","logic","reasoning","theorem-proving"],"created_at":"2024-11-16T22:56:31.200Z","updated_at":"2025-08-21T11:32:19.357Z","avatar_url":"https://github.com/leoprover.png","language":"Scala","funding_links":[],"categories":[],"sub_categories":[],"readme":"Leo-III\n========\n*An automated theorem prover for classical higher-order logic with choice*\n\nLeo-III [SB19,S18,SB18] is an automated theorem prover for (polymorphic) higher-order logic which supports all common TPTP dialects, including THF, TFF and FOF as well as their rank-1 polymorphic derivatives [Sut08,SWB17]. \nIt is based on a paramodulation calculus with ordering constraints and, in tradition of its predecessor LEO-II [BP15], heavily relies on cooperation with external (mostly first-order) theorem provers for increased performance. Nevertheless, Leo-III can also be used as a stand-alone prover without employing any external cooperation.\n\nIn addition for its HOL reasoning capabilities, Leo-III supports reasoning in many higher-order quantified modal logics [GS18,GSB17].\n\nLeo-III was initially developed at Freie Universität Berlin, and then at University of Luxembourg (until 2021). From 2014 - 2018, it was supported by the German National Research Foundation (DFG) under project BE 2501/11-1 (Leo-III). Since 2022, Leo-III is maintained and developed at the University of Greifswald, Germany. The main contributors are (sorted alphabetically): Christoph Benzmüller, Alexander Steen and Max Wisniewski. For a full list of contributors to the project and used and third-party libraries, please refer to the `AUTHORS` file in the source distribution.\n\nLeo-III may be cited as [![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.4435994.svg)](https://doi.org/10.5281/zenodo.4435994)\n\n## Install\nLeo-III is written in the Scala programming language. It can be installed quite simply using the sbt build tool. Please refer to [INSTALL.md](INSTALL.md) to details.\n\n## Usage\nLeo-III runs on the JVM and accepts pretty much every [TPTP input dialect](http://www.cs.miami.edu/~tptp/TPTP/TR/TPTPTR.shtml) (e.g. FOF, TFF, THF) but it's mainly focused on reasoning in classical higher-order logic represented as THF. See [USAGE.md](USAGE.md) for details for its usage.\n\n## License\nLeo-III is licensed under the BSD 3-clause \"New\" or \"Revised\" License. See [LICENSE](LICENSE).\n\n## Contributing\nWe are always greateful to hear feedback from our users:\n\n- If you are using Leo-III for any project yourself, we would be happy to hear about it! \n- If you encounter problems using Leo-III, feel tree to open a bug report (or simply a question) on the GitHub page.\n- If you are interested to contribute to the project, simply fork the GitHub repository and open pull requests!\n\n## Further information\nFurther information including related projects can be found on the [Leo-III project GitHub page](https://github.com/leoprover/), and for details on the Leo-III system (implementation), we refer to the system description [BSW17] and Steen's dissertation [S18].\n\n## References\n\n[SB21] Alexander Steen, Christoph Benzmüller, *Extensional Higher-Order Paramodulation in Leo-III*. Journal of Automated Reasoning 65, pp. 775-807, 2021. Preprint available at [arXiv:1907.11501](https://arxiv.org/abs/1907.11501).\n\n\n[S18] Alexander Steen, [*Extensional Paramodulation for Higher-Order Logic and its Effective Implementation Leo-III*](http://www.aka-verlag.de/index.php?option=com_virtuemart\u0026view=productdetails\u0026virtuemart_product_id=701\u0026virtuemart_category_id=4\u0026Itemid=482\u0026lang=en). Dissertation, Freie Universität Berlin. Published in Dissertations in Artificial Intelligence (DISKI), volume 345, EAN/ISBN 978-3-89838-739-2, AKA-Verlag, 2018. Preprint available [here](https://www.alexandersteen.de/phd/thesis-steen.pdf).\n\n[GS18] Tobias Gleißner, Alexander Steen, [*The MET: The Art of Flexible Reasoning with Modalities*](https://doi.org/10.1007/978-3-319-99906-7_19). In Christoph Benzmüller, Francesco Ricca (Eds.), 2nd International Joint Conference on Rules and Reasoning (RuleML+RR 2018), Proceedings, Springer, LNCS, 2018. \n\n[SB18] Alexander Steen, Christoph Benzmüller, [*The Higher-Order Prover Leo-III*](https://doi.org/10.1007/978-3-319-94205-6_8). In Didier Galmiche, Stephan Schulz, Roberto Sebastiani (Eds.), Automated Reasoning --- 9th International Joint Conference, IJCAR 2018, Oxford, UK, July 14-17, 2018, Proceedings , Springer, LNCS, Volume 10900, pp. 108-116, 2018. Preprint available [here](http://christoph-benzmueller.de/papers/C70.pdf).\n\n[GSB17] Tobias Gleißner, Alexander Steen, Christoph Benzmüller, [*Theorem Provers for Every Normal Modal Logic*](https://doi.org/10.29007/jsb9). In LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Thomas Eiter, David Sands, eds.), EasyChair, EPiC Series in Computing, volume 46, pp. 14-30, 2017.\n\n[BSW17] Christoph Benzmüller, Alexander Steen, Max Wisniewski, [*Leo-III Version 1.1 (System description)*](https://doi.org/10.29007/grmx), In Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov (Eds.), IWIL Workshop and LPAR Short Presentations, EasyChair, Kalpa Publications in Computing, Volume 1, pp. 11-26, 2017.\n\n[SWB16] Alexander Steen, Max Wisniewski, Christoph Benzmüller, [*Agent-Based HOL Reasoning*](http://dx.doi.org/10.1007/978-3-319-42432-3_10). In 5th International Congress on Mathematical Software, ICMS 2016, Berlin, Germany, July 2016, Proceedings, Springer, LNCS, volume 9725. 2016.\n\n[SWB17] Alexander Steen, Max Wisniewski, Christoph Benzmüller, [*Going Polymorphic - TH1 Reasoning for Leo-III*](https://doi.org/10.29007/jgkw). In IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017 (Thomas Eiter, David Sands, Geoff Sutcliffe, Andrei Voronkov, eds.), EasyChair, Kalpa Publications in Computing, volume 1, 2017.\n\n[BP15] \tChristoph Benzmüller, Lawrence C. Paulson, Nik Sultana, Frank Theiß, [*The Higher-Order Prover LEO-II*](http://dx.doi.org/10.1007/s10817-015-9348-y), In Journal of Automated Reasoning, volume 55, number 4, pp. 389-404, 2015.\n\n[Sut08] Sutcliffe G. (2008), [*The SZS Ontologies for Automated Reasoning Software*](http://www.cs.miami.edu/home/geoff/Papers/Conference/2008_Sut08_KEAPPA-38-49.pdf),\n    Rudnicki P., Sutcliffe G., Proceedings of the LPAR Workshops: Knowledge \n    Exchange: Automated Provers and Proof Assistants, and The 7th International \n    Workshop on the Implementation of Logics (Doha, Qattar), CEUR Workshop \n    Proceedings 418, 38-49.\n    \n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fleoprover%2Fleo-iii","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fleoprover%2Fleo-iii","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fleoprover%2Fleo-iii/lists"}