chiasmus 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 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.

package/README.md

@@ -0,0 +1,124 @@
+# Chiasmus
+
+MCP server that gives LLMs access to formal verification via Z3 (SMT solver) and Tau Prolog. Translates natural language problems into formal logic using a template-based pipeline, verifies results with mathematical certainty.
+
+## Setup
+
+```bash
+npm install -g chiasmus
+```
+
+### Claude Code
+
+```bash
+claude mcp add chiasmus -- npx chiasmus
+```
+
+Or add to `~/.claude/settings.json`:
+
+```json
+{
+  "mcpServers": {
+    "chiasmus": {
+      "command": "npx",
+      "args": ["chiasmus"]
+    }
+  }
+}
+```
+
+### Crush
+
+Add to `crush.json`:
+
+```json
+{
+  "mcp": {
+    "chiasmus": {
+      "type": "stdio",
+      "command": "npx",
+      "args": ["chiasmus"]
+    }
+  }
+}
+```
+
+### OpenCode
+
+Add to `opencode.json`:
+
+```json
+{
+  "mcp": {
+    "chiasmus": {
+      "type": "local",
+      "command": ["npx", "chiasmus"]
+    }
+  }
+}
+```
+
+## Tools
+
+**`chiasmus_verify`** — Submit raw SMT-LIB or Prolog, get a verified result.
+
+```
+chiasmus_verify solver="z3" input="
+  (declare-const x Int)
+  (declare-const y Int)
+  (assert (= (+ x y) 10))
+  (assert (> x 0))
+  (assert (> y 0))
+"
+→ { status: "sat", model: { x: "7", y: "3" } }
+```
+
+```
+chiasmus_verify solver="prolog"
+  input="parent(tom, bob). parent(bob, ann). ancestor(X,Y) :- parent(X,Y). ancestor(X,Y) :- parent(X,Z), ancestor(Z,Y)."
+  query="ancestor(tom, Who)."
+→ { status: "success", answers: [{ bindings: { Who: "bob" } }, { bindings: { Who: "ann" } }] }
+```
+
+**`chiasmus_skills`** — Search the template library. Ships with 8 starter templates covering authorization, configuration, dependency resolution, validation, rule inference, and graph reachability.
+
+**`chiasmus_formalize`** — Find the best template for a problem, get slot-filling instructions. Fill the slots using your context, then call `chiasmus_verify`.
+
+**`chiasmus_solve`** — End-to-end: selects template, fills slots via LLM, runs lint and correction loops, returns a verified result. Optional — the same result is achieved by using `chiasmus_formalize` → fill slots → `chiasmus_verify`, which is the recommended workflow since the calling LLM has full conversation context.
+
+**`chiasmus_learn`** — Extract a reusable template from a verified solution. Candidates get promoted after 3+ successful reuses.
+
+## Recommended Workflow
+
+The calling LLM (Claude, GPT, etc.) drives the process — no API key needed:
+
+1. `chiasmus_formalize problem="Can our RBAC rules ever conflict?"` → get template + slot instructions
+2. Fill the template slots using your knowledge of the user's codebase
+3. `chiasmus_verify solver="z3" input="(filled spec)"` → get verified result
+4. If error → read the error, fix the spec, call `chiasmus_verify` again
+
+## When to Use
+
+Use a solver when the LLM alone can't guarantee correctness:
+
+- **"Does this hold for ALL inputs?"** — solvers prove universally, LLMs just check examples
+- **"Do these rules ever conflict?"** — contradiction detection over combinatorial spaces
+- **"Can X reach Y through any path?"** — transitive closure / reachability
+- **Access control, configs, dependencies** — where correctness is non-negotiable
+
+## Configuration
+
+| Variable | Default | Purpose |
+|----------|---------|---------|
+| `CHIASMUS_HOME` | `~/.chiasmus/` | Database and skill storage |
+| `ANTHROPIC_API_KEY` | — | Optional: Anthropic provider for autonomous mode |
+| `DEEPSEEK_API_KEY` | — | Optional: DeepSeek provider for autonomous mode |
+| `OPENAI_API_KEY` | — | Optional: OpenAI provider for autonomous mode |
+| `CHIASMUS_API_URL` | per provider | Override API base URL (e.g. for local models via Ollama) |
+| `CHIASMUS_MODEL` | per provider | Override model name |
+
+Providers are checked in order: Anthropic → DeepSeek → OpenAI. Only one key is needed for autonomous mode (`chiasmus_solve`, `chiasmus_learn`). When used from Claude Code, Crush, or OpenCode, no API key is needed — the calling LLM handles template filling directly.
+
+## License
+
+Apache-2.0

