cdclkit 0.1.0__tar.gz

cdclkit-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.

cdclkit-0.1.0/PKG-INFO

@@ -0,0 +1,136 @@
+Metadata-Version: 2.4
+Name: cdclkit
+Version: 0.1.0
+Summary: A CDCL SAT solver, preprocessor, encoding library and modelling layer, written from scratch in readable Python. Every answer comes with a certificate.
+Author: Carlo Perassi
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/carlok/cdclkit
+Project-URL: Source, https://github.com/carlok/cdclkit
+Project-URL: Proof checker, https://github.com/carlok/dratify
+Keywords: sat,solver,cdcl,dpll,drat,constraint,smt
+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
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: dratify>=0.1.1
+Dynamic: license-file
+
+# cdclkit
+
+**A conflict-driven clause-learning SAT solver, a preprocessor, an encoding
+library and a modelling layer — written from scratch in readable Python.**
+
+Every answer comes with a certificate, and the certificate gets checked.
+
+```bash
+pip install cdclkit
+```
+
+```bash
+python3 -m cdclkit solve instance.cnf --self-check --check-model
+```
+
+- **SAT** → the model is re-evaluated against the input formula, clause by clause.
+- **UNSAT** → the solver emits a DRAT proof and [`dratify`](https://github.com/carlok/dratify)
+  replays it, confirming every derived clause really follows and the empty
+  clause is reached.
+
+A solver that says "unsatisfiable" and offers nothing else is asking to be
+trusted. This one hands you the proof — and the checker that reads it shares no
+code with the solver that wrote it.
+
+## Quick start
+
+```python
+from cdclkit import parse_dimacs, solve
+
+formula = parse_dimacs("p cnf 2 4\n1 2 0\n1 -2 0\n-1 2 0\n-1 -2 0\n")
+sat, model = solve(formula)
+print(sat)          # False -- and `solve` returns (False, None)
+```
+
+Note the shape: `solve()` returns a **tuple**, so `if solve(f):` is always
+true. Unpack it.
+
+Worked examples live in `examples/` — Sudoku with a uniqueness proof, the zebra
+puzzle, graph colouring, bounded model checking, circuit equivalence.
+
+## What's in it
+
+| module | what it does |
+|---|---|
+| `solver` | CDCL: two watched literals, first-UIP learning, LBD, Luby restarts, phase saving, target phases, probSAT rephasing |
+| `preprocess` | subsumption, self-subsumption, blocked-clause elimination, pure literals, bounded variable elimination with model reconstruction |
+| `encodings` | at-most-one (pairwise, binary, commander), cardinality (sequential, totalizer), pseudo-Boolean |
+| `model` | a modelling layer — integer variables, all-different, differential encoding |
+| `mus` | minimal unsatisfiable subsets, deletion-based and QuickXplain |
+| `portfolio` | parallel configurations |
+| `pyeq` | **experimental** — bounded equivalence of two Python integer functions |
+
+An optional Rust engine (built from source with `make native` -- it is not
+on PyPI yet) is roughly 18x faster
+and **bit-exact** with the Python one: identical conflicts, decisions and
+propagations on every instance. The pure-Python path has zero third-party
+dependencies and is the one that must never break.
+
+## Relationship to dratify
+
+Proof checking lives in a separate package, [`dratify`](https://github.com/carlok/dratify),
+which `cdclkit` depends on. That split is deliberate:
+
+- You should not have to install a SAT solver to verify a proof someone else
+  produced.
+- The checker stays small enough to audit, which is the point of a checker.
+- `cdclkit` exercises it on every test run, so the checker is dogfooded by the
+  solver rather than only by its own suite.
+
+`dratify` has no dependencies of its own, so installing `cdclkit` pulls in no
+third-party code.
+
+## Performance
+
+See [BENCHMARKS.md](BENCHMARKS.md). Read the caveats there before quoting any
+number — in particular, all figures come from a single machine, and the
+comparison against `kissat` is against its default configuration on a public
+benchmark suite whose instances are small enough that process startup is part
+of what is being measured.
+
+If you need raw speed, install [PySAT](https://pypi.org/project/python-sat/):
+it ships kissat, CaDiCaL and Glucose as binary wheels on every platform. This
+project is not trying to beat them. It is trying to be a complete, readable,
+self-checking implementation you can audit.
+
+## Honest limitations
+
+- **No Windows.** Never tested; the classifiers say so rather than implying support.
+- Pure Python is ~18x slower than its own Rust port, which is itself far from
+  kissat. Not a tool for competition-scale instances.
+- No inprocessing, no XOR/Gaussian reasoning. Parity families are a known
+  weakness and `bench/` includes one to keep that visible.
+- `pyeq` models a small subset of Python and is **experimental**. Measured
+  against CrossHair on a 48-function corpus it found nothing CrossHair missed
+  (0 of 105). See `experiments/pyeq-llm-refactor/report.md` for the full
+  negative result.
+- Every performance figure comes from one machine.
+
+## Documentation
+
+- [docs/ALGORITHMS.md](docs/ALGORITHMS.md) — the mathematics, from resolution
+  through first-UIP, LBD, DRAT, encodings and preprocessing, including a
+  section on what is deliberately absent.
+- [docs/ROADMAP.md](docs/ROADMAP.md) — what is planned, in sprints.
+- [docs/RELEASING.md](docs/RELEASING.md) — the release checklist.
+
+## Licence
+
+Apache-2.0. See [LICENSE](LICENSE).

cdclkit-0.1.0/README.md

@@ -0,0 +1,109 @@
+# cdclkit
+
+**A conflict-driven clause-learning SAT solver, a preprocessor, an encoding
+library and a modelling layer — written from scratch in readable Python.**
+
+Every answer comes with a certificate, and the certificate gets checked.
+
+```bash
+pip install cdclkit
+```
+
+```bash
+python3 -m cdclkit solve instance.cnf --self-check --check-model
+```
+
+- **SAT** → the model is re-evaluated against the input formula, clause by clause.
+- **UNSAT** → the solver emits a DRAT proof and [`dratify`](https://github.com/carlok/dratify)
+  replays it, confirming every derived clause really follows and the empty
+  clause is reached.
+
+A solver that says "unsatisfiable" and offers nothing else is asking to be
+trusted. This one hands you the proof — and the checker that reads it shares no
+code with the solver that wrote it.
+
+## Quick start
+
+```python
+from cdclkit import parse_dimacs, solve
+
+formula = parse_dimacs("p cnf 2 4\n1 2 0\n1 -2 0\n-1 2 0\n-1 -2 0\n")
+sat, model = solve(formula)
+print(sat)          # False -- and `solve` returns (False, None)
+```
+
+Note the shape: `solve()` returns a **tuple**, so `if solve(f):` is always
+true. Unpack it.
+
+Worked examples live in `examples/` — Sudoku with a uniqueness proof, the zebra
+puzzle, graph colouring, bounded model checking, circuit equivalence.
+
+## What's in it
+
+| module | what it does |
+|---|---|
+| `solver` | CDCL: two watched literals, first-UIP learning, LBD, Luby restarts, phase saving, target phases, probSAT rephasing |
+| `preprocess` | subsumption, self-subsumption, blocked-clause elimination, pure literals, bounded variable elimination with model reconstruction |
+| `encodings` | at-most-one (pairwise, binary, commander), cardinality (sequential, totalizer), pseudo-Boolean |
+| `model` | a modelling layer — integer variables, all-different, differential encoding |
+| `mus` | minimal unsatisfiable subsets, deletion-based and QuickXplain |
+| `portfolio` | parallel configurations |
+| `pyeq` | **experimental** — bounded equivalence of two Python integer functions |
+
+An optional Rust engine (built from source with `make native` -- it is not
+on PyPI yet) is roughly 18x faster
+and **bit-exact** with the Python one: identical conflicts, decisions and
+propagations on every instance. The pure-Python path has zero third-party
+dependencies and is the one that must never break.
+
+## Relationship to dratify
+
+Proof checking lives in a separate package, [`dratify`](https://github.com/carlok/dratify),
+which `cdclkit` depends on. That split is deliberate:
+
+- You should not have to install a SAT solver to verify a proof someone else
+  produced.
+- The checker stays small enough to audit, which is the point of a checker.
+- `cdclkit` exercises it on every test run, so the checker is dogfooded by the
+  solver rather than only by its own suite.
+
+`dratify` has no dependencies of its own, so installing `cdclkit` pulls in no
+third-party code.
+
+## Performance
+
+See [BENCHMARKS.md](BENCHMARKS.md). Read the caveats there before quoting any
+number — in particular, all figures come from a single machine, and the
+comparison against `kissat` is against its default configuration on a public
+benchmark suite whose instances are small enough that process startup is part
+of what is being measured.
+
+If you need raw speed, install [PySAT](https://pypi.org/project/python-sat/):
+it ships kissat, CaDiCaL and Glucose as binary wheels on every platform. This
+project is not trying to beat them. It is trying to be a complete, readable,
+self-checking implementation you can audit.
+
+## Honest limitations
+
+- **No Windows.** Never tested; the classifiers say so rather than implying support.
+- Pure Python is ~18x slower than its own Rust port, which is itself far from
+  kissat. Not a tool for competition-scale instances.
+- No inprocessing, no XOR/Gaussian reasoning. Parity families are a known
+  weakness and `bench/` includes one to keep that visible.
+- `pyeq` models a small subset of Python and is **experimental**. Measured
+  against CrossHair on a 48-function corpus it found nothing CrossHair missed
+  (0 of 105). See `experiments/pyeq-llm-refactor/report.md` for the full
+  negative result.
+- Every performance figure comes from one machine.
+
+## Documentation
+
+- [docs/ALGORITHMS.md](docs/ALGORITHMS.md) — the mathematics, from resolution
+  through first-UIP, LBD, DRAT, encodings and preprocessing, including a
+  section on what is deliberately absent.
+- [docs/ROADMAP.md](docs/ROADMAP.md) — what is planned, in sprints.
+- [docs/RELEASING.md](docs/RELEASING.md) — the release checklist.
+
+## Licence
+
+Apache-2.0. See [LICENSE](LICENSE).

cdclkit-0.1.0/cdclkit/__init__.py

@@ -0,0 +1,152 @@
+# SPDX-License-Identifier: Apache-2.0
+# Copyright (c) 2026 Carlo Perassi. Licensed under the Apache License 2.0.
+"""cdclkit -- a CDCL SAT solving toolkit with checkable proofs, in pure Python.
+
+Everything here is written from scratch against the standard library only.
+The public surface:
+
+    from cdclkit import Solver, CNF, Encoder, solve
+
+    f = CNF()
+    a, b, c = f.new_var(), f.new_var(), f.new_var()
+    f.add([lit(a), lit(b)])          # a v b
+    f.add([lit(a, True), lit(c)])    # ~a v c
+    status, model = solve(f)
+
+Modules:
+
+``lits``        literal encoding and three-valued logic
+``cnf``         clause/formula containers and DIMACS I/O
+``heap``        indexed activity heap for VSIDS
+``solver``      the CDCL core
+``proof``       DRAT emission and an independent DRAT checker
+``preprocess``  subsumption, strengthening, variable elimination
+``mus``         minimal unsatisfiable subsets (deletion, QuickXplain)
+``encodings``   Tseitin, cardinality, pseudo-boolean, totalizer, optimisation
+``model``       a small typed modelling layer over the encoder
+``pyeq``        prove two Python functions equivalent, or find an input where
+                they are not
+``brute``       reference solvers used to cross-check everything else
+``cli``         the ``python -m cdclkit`` command line
+
+Public API
+----------
+Everything in ``__all__`` below is public and follows semantic versioning: it
+will not change incompatibly without a major version bump, and anything due to
+be removed gets a ``DeprecationWarning`` for one minor release first.
+
+Everything else is internal, including ``cdclkit.pipeline``, ``cdclkit.portfolio``
+and ``cdclkit.native``. They are importable because Python has no way to stop
+you, not because they are stable. If you need something from them, say so and
+it can be promoted -- that is a smaller problem than finding out from a broken
+build that someone depended on it.
+"""
+
+from __future__ import annotations
+
+from dratify.cnf import CNF, Clause, parse_dimacs, parse_dimacs_file, write_dimacs
+from .encodings import Encoder, Totalizer, optimise
+from dratify.lits import from_dimacs, mk_lit, neg, to_dimacs
+from .mus import MUSExtractor, mus
+from .preprocess import Preprocessor, preprocess
+from dratify.proof import DRATChecker, MemoryProof, ProofWriter, check_proof
+from .solver import Config, SAT, Solver, Stats, UNKNOWN, UNSAT
+
+__version__ = "0.1.0"
+
+__all__ = [
+    "CNF",
+    "Clause",
+    "Config",
+    "DRATChecker",
+    "Encoder",
+    "EncodingDisagreement",
+    "EquivalenceResult",
+    "MUSExtractor",
+    "MemoryProof",
+    "Preprocessor",
+    "ProofRejected",
+    "ProofWriter",
+    "SAT",
+    "UNKNOWN",
+    "UNSAT",
+    "Solver",
+    "Stats",
+    "Totalizer",
+    "UnsupportedConstruct",
+    "check_proof",
+    "differential_solve",
+    "equivalent",
+    "from_dimacs",
+    "lit",
+    "mk_lit",
+    "mus",
+    "neg",
+    "optimise",
+    "parse_dimacs",
+    "parse_dimacs_file",
+    "preprocess",
+    "solve",
+    "to_dimacs",
+    "write_dimacs",
+    "__version__",
+]
+
+
+#: Public names that live in `cdclkit.pyeq`, resolved on first access rather than
+#: at import. `pyeq` needs `inspect` to read a function's source, and `inspect`
+#: drags in `re` and `functools`: importing it eagerly was 5.5 ms of an 8.8 ms
+#: `import cdclkit`, paid by everyone including the CLI solving a DIMACS file.
+#: Startup is not a rounding error here -- the benchmark harness discards
+#: instances a competitor finishes in under 50 ms because process startup
+#: dominates them.
+_LAZY = {
+    "equivalent": "pyeq",
+    "EquivalenceResult": "pyeq",
+    "differential_solve": "model",
+    "EncodingDisagreement": "model",
+    "UnsupportedConstruct": "pyeq",
+    "ProofRejected": "pyeq",
+}
+
+
+# Imported eagerly, not lazily: importing it is what registers the native
+# checker with `dratify`, and a checker that is present but unregistered would
+# silently cost ~18x on proof checking. The import is a single guarded attempt
+# at a compiled module and costs nothing when it is absent.
+from . import native as _native_loader  # noqa: F401,E402
+
+
+def __getattr__(name: str):
+    """PEP 562 lazy attribute access for the heavier public names."""
+    mod = _LAZY.get(name)
+    if mod is None:
+        raise AttributeError(f"module {__name__!r} has no attribute {name!r}")
+    import importlib
+
+    value = getattr(importlib.import_module(f".{mod}", __name__), name)
+    globals()[name] = value  # resolve once; subsequent lookups skip __getattr__
+    return value
+
+
+def __dir__() -> list[str]:
+    return sorted(__all__)
+
+
+def lit(var: int, negated: bool = False) -> int:
+    """Alias for :func:`cdclkit.lits.mk_lit`, the common spelling in user code."""
+    return mk_lit(var, negated)
+
+
+def solve(formula: CNF, proof=None, config: Config | None = None):
+    """Solve a formula in one call.
+
+    Returns ``(True, model)`` or ``(False, None)``.  ``model`` is a list of
+    booleans indexed by variable.
+    """
+    s = Solver(formula.nvars, proof=proof, config=config)
+    if not s.add_cnf(formula):
+        return False, None
+    if s.solve():
+        return True, s.model
+    return False, None

cdclkit-0.1.0/cdclkit/__main__.py

@@ -0,0 +1,10 @@
+# SPDX-License-Identifier: Apache-2.0
+# Copyright (c) 2026 Carlo Perassi. Licensed under the Apache License 2.0.
+"""Entry point for ``python -m cdclkit``."""
+
+import sys
+
+from .cli import main
+
+if __name__ == "__main__":
+    sys.exit(main())