{"id":16138272,"url":"https://github.com/uben0/prove","last_synced_at":"2025-04-06T17:24:53.798Z","repository":{"id":218986980,"uuid":"707358654","full_name":"uben0/prove","owner":"uben0","description":"A formal proof system in the terminal","archived":false,"fork":false,"pushed_at":"2024-01-24T20:12:46.000Z","size":36,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-12T23:31:27.942Z","etag":null,"topics":["formal-proofs","rust-lang"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/uben0.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2023-10-19T18:22:15.000Z","updated_at":"2024-01-24T20:15:14.000Z","dependencies_parsed_at":null,"dependency_job_id":"090b0c45-c1db-419b-9e88-e7f0e3c3b3cc","html_url":"https://github.com/uben0/prove","commit_stats":null,"previous_names":["uben0/prove"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/uben0%2Fprove","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/uben0%2Fprove/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/uben0%2Fprove/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/uben0%2Fprove/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/uben0","download_url":"https://codeload.github.com/uben0/prove/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247519596,"owners_count":20952020,"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":["formal-proofs","rust-lang"],"created_at":"2024-10-09T23:33:25.702Z","updated_at":"2025-04-06T17:24:53.781Z","avatar_url":"https://github.com/uben0.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# A formal proof assistant for first order logic in the terminal\n\n```\n                                                ──────────────h\n                                                ~(P∨~P), P ⊢ P\n                      ────────────────────h    ─────────────────∨i,l\n                      ~(P∨~P), P ⊢ ~(P∨~P)     ~(P∨~P), P ⊢ P∨~P\n                      ──────────────────────────────────────────mp\n                                    ~(P∨~P), P ⊢ ⊥\n                                    ──────────────➔i\n                                     ~(P∨~P) ⊢ ~P\n─────────────────h                  ──────────────∨i,r\n~(P∨~P) ⊢ ~(P∨~P)                   ~(P∨~P) ⊢ P∨~P\n──────────────────────────────────────────────────mp\n                    ~(P∨~P) ⊢ ⊥\n                    ───────────➔i\n                    ⊢ ~~(P∨~P)\n```\n\nThis is a read-eval-print-loop to prove a formula in first order logic.\n\nIt reads the formulas from the `sequents.txt` file, one by line. It uses a custom notation to write formulas. For instance:\n\n```\nP \\/ Q -\u003e ~P -\u003e Q\n```\n\nWhich is a succinct notation for the more verbose s-expression:\n\n```\n(imply (and \"P\" \"Q\") (imply (not \"P\") \"Q\"))\n```\n\nIn the REPL, the following commands are accepted.\n\n```\nCOMMANDS:\n  :b            back one step, undo the last action\n  :r            reset all steps, undo all actions\n  :h            print this help message\n  :q            quit the program\n\nAPPLICABLE RULES:\n  h             hypothesis\n  i             introduction of the conclusion (automatic: it choses introduction rule base on conclusion type)\n  xf            exflaso\n  e \u003cN\u003e         elimination of the Nth hypothesis (automatic: it choses elimination rule base on hypothesis type)\n  ii            implication introduction\n  iis           implications introduction (for chaining implications)\n  dil           disjonction introduction left\n  dir           disjonction introduction right\n  mp \u003cF\u003e        modus ponens on F (a logical property formula like: ~P/\\Q)\n  de \u003cF\u003e, \u003cF\u003e   disjonction elimination of left formula and right formula\n  ce \u003cF\u003e, \u003cF\u003e   conjonction elimination of left formula and right formula\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fuben0%2Fprove","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fuben0%2Fprove","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fuben0%2Fprove/lists"}