package/dist/formalize/engine.d.ts

@@ -0,0 +1,47 @@
+import type { LLMAdapter } from "../llm/types.js";
+import type { SkillLibrary } from "../skills/library.js";
+import type { SkillTemplate } from "../skills/types.js";
+import type { SolverResult, PrologAnswer } from "../solvers/types.js";
+import type { CorrectionAttempt } from "../solvers/correction-loop.js";
+/** Result of formalize() — template + instructions for the calling LLM */
+export interface FormalizeResult {
+    template: SkillTemplate;
+    instructions: string;
+}
+/** Result of solve() — includes solver result + correction history */
+export interface SolveResult {
+    result: SolverResult;
+    converged: boolean;
+    rounds: number;
+    history: CorrectionAttempt[];
+    templateUsed: string | null;
+    /** Convenience: extracted answers for Prolog results */
+    answers: PrologAnswer[];
+}
+export declare class FormalizationEngine {
+    private library;
+    private llm;
+    constructor(library: SkillLibrary, llm: LLMAdapter);
+    /**
+     * Formalize a problem: select a template and return it with
+     * fill instructions. Does NOT execute or call the LLM for filling.
+     */
+    formalize(problem: string): Promise<FormalizeResult>;
+    /**
+     * End-to-end solve: select template, ask LLM to fill slots,
+     * submit to solver with correction loop.
+     */
+    solve(problem: string, maxRounds?: number): Promise<SolveResult>;
+    private buildInstructions;
+    private llmFill;
+    private llmFix;
+    private buildSolverInput;
+    /**
+     * Lint loop: auto-fix what we can, then ask the LLM to fix remaining errors.
+     * Repeats until the spec passes validation or maxAttempts is reached.
+     */
+    private lintLoop;
+    /** Strip markdown fences and trim whitespace from LLM output */
+    private cleanResponse;
+}
+//# sourceMappingURL=engine.d.ts.map

package/dist/formalize/engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../../src/formalize/engine.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAe,YAAY,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnF,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAGvE,0EAA0E;AAC1E,MAAM,WAAW,eAAe;IAC9B,QAAQ,EAAE,aAAa,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,sEAAsE;AACtE,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,YAAY,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,iBAAiB,EAAE,CAAC;IAC7B,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,wDAAwD;IACxD,OAAO,EAAE,YAAY,EAAE,CAAC;CACzB;AA6BD,qBAAa,mBAAmB;IAE5B,OAAO,CAAC,OAAO;IACf,OAAO,CAAC,GAAG;gBADH,OAAO,EAAE,YAAY,EACrB,GAAG,EAAE,UAAU;IAGzB;;;OAGG;IACG,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;IAU1D;;;OAGG;IACG,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,SAAI,GAAG,OAAO,CAAC,WAAW,CAAC;IAuCjE,OAAO,CAAC,iBAAiB;YAoCX,OAAO;YAUP,MAAM;IAwBpB,OAAO,CAAC,gBAAgB;IAsBxB;;;OAGG;YACW,QAAQ;IAuCtB,gEAAgE;IAChE,OAAO,CAAC,aAAa;CAMtB"}

package/dist/formalize/engine.js

