{"id":21155165,"url":"https://github.com/acorrenson/saturne","last_synced_at":"2025-07-09T11:31:29.500Z","repository":{"id":45110468,"uuid":"252996403","full_name":"acorrenson/SATurne","owner":"acorrenson","description":"Tiny verified SAT-solver","archived":false,"fork":false,"pushed_at":"2022-01-07T18:55:04.000Z","size":431,"stargazers_count":18,"open_issues_count":0,"forks_count":3,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-07-30T17:54:52.480Z","etag":null,"topics":["coq","formal-verification","hacktoberfest","sat","sat-solver"],"latest_commit_sha":null,"homepage":"","language":"Coq","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/acorrenson.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}},"created_at":"2020-04-04T12:54:01.000Z","updated_at":"2024-05-02T09:14:29.000Z","dependencies_parsed_at":"2022-09-16T13:52:51.616Z","dependency_job_id":null,"html_url":"https://github.com/acorrenson/SATurne","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/acorrenson%2FSATurne","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/acorrenson%2FSATurne/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/acorrenson%2FSATurne/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/acorrenson%2FSATurne/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/acorrenson","download_url":"https://codeload.github.com/acorrenson/SATurne/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225537688,"owners_count":17485070,"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","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":["coq","formal-verification","hacktoberfest","sat","sat-solver"],"created_at":"2024-11-20T11:16:23.951Z","updated_at":"2024-11-20T11:16:24.553Z","avatar_url":"https://github.com/acorrenson.png","language":"Coq","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cdiv align=\"center\"\u003e\n\n\u003cp\u003e\n    \u003cimg width=\"80%\" src=\"planet.png\" alt=\"SATurne\"\u003e\n\u003c/p\u003e\n\n# SATurne\n\n*A purely functional verified SAT solver which produces proofs*\n\n\u003c/div\u003e\n\n\n**SATurne** is a simple purely functional SAT solver written and verified in [Coq](https://coq.inria.fr/). It's a tiny solver absolutely not designed for performances nor scalability. It is, however, intended to be well-documented, easy to understand and extremely trustworthy.\n\n**SATurne** is progressively integrated as the SAT solver behind the [Modulus](https://github.com/jdrprod/Modulus) SMT solver.\n\n## Few words on SATurn design\n\nAt it's core, **SATurne** is a ridiculously simple solver very similar to the one described in\n[this article](https://web.archive.org/web/20201109101535/http://www.cse.chalmers.se/~algehed/blogpostsHTML/SAT.html).\n\n## Features\n\n**SATurne** is not only a solver. It is also a collection of Coq theories formalizing the boolean logic and the associated proof systems (e.g. the resolution system).\n\n**SATurne** is shipped with a proof checker to check proofs of unsatisfiability based on the resolution system. This checker is proven to be correct and can be extracted to a self contained OCaml module.\n\nSince SATurne solve only formulas in clausal form, it also features a verified CNF converter.\n\n## Coq Sources\n\nThe sources are located in the `src` folder. A `_CoqProject` and a makefile are provided. Simply type `make` at the project root SATurne is ready to be loaded in your favorite Coq editor.\n\n### Structure/TODOs\n\n```\nsrc/\n  Clauses.v     -\u003e Theories of literals, clauses and set of clauses\n  Cnf.v         -\u003e conversion into cnf\n  Proof.v       -\u003e proof checker\n  Evaluation.v  -\u003e (old) models in boolean logic\n  Sat.v         -\u003e (old) facts about satisfiability\n  Solver_aux.v  -\u003e (old) useful facts used to prove the solver\n  Solver.v      -\u003e (old) verified solver\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Facorrenson%2Fsaturne","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Facorrenson%2Fsaturne","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Facorrenson%2Fsaturne/lists"}