{"id":16443095,"url":"https://github.com/martingms/ersatz","last_synced_at":"2026-01-03T00:52:30.566Z","repository":{"id":139188324,"uuid":"181932318","full_name":"martingms/ersatz","owner":"martingms","description":"A simple, small, work in progress SAT-solver, written in ANSI C","archived":false,"fork":false,"pushed_at":"2024-02-02T14:52:12.000Z","size":2237,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-23T06:51:11.512Z","etag":null,"topics":["c","sat","sat-solver"],"latest_commit_sha":null,"homepage":"","language":"C","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/martingms.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":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-04-17T16:47:19.000Z","updated_at":"2024-02-14T08:49:44.000Z","dependencies_parsed_at":"2024-02-02T15:56:45.755Z","dependency_job_id":null,"html_url":"https://github.com/martingms/ersatz","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/martingms%2Fersatz","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/martingms%2Fersatz/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/martingms%2Fersatz/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/martingms%2Fersatz/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/martingms","download_url":"https://codeload.github.com/martingms/ersatz/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243926016,"owners_count":20369914,"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":["c","sat","sat-solver"],"created_at":"2024-10-11T09:19:26.823Z","updated_at":"2026-01-03T00:52:30.522Z","avatar_url":"https://github.com/martingms.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ersatz\n\nA simple, small, work in progress SAT-solver, written in ANSI C.\n\nMost of the design is based on the\n[MiniSat](http://minisat.se)-[paper](http://minisat.se/downloads/MiniSat.pdf).\n\n## Build\n\n    $ make\n\n## Test\n\nRequires `prove`. See the `Makefile` for an alternative.\n\n    $ make test\n\n## Run\n\n    # To solve a SAT instance\n    $ ./ersatz formula.cnf\n\n    # To verify a model\n    $ ./ersatz -V model.cnf formula.cnf\n\n## Stuff missing\n\n* Watched literals\n* Clause learning\n* Branching heuristics\n* More documentation\n* ...\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmartingms%2Fersatz","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmartingms%2Fersatz","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmartingms%2Fersatz/lists"}