@@ -0,0 +1,189 @@
+import { correctionLoop } from "../solvers/correction-loop.js";
+import { lintSpec } from "./validate.js";
+const FORMALIZE_SYSTEM = `You are a formalization engine that translates natural language problems into formal logic specifications.
+
+Your job:
+1. Read the problem description
+2. Read the template skeleton and slot descriptions
+3. Use the template as a STARTING POINT — fill the slots, but also adapt the structure if the problem requires it
+4. You may add extra variables, assertions, or rules beyond what the template defines
+5. You may remove or restructure parts of the skeleton that don't fit the specific problem
+6. Return ONLY the complete specification — no explanation, no markdown fences, no comments outside the spec
+
+The template is guidance, not a constraint. The goal is a correct specification for the problem, not a rigid fill-in-the-blanks.
+
+For Z3 (SMT-LIB): output valid SMT-LIB assertions. Do NOT include (check-sat) or (get-model).
+For Prolog: output valid ISO Prolog facts and rules.
+
+Be precise with syntax. The specification will be fed directly to a solver.`;
+const FIX_SYSTEM = `You are a formal logic repair engine. You receive a specification that failed verification and the error message from the solver.
+
+Fix the specification to resolve the error. Return ONLY the corrected specification — no explanation, no markdown fences.
+
+Common issues:
+- Type mismatches: ensure all comparisons use matching types
+- Missing declarations: every constant must be declared before use
+- Syntax errors: check parentheses, commas, periods
+- For Prolog: ensure all clauses end with a period`;
+export class FormalizationEngine {
+    library;
+    llm;
+    constructor(library, llm) {
+        this.library = library;
+        this.llm = llm;
+    }
+    /**
+     * Formalize a problem: select a template and return it with
+     * fill instructions. Does NOT execute or call the LLM for filling.
+     */
+    async formalize(problem) {
+        const results = this.library.search(problem, { limit: 1 });
+        const template = results.length > 0
+            ? results[0].template
+            : this.library.list()[0].template; // fallback to first template
+        const instructions = this.buildInstructions(problem, template);
+        return { template, instructions };
+    }
+    /**
+     * End-to-end solve: select template, ask LLM to fill slots,
+     * submit to solver with correction loop.
+     */
+    async solve(problem, maxRounds = 5) {
+        const { template } = await this.formalize(problem);
+        // Ask LLM to fill the template
+        let filledSpec = await this.llmFill(problem, template);
+        // Lint loop: auto-fix what we can, ask LLM to fix the rest
+        filledSpec = await this.lintLoop(filledSpec, template, maxRounds);
+        // Build solver input
+        const initialInput = this.buildSolverInput(template, filledSpec);
+        // Run correction loop with LLM as fixer
+        const correctionResult = await correctionLoop(initialInput, async (attempt, error) => {
+            const fixed = await this.llmFix(attempt, error, template);
+            // Lint the fix before resubmitting to the solver
+            const linted = await this.lintLoop(fixed, template, 2);
+            return this.buildSolverInput(template, linted);
+        }, { maxRounds });
+        // Record template use
+        this.library.recordUse(template.name, correctionResult.converged);
+        return {
+            result: correctionResult.result,
+            converged: correctionResult.converged,
+            rounds: correctionResult.rounds,
+            history: correctionResult.history,
+            templateUsed: template.name,
+            answers: correctionResult.result.status === "success"
+                ? correctionResult.result.answers
+                : [],
+        };
+    }
+    buildInstructions(problem, template) {
+        const slotDescs = template.slots
+            .map((s) => `  {{SLOT:${s.name}}} — ${s.description}\n    Example: ${s.format}`)
+            .join("\n\n");
+        // Find matching normalization guidance
+        const normGuidance = template.normalizations
+            .map((n) => `  - ${n.source}: ${n.transform}`)
+            .join("\n");
+        const queryNote = template.solver === "prolog"
+            ? `\n\nPROLOG QUERY: After filling the template, you will also need to provide a Prolog query goal (ending with a period) that asks the question implied by the problem.`
+            : "";
+        return `TEMPLATE: ${template.name} (${template.solver})
+DESCRIPTION: ${template.signature}
+
+SKELETON:
+${template.skeleton}
+
+SLOTS TO FILL:
+${slotDescs}
+
+NORMALIZATION GUIDANCE:
+${normGuidance}
+${queryNote}
+
+PROBLEM: ${problem}
+
+Fill each {{SLOT:name}} in the skeleton with appropriate ${template.solver === "z3" ? "SMT-LIB" : "Prolog"} code.
+The template is a STARTING POINT — adapt the structure if the problem requires it.
+You may add extra variables, assertions, or rules. You may remove or restructure parts that don't fit.
+${template.solver === "z3" ? "Do NOT include (check-sat) or (get-model) — the tool adds these automatically." : "Ensure all clauses end with a period."}
+Return only the complete filled specification.`;
+    }
+    async llmFill(problem, template) {
+        const instructions = this.buildInstructions(problem, template);
+        const response = await this.llm.complete(FORMALIZE_SYSTEM, [
+            { role: "user", content: instructions },
+        ]);
+        return this.cleanResponse(response);
+    }
+    async llmFix(attempt, error, template) {
+        const spec = attempt.type === "z3" ? attempt.smtlib : attempt.program;
+        const response = await this.llm.complete(FIX_SYSTEM, [
+            {
+                role: "user",
+                content: `SOLVER: ${template.solver}
+SPECIFICATION:
+${spec}
+
+ERROR:
+${error}
+
+Fix the specification and return only the corrected version.`,
+            },
+        ]);
+        return this.cleanResponse(response);
+    }
+    buildSolverInput(template, spec) {
+        if (template.solver === "z3") {
+            return { type: "z3", smtlib: spec };
+        }
+        // For Prolog, extract ?- query from the last line that starts with ?-
+        const lines = spec.split("\n");
+        let program = spec;
+        let query = "true.";
+        for (let i = lines.length - 1; i >= 0; i--) {
+            const trimmed = lines[i].trim();
+            if (trimmed.startsWith("?-")) {
+                query = trimmed.replace(/^\?\-\s*/, "");
+                program = lines.slice(0, i).join("\n").trim();
+                break;
+            }
+        }
+        return { type: "prolog", program, query };
+    }
+    /**
+     * Lint loop: auto-fix what we can, then ask the LLM to fix remaining errors.
+     * Repeats until the spec passes validation or maxAttempts is reached.
+     */
+    async lintLoop(spec, template, maxAttempts) {
+        let current = spec;
+        const seenErrors = new Set();
+        for (let attempt = 0; attempt < maxAttempts; attempt++) {
+            const lint = lintSpec(current, template.solver);
+            current = lint.spec; // apply auto-fixes
+            if (lint.errors.length === 0) {
+                return current; // clean — ready for solver
+            }
+            // Detect oscillation: if we've seen these exact errors before, bail out
+            const errorKey = lint.errors.sort().join("|");
+            if (seenErrors.has(errorKey)) {
+                return current; // LLM is repeating itself — let the solver try
+            }
+            seenErrors.add(errorKey);
+            // Ask LLM to fix the remaining errors
+            const errorReport = [
+                ...lint.fixes.map((f) => `[auto-fixed] ${f}`),
+                ...lint.errors.map((e) => `[error] ${e}`),
+            ].join("\n");
+            current = await this.llmFix(this.buildSolverInput(template, current), `Lint errors (fix these before solver submission):\n${errorReport}`, template);
+        }
+        return current;
+    }
+    /** Strip markdown fences and trim whitespace from LLM output */
+    cleanResponse(response) {
+        return response
+            .replace(/^```(?:smt-lib|smtlib|smt|prolog|pl)?\n?/gm, "")
+            .replace(/^```\n?/gm, "")
+            .trim();
+    }
+}
+//# sourceMappingURL=engine.js.map

