dratify 0.1.0__tar.gz

dratify-0.1.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

dratify-0.1.0/PKG-INFO

@@ -0,0 +1,136 @@
+Metadata-Version: 2.4
+Name: dratify
+Version: 0.1.0
+Summary: Check DRAT/DRUP proofs of unsatisfiability inside your Python process. Zero dependencies, optional Rust accelerator.
+Author: Carlo Perassi
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/carlok/dratify
+Project-URL: Source, https://github.com/carlok/dratify
+Keywords: sat,drat,drup,proof,checker,unsatisfiability,rup,rat
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Science/Research
+Classifier: Intended Audience :: Developers
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Programming Language :: Rust
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Classifier: Topic :: Software Development :: Testing
+Classifier: Operating System :: POSIX :: Linux
+Classifier: Operating System :: MacOS
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# dratify
+
+**Check a DRAT/DRUP proof of unsatisfiability, inside your Python process.**
+
+A SAT solver that answers "unsatisfiable" is asking to be trusted. A DRAT proof
+is how it stops asking: the solver logs every clause it derives, and a checker
+that shares no code with it replays the log and confirms the empty clause
+really follows.
+
+Emitting those proofs is routine. PySAT exposes them from six solver families
+with `with_proof=True` / `get_proof()`. *Checking* them from Python has not
+been practical: `drat-trim` is C you compile and shell out to, and the only
+checker on PyPI installs on Linux x86-64 under Python ≤ 3.10 alone.
+
+```bash
+pip install dratify              # pure Python, zero dependencies
+```
+
+A Rust implementation of the same checker is published separately as the
+[`dratify` crate](https://crates.io/crates/dratify). Python bindings for it are
+not packaged yet; `engine="native"` is wired up and will pick them up when they
+are.
+
+## Check a proof from PySAT
+
+```python
+from pysat.formula import CNF as PyCNF
+from pysat.solvers import Glucose42
+from dratify import parse_dimacs, check_proof
+
+cnf = PyCNF(from_file="problem.cnf")
+with Glucose42(bootstrap_with=cnf, with_proof=True) as s:
+    assert not s.solve()
+    proof = s.get_proof()
+
+result = check_proof(parse_dimacs(cnf.to_dimacs()), "\n".join(proof))
+print(result.ok)          # True -- the refutation is genuine
+```
+
+No subprocess, no compiler, no temporary files.
+
+## Two engines, and that is the point
+
+Proof checking is the one domain where two independent implementations agreeing
+*is* the evidence. This ships both:
+
+| | |
+|---|---|
+| **Pure Python** | zero dependencies, runs anywhere Python does |
+| **Rust** (crates.io) | ~18x faster; Python bindings not yet packaged |
+
+Neither is the "real" one. They have been differentially tested against each
+other on acceptances *and* on rejections, and they agree.
+
+```python
+check_proof(formula, proof, engine="python")   # always available
+check_proof(formula, proof, engine="native")   # when bindings are installed
+check_proof(formula, proof, engine="auto")     # default: native when present
+```
+
+## What it checks
+
+- **RUP** (reverse unit propagation) — the common case.
+- **RAT** (resolution asymmetric tautology) — the "A" in DRAT, checked properly:
+  pivot on the first literal, resolvent against every clause containing its
+  negation, RUP on each.
+- **Deletion**, applied by default. Deletion is monotone-safe for RUP; RAT is
+  not monotone, so RAT steps are checked against exactly the clauses present.
+
+Checking is **forward**: every step is verified, rather than working backwards
+from the empty clause as `drat-trim` does. That makes it slower on large proofs
+and means a corrupted step is caught where it occurs.
+
+## Speed
+
+Measured against `drat-trim` (which does backward checking by default):
+
+| proof | steps | pure Python | Rust | drat-trim |
+|---|---|---|---|---|
+| uuf100-01 | 774 | 0.01s | 0.01s | 0.05s |
+| uuf100-010 | 1,103 | 0.05s | 0.00s | 0.06s |
+| uuf250-01 | 209,367 | 41.47s | 2.27s | 1.30s |
+
+Rust wins on small proofs — `drat-trim` pays process startup and cannot be
+called in-process — and loses 1.75x on the large one, while checking forward.
+
+On 10 proofs from two solvers, `dratify` and `drat-trim` agreed on every case,
+including four rejections.
+
+## Honest limitations
+
+- Forward checking only. Backward checking would close the large-proof gap.
+- No binary DRAT format yet; text proofs only.
+- Not formally verified. It is carefully written, differentially tested against
+  a second implementation, and cross-validated against `drat-trim` — which is
+  not the same thing as a machine-checked proof of the checker itself. If you
+  need that, `cake_lpr` is CakeML-verified and consumes LRAT.
+
+## Related
+
+[`cdclkit`](https://github.com/carlok/cdclkit) is a from-scratch CDCL SAT
+solver by the same author that uses this package to check its own refutations.
+You do not need it to use `dratify` — checking a proof should never require
+installing a solver, which is why these are separate packages.
+
+## Licence
+
+Apache-2.0. See [LICENSE](LICENSE).

dratify-0.1.0/README.md

@@ -0,0 +1,108 @@
+# dratify
+
+**Check a DRAT/DRUP proof of unsatisfiability, inside your Python process.**
+
+A SAT solver that answers "unsatisfiable" is asking to be trusted. A DRAT proof
+is how it stops asking: the solver logs every clause it derives, and a checker
+that shares no code with it replays the log and confirms the empty clause
+really follows.
+
+Emitting those proofs is routine. PySAT exposes them from six solver families
+with `with_proof=True` / `get_proof()`. *Checking* them from Python has not
+been practical: `drat-trim` is C you compile and shell out to, and the only
+checker on PyPI installs on Linux x86-64 under Python ≤ 3.10 alone.
+
+```bash
+pip install dratify              # pure Python, zero dependencies
+```
+
+A Rust implementation of the same checker is published separately as the
+[`dratify` crate](https://crates.io/crates/dratify). Python bindings for it are
+not packaged yet; `engine="native"` is wired up and will pick them up when they
+are.
+
+## Check a proof from PySAT
+
+```python
+from pysat.formula import CNF as PyCNF
+from pysat.solvers import Glucose42
+from dratify import parse_dimacs, check_proof
+
+cnf = PyCNF(from_file="problem.cnf")
+with Glucose42(bootstrap_with=cnf, with_proof=True) as s:
+    assert not s.solve()
+    proof = s.get_proof()
+
+result = check_proof(parse_dimacs(cnf.to_dimacs()), "\n".join(proof))
+print(result.ok)          # True -- the refutation is genuine
+```
+
+No subprocess, no compiler, no temporary files.
+
+## Two engines, and that is the point
+
+Proof checking is the one domain where two independent implementations agreeing
+*is* the evidence. This ships both:
+
+| | |
+|---|---|
+| **Pure Python** | zero dependencies, runs anywhere Python does |
+| **Rust** (crates.io) | ~18x faster; Python bindings not yet packaged |
+
+Neither is the "real" one. They have been differentially tested against each
+other on acceptances *and* on rejections, and they agree.
+
+```python
+check_proof(formula, proof, engine="python")   # always available
+check_proof(formula, proof, engine="native")   # when bindings are installed
+check_proof(formula, proof, engine="auto")     # default: native when present
+```
+
+## What it checks
+
+- **RUP** (reverse unit propagation) — the common case.
+- **RAT** (resolution asymmetric tautology) — the "A" in DRAT, checked properly:
+  pivot on the first literal, resolvent against every clause containing its
+  negation, RUP on each.
+- **Deletion**, applied by default. Deletion is monotone-safe for RUP; RAT is
+  not monotone, so RAT steps are checked against exactly the clauses present.
+
+Checking is **forward**: every step is verified, rather than working backwards
+from the empty clause as `drat-trim` does. That makes it slower on large proofs
+and means a corrupted step is caught where it occurs.
+
+## Speed
+
+Measured against `drat-trim` (which does backward checking by default):
+
+| proof | steps | pure Python | Rust | drat-trim |
+|---|---|---|---|---|
+| uuf100-01 | 774 | 0.01s | 0.01s | 0.05s |
+| uuf100-010 | 1,103 | 0.05s | 0.00s | 0.06s |
+| uuf250-01 | 209,367 | 41.47s | 2.27s | 1.30s |
+
+Rust wins on small proofs — `drat-trim` pays process startup and cannot be
+called in-process — and loses 1.75x on the large one, while checking forward.
+
+On 10 proofs from two solvers, `dratify` and `drat-trim` agreed on every case,
+including four rejections.
+
+## Honest limitations
+
+- Forward checking only. Backward checking would close the large-proof gap.
+- No binary DRAT format yet; text proofs only.
+- Not formally verified. It is carefully written, differentially tested against
+  a second implementation, and cross-validated against `drat-trim` — which is
+  not the same thing as a machine-checked proof of the checker itself. If you
+  need that, `cake_lpr` is CakeML-verified and consumes LRAT.
+
+## Related
+
+[`cdclkit`](https://github.com/carlok/cdclkit) is a from-scratch CDCL SAT
+solver by the same author that uses this package to check its own refutations.
+You do not need it to use `dratify` — checking a proof should never require
+installing a solver, which is why these are separate packages.
+
+## Licence
+
+Apache-2.0. See [LICENSE](LICENSE).

dratify-0.1.0/pyproject.toml

@@ -0,0 +1,38 @@
+[build-system]
+requires = ["setuptools>=68"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "dratify"
+version = "0.1.0"
+description = "Check DRAT/DRUP proofs of unsatisfiability inside your Python process. Zero dependencies, optional Rust accelerator."
+readme = "README.md"
+requires-python = ">=3.10"
+license = "Apache-2.0"
+license-files = ["LICENSE"]
+authors = [{ name = "Carlo Perassi" }]
+keywords = ["sat", "drat", "drup", "proof", "checker", "unsatisfiability", "rup", "rat"]
+classifiers = [
+    "Development Status :: 4 - Beta",
+    "Intended Audience :: Science/Research",
+    "Intended Audience :: Developers",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
+    "Programming Language :: Python :: 3.14",
+    "Programming Language :: Rust",
+    "Topic :: Scientific/Engineering :: Mathematics",
+    "Topic :: Software Development :: Testing",
+    "Operating System :: POSIX :: Linux",
+    "Operating System :: MacOS",
+]
+dependencies = []
+
+[project.urls]
+Homepage = "https://github.com/carlok/dratify"
+Source = "https://github.com/carlok/dratify"
+
+[tool.setuptools.packages.find]
+where = ["src"]

dratify-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

dratify-0.1.0/src/dratify/__init__.py

@@ -0,0 +1,68 @@
+# SPDX-License-Identifier: Apache-2.0
+"""Check a DRAT/DRUP proof of unsatisfiability, inside your Python process.
+
+A SAT solver that answers "unsatisfiable" is asking to be trusted. A DRAT proof
+is how it stops asking: the solver logs every clause it derives, and a checker
+that shares no code with it replays the log and confirms the empty clause
+really follows.
+
+Emitting those proofs is common -- PySAT exposes them from six solver families
+via ``with_proof=True`` / ``get_proof()``. *Checking* them from Python has not
+been possible: ``drat-trim`` is C you have to compile and shell out to, and the
+one checker on PyPI installs only on Linux x86-64 under Python <= 3.10.
+
+    >>> from dratify import parse_dimacs, check_proof
+    >>> formula = parse_dimacs(open("problem.cnf").read())
+    >>> result = check_proof(formula, open("proof.drat").read())
+    >>> result.ok
+    True
+
+Two engines, and that is the point
+----------------------------------
+The pure-Python checker has zero dependencies and runs anywhere Python does.
+The optional Rust accelerator (``pip install dratify[native]``) is roughly 18x
+faster. Neither is the "real" one: proof checking is the one domain where two
+independent implementations agreeing *is* the evidence, and these two have been
+differentially tested against each other, on acceptances and on rejections.
+
+Pass ``engine="python"``, ``engine="native"``, or ``engine="auto"`` (the
+default: native when installed).
+
+RUP and RAT are both checked. Checking is forward -- every step is verified,
+rather than working backwards from the empty clause.
+"""
+
+from __future__ import annotations
+
+from .cnf import CNF
+from .lits import from_dimacs, to_dimacs
+from .proof import (
+    DRATChecker,
+    MemoryProof,
+    ProofWriter,
+    check_proof,
+)
+from .cnf import parse_dimacs, parse_dimacs_file, write_dimacs
+from . import _nativeinfo
+
+__version__ = "0.1.0"
+
+__all__ = [
+    "CNF",
+    "DRATChecker",
+    "MemoryProof",
+    "ProofWriter",
+    "check_proof",
+    "parse_dimacs",
+    "parse_dimacs_file",
+    "write_dimacs",
+    "from_dimacs",
+    "to_dimacs",
+    "native_available",
+    "__version__",
+]
+
+
+def native_available() -> bool:
+    """True when the optional Rust checker is installed."""
+    return _nativeinfo.available()

dratify-0.1.0/src/dratify/_nativeinfo.py

@@ -0,0 +1,21 @@
+# SPDX-License-Identifier: Apache-2.0
+"""Availability of the optional Rust checker."""
+
+from __future__ import annotations
+
+BUILD_HINT = (
+    "engine='native' was requested but the Rust checker is not installed. "
+    "The Rust accelerator is not yet published as a Python wheel; use "
+    "engine='python' or engine='auto' "
+    "(the pure-Python checker is complete and is never going away -- it is "
+    "the independent implementation that makes agreement meaningful)."
+)
+
+
+def available() -> bool:
+    """True when the Rust checker can be imported."""
+    try:
+        import sable_native
+    except ImportError:
+        return False
+    return hasattr(sable_native, "check_proof")