package/dist/formalize/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../../src/formalize/engine.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAE/D,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAmBzC,MAAM,gBAAgB,GAAG;;;;;;;;;;;;;;;4EAemD,CAAC;AAE7E,MAAM,UAAU,GAAG;;;;;;;;mDAQgC,CAAC;AAEpD,MAAM,OAAO,mBAAmB;IAEpB;IACA;IAFV,YACU,OAAqB,EACrB,GAAe;QADf,YAAO,GAAP,OAAO,CAAc;QACrB,QAAG,GAAH,GAAG,CAAY;IACtB,CAAC;IAEJ;;;OAGG;IACH,KAAK,CAAC,SAAS,CAAC,OAAe;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC;YACjC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ;YACrB,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,6BAA6B;QAElE,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC/D,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAK,CAAC,OAAe,EAAE,SAAS,GAAG,CAAC;QACxC,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAEnD,+BAA+B;QAC/B,IAAI,UAAU,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAEvD,2DAA2D;QAC3D,UAAU,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QAElE,qBAAqB;QACrB,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAEjE,wCAAwC;QACxC,MAAM,gBAAgB,GAAG,MAAM,cAAc,CAC3C,YAAY,EACZ,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE;YACvB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC1D,iDAAiD;YACjD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;YACvD,OAAO,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACjD,CAAC,EACD,EAAE,SAAS,EAAE,CACd,CAAC;QAEF,sBAAsB;QACtB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAElE,OAAO;YACL,MAAM,EAAE,gBAAgB,CAAC,MAAM;YAC/B,SAAS,EAAE,gBAAgB,CAAC,SAAS;YACrC,MAAM,EAAE,gBAAgB,CAAC,MAAM;YAC/B,OAAO,EAAE,gBAAgB,CAAC,OAAO;YACjC,YAAY,EAAE,QAAQ,CAAC,IAAI;YAC3B,OAAO,EAAE,gBAAgB,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS;gBACnD,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO;gBACjC,CAAC,CAAC,EAAE;SACP,CAAC;IACJ,CAAC;IAEO,iBAAiB,CAAC,OAAe,EAAE,QAAuB;QAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK;aAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,WAAW,kBAAkB,CAAC,CAAC,MAAM,EAAE,CAAC;aAC/E,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,uCAAuC;QACvC,MAAM,YAAY,GAAG,QAAQ,CAAC,cAAc;aACzC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;aAC7C,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,KAAK,QAAQ;YAC5C,CAAC,CAAC,uKAAuK;YACzK,CAAC,CAAC,EAAE,CAAC;QAEP,OAAO,aAAa,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM;eAC1C,QAAQ,CAAC,SAAS;;;EAG/B,QAAQ,CAAC,QAAQ;;;EAGjB,SAAS;;;EAGT,YAAY;EACZ,SAAS;;WAEA,OAAO;;2DAEyC,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ;;;EAGxG,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,gFAAgF,CAAC,CAAC,CAAC,uCAAuC;+CACxG,CAAC;IAC9C,CAAC;IAEO,KAAK,CAAC,OAAO,CAAC,OAAe,EAAE,QAAuB;QAC5D,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAE/D,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,gBAAgB,EAAE;YACzD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE;SACxC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAEO,KAAK,CAAC,MAAM,CAClB,OAAoB,EACpB,KAAa,EACb,QAAuB;QAEvB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;QAEtE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,EAAE;YACnD;gBACE,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,WAAW,QAAQ,CAAC,MAAM;;EAEzC,IAAI;;;EAGJ,KAAK;;6DAEsD;aACtD;SACF,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAEO,gBAAgB,CAAC,QAAuB,EAAE,IAAY;QAC5D,IAAI,QAAQ,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QACtC,CAAC;QAED,sEAAsE;QACtE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,KAAK,GAAG,OAAO,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;gBACxC,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC9C,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,QAAQ,CACpB,IAAY,EACZ,QAAuB,EACvB,WAAmB;QAEnB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,WAAW,EAAE,OAAO,EAAE,EAAE,CAAC;YACvD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YAChD,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,mBAAmB;YAExC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,OAAO,OAAO,CAAC,CAAC,2BAA2B;YAC7C,CAAC;YAED,wEAAwE;YACxE,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9C,IAAI,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC7B,OAAO,OAAO,CAAC,CAAC,+CAA+C;YACjE,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAEzB,sCAAsC;YACtC,MAAM,WAAW,GAAG;gBAClB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC;gBAC7C,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;aAC1C,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEb,OAAO,GAAG,MAAM,IAAI,CAAC,MAAM,CACzB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,OAAO,CAAC,EACxC,sDAAsD,WAAW,EAAE,EACnE,QAAQ,CACT,CAAC;QACJ,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,gEAAgE;IACxD,aAAa,CAAC,QAAgB;QACpC,OAAO,QAAQ;aACZ,OAAO,CAAC,4CAA4C,EAAE,EAAE,CAAC;aACzD,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;aACxB,IAAI,EAAE,CAAC;IACZ,CAAC;CACF"}

package/dist/formalize/validate.d.ts

@@ -0,0 +1,15 @@
+import type { SolverType } from "../solvers/types.js";
+export interface LintResult {
+    /** The spec after auto-fixes have been applied */
+    spec: string;
+    /** Auto-fixes that were applied */
+    fixes: string[];
+    /** Remaining errors that need LLM intervention */
+    errors: string[];
+}
+/**
+ * Lint and auto-fix a specification before sending to the solver.
+ * Fixes what it can, reports what it can't.
+ */
+export declare function lintSpec(spec: string, solver: SolverType): LintResult;
+//# sourceMappingURL=validate.d.ts.map

package/dist/formalize/validate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.d.ts","sourceRoot":"","sources":["../../src/formalize/validate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEtD,MAAM,WAAW,UAAU;IACzB,kDAAkD;IAClD,IAAI,EAAE,MAAM,CAAC;IACb,mCAAmC;IACnC,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,kDAAkD;IAClD,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,GAAG,UAAU,CAmCrE"}