@stevenvo780/st-lang 4.8.0 → 4.10.0

package/dist/tooling/exporters/lean4/index.js

@@ -0,0 +1,423 @@
+"use strict";
+// ============================================================
+// ST Exporters — Lean 4 code generator (classical profile)
+// ============================================================
+// Converts ST Formula AST and Proof objects into valid Lean 4
+// source code. Differences vs. Coq exporter:
+//   - Uses Unicode connectives (∧ ∨ → ¬ ↔) instead of ASCII.
+//   - Definitions use `:=` and theorems use `theorem ... := by ...`.
+//   - Tactics use Lean 4 vocabulary: `intro`, `exact`, `constructor`,
+//     `obtain ⟨...⟩`, `cases`, `left`/`right`, `exfalso`, etc.
+//   - Imports list controls Mathlib vs. core; default pulls in
+//     `Mathlib.Tactic` for `tauto`, `exact?`, `Classical.em`, etc.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LEAN4_OPS = exports.COMMON_IMPORTS = void 0;
+exports.formulaToLeanTerm = formulaToLeanTerm;
+exports.leanTacticForRule = leanTacticForRule;
+exports.exportToLean4 = exportToLean4;
+exports.exportProofToLean4 = exportProofToLean4;
+exports.exportTheoryToLean4 = exportTheoryToLean4;
+// ----------------------------------------------------------------
+// Common imports presets
+// ----------------------------------------------------------------
+exports.COMMON_IMPORTS = {
+    /** Lean 4 core only — no Mathlib needed. */
+    minimal: [],
+    /** Init prelude only — same as the empty list but explicit. */
+    standard: ['Init'],
+    /** Mathlib tactic suite — enables `tauto`, `exact?`, `Classical.em`. */
+    mathlib: ['Mathlib.Tactic'],
+};
+// ----------------------------------------------------------------
+// Symbol mapping
+// ----------------------------------------------------------------
+/**
+ * Maps ST/Unicode logical operators to their Lean 4 surface syntax.
+ * Lean 4 happens to accept the same Unicode glyphs, but we keep the
+ * map explicit so downstream tooling can introspect the mapping.
+ */
+exports.LEAN4_OPS = new Map([
+    ['not', '¬'],
+    ['and', '∧'],
+    ['or', '∨'],
+    ['implies', '→'],
+    ['biconditional', '↔'],
+    ['forall', '∀'],
+    ['exists', '∃'],
+    ['true', 'True'],
+    ['false', 'False'],
+]);
+// ----------------------------------------------------------------
+// Formula → Lean 4 term
+// ----------------------------------------------------------------
+/**
+ * Converts an ST Formula AST node into a Lean 4 Prop expression string.
+ * Unsupported kinds emit `(/- unsupported: <kind> -/)` so dropped
+ * sub-trees are visible to the reader.
+ */
+function formulaToLeanTerm(formula) {
+    switch (formula.kind) {
+        case 'atom':
+            return formula.name ?? 'UnknownAtom';
+        case 'true':
+            return 'True';
+        case 'false':
+            return 'False';
+        case 'not': {
+            const inner = formula.args?.[0];
+            if (!inner)
+                return '(/- missing arg for not -/)';
+            const innerStr = formulaToLeanTerm(inner);
+            return needsParens(inner) ? `(¬ (${innerStr}))` : `(¬ ${innerStr})`;
+        }
+        case 'and': {
+            const left = formula.args?.[0];
+            const right = formula.args?.[1];
+            if (!left || !right)
+                return '(/- missing args for and -/)';
+            return `(${formulaToLeanTerm(left)} ∧ ${formulaToLeanTerm(right)})`;
+        }
+        case 'or': {
+            const left = formula.args?.[0];
+            const right = formula.args?.[1];
+            if (!left || !right)
+                return '(/- missing args for or -/)';
+            return `(${formulaToLeanTerm(left)} ∨ ${formulaToLeanTerm(right)})`;
+        }
+        case 'implies': {
+            const antecedent = formula.args?.[0];
+            const consequent = formula.args?.[1];
+            if (!antecedent || !consequent)
+                return '(/- missing args for implies -/)';
+            return `(${formulaToLeanTerm(antecedent)} → ${formulaToLeanTerm(consequent)})`;
+        }
+        case 'biconditional': {
+            const left = formula.args?.[0];
+            const right = formula.args?.[1];
+            if (!left || !right)
+                return '(/- missing args for biconditional -/)';
+            return `(${formulaToLeanTerm(left)} ↔ ${formulaToLeanTerm(right)})`;
+        }
+        case 'forall': {
+            const variable = formula.variable ?? 'x';
+            const body = formula.args?.[0];
+            if (!body)
+                return `(/- missing body for forall ${variable} -/)`;
+            return `(∀ ${variable} : Prop, ${formulaToLeanTerm(body)})`;
+        }
+        case 'exists': {
+            const variable = formula.variable ?? 'x';
+            const body = formula.args?.[0];
+            if (!body)
+                return `(/- missing body for exists ${variable} -/)`;
+            return `(∃ ${variable} : Prop, ${formulaToLeanTerm(body)})`;
+        }
+        case 'predicate': {
+            const name = formula.name ?? 'P';
+            const params = formula.params ?? formula.terms ?? [];
+            if (params.length === 0)
+                return name;
+            return `(${name} ${params.join(' ')})`;
+        }
+        default:
+            return `(/- unsupported formula kind: ${formula.kind} -/)`;
+    }
+}
+/** Whether the formula needs outer parens when used as an argument. */
+function needsParens(f) {
+    return (f.kind === 'and' ||
+        f.kind === 'or' ||
+        f.kind === 'implies' ||
+        f.kind === 'biconditional' ||
+        f.kind === 'forall' ||
+        f.kind === 'exists');
+}
+// ----------------------------------------------------------------
+// Rule → Lean 4 tactic
+// ----------------------------------------------------------------
+/**
+ * Translates a natural-deduction rule label into a Lean 4 tactic.
+ * Used by callers that already know what rule they want to apply
+ * outside the context of a full proof step.
+ */
+function leanTacticForRule(rule) {
+    const r = rule.toLowerCase();
+    if (r.includes('modus ponens') || r === 'mp' || r.includes('modus-ponens')) {
+        return 'exact h₁ h₂';
+    }
+    if (r.includes('implies intro') || r.includes('→i') || r.includes('imp-intro') || r === 'intro') {
+        return 'intro h';
+    }
+    if (r.includes('and intro') || r.includes('∧i') || r.includes('and-intro')) {
+        return 'constructor';
+    }
+    if (r.includes('and elim left') || r.includes('∧el')) {
+        return 'exact h.left';
+    }
+    if (r.includes('and elim right') || r.includes('∧er')) {
+        return 'exact h.right';
+    }
+    if (r.includes('and elim') || r.includes('∧e')) {
+        return 'obtain ⟨hL, hR⟩ := h';
+    }
+    if (r.includes('or intro left') || r.includes('∨il')) {
+        return 'left';
+    }
+    if (r.includes('or intro right') || r.includes('∨ir')) {
+        return 'right';
+    }
+    if (r.includes('or elim') || r.includes('∨e')) {
+        return 'cases h with\n    | inl hL => sorry\n    | inr hR => sorry';
+    }
+    if (r.includes('not intro') || r.includes('¬i')) {
+        return 'intro habs';
+    }
+    if (r.includes('not elim') || r.includes('¬e') || r.includes('contradiction')) {
+        return 'contradiction';
+    }
+    if (r.includes('forall intro') || r.includes('∀i')) {
+        return 'intro x';
+    }
+    if (r.includes('forall elim') || r.includes('∀e')) {
+        return 'exact h x';
+    }
+    if (r.includes('exists intro') || r.includes('∃i')) {
+        return 'exact ⟨x, hx⟩';
+    }
+    if (r.includes('exists elim') || r.includes('∃e')) {
+        return 'obtain ⟨x, hx⟩ := h';
+    }
+    if (r.includes('lem') || r.includes('excluded middle') || r.includes('em')) {
+        return 'exact Classical.em _';
+    }
+    if (r.includes('exact') || r === 'goal') {
+        return 'exact h';
+    }
+    if (r.includes('assumption') || r === 'premise') {
+        return 'assumption';
+    }
+    if (r.includes('tauto')) {
+        return 'tauto';
+    }
+    return `sorry -- TODO: ${rule}`;
+}
+// ----------------------------------------------------------------
+// Tactic skeleton derivation from a Proof object
+// ----------------------------------------------------------------
+function proofStepToTactic(step) {
+    if (step.source === 'premise' || step.justification.toLowerCase().includes('premise')) {
+        return `    -- step ${step.stepNumber}: premise — already in context`;
+    }
+    if (step.source === 'assumption' || step.justification.toLowerCase().includes('assumption')) {
+        return '    assumption';
+    }
+    return `    ${leanTacticForRule(step.justification)}`;
+}
+function buildTacticBlock(proof) {
+    if (proof.status !== 'complete' || proof.steps.length === 0) {
+        return '    sorry -- TODO: derive — proof not complete';
+    }
+    return proof.steps.map(proofStepToTactic).join('\n');
+}
+// ----------------------------------------------------------------
+// Heuristic proofs for common shapes
+// ----------------------------------------------------------------
+/** Detects `P → P` and emits the identity proof. */
+function tryIdentityProof(formula) {
+    if (formula.kind !== 'implies')
+        return null;
+    const ant = formula.args?.[0];
+    const con = formula.args?.[1];
+    if (!ant || !con)
+        return null;
+    if (ant.kind === 'atom' && con.kind === 'atom' && ant.name === con.name) {
+        return `    intro h\n    exact h`;
+    }
+    return null;
+}
+/** Detects `(A ∧ B) → A` — left projection. */
+function tryAndElimLeftProof(formula) {
+    if (formula.kind !== 'implies')
+        return null;
+    const ant = formula.args?.[0];
+    const con = formula.args?.[1];
+    if (!ant || !con)
+        return null;
+    if (ant.kind === 'and' && con.kind === 'atom') {
+        const leftArg = ant.args?.[0];
+        if (leftArg?.kind === 'atom' && leftArg.name === con.name) {
+            return `    intro h\n    exact h.left`;
+        }
+    }
+    return null;
+}
+/** Detects `(A ∧ B) → B` — right projection. */
+function tryAndElimRightProof(formula) {
+    if (formula.kind !== 'implies')
+        return null;
+    const ant = formula.args?.[0];
+    const con = formula.args?.[1];
+    if (!ant || !con)
+        return null;
+    if (ant.kind === 'and' && con.kind === 'atom') {
+        const rightArg = ant.args?.[1];
+        if (rightArg?.kind === 'atom' && rightArg.name === con.name) {
+            return `    intro h\n    exact h.right`;
+        }
+    }
+    return null;
+}
+/** Detects `P ∨ ¬P` (LEM). */
+function tryLEMProof(formula) {
+    if (formula.kind !== 'or')
+        return null;
+    const left = formula.args?.[0];
+    const right = formula.args?.[1];
+    if (!left || !right)
+        return null;
+    if (left.kind === 'atom' && right.kind === 'not') {
+        const negArg = right.args?.[0];
+        if (negArg?.kind === 'atom' && negArg.name === left.name) {
+            return `    exact Classical.em _`;
+        }
+    }
+    if (right.kind === 'atom' && left.kind === 'not') {
+        const negArg = left.args?.[0];
+        if (negArg?.kind === 'atom' && negArg.name === right.name) {
+            return `    exact (Classical.em _).symm`;
+        }
+    }
+    return null;
+}
+/** Picks the best tactic skeleton given just a goal formula. */
+function heuristicTactics(formula) {
+    const identity = tryIdentityProof(formula);
+    if (identity)
+        return identity;
+    const lem = tryLEMProof(formula);
+    if (lem)
+        return lem;
+    const andLeft = tryAndElimLeftProof(formula);
+    if (andLeft)
+        return andLeft;
+    const andRight = tryAndElimRightProof(formula);
+    if (andRight)
+        return andRight;
+    if (formula.kind === 'forall') {
+        const body = formula.args?.[0];
+        if (body?.kind === 'implies') {
+            const ant = body.args?.[0];
+            const con = body.args?.[1];
+            if (ant?.kind === 'predicate' && con?.kind === 'exists') {
+                const exVar = con.variable ?? 'y';
+                // Lean 4: provide the witness and reuse the assumption.
+                return `    intro x\n    intro h\n    exact ⟨${exVar}, h⟩`;
+            }
+        }
+        return `    intro ${formula.variable ?? 'x'}\n    sorry -- TODO: derive`;
+    }
+    return `    sorry -- TODO: derive`;
+}
+// ----------------------------------------------------------------
+// Import / header helpers
+// ----------------------------------------------------------------
+function resolveImports(opts) {
+    if (opts?.imports !== undefined)
+        return opts.imports;
+    const useMathlib = opts?.useMathlib ?? true;
+    return useMathlib ? exports.COMMON_IMPORTS.mathlib : exports.COMMON_IMPORTS.minimal;
+}
+function emitImports(imports) {
+    return imports.filter((i) => i.length > 0).map((i) => `import ${i}`);
+}
+// ----------------------------------------------------------------
+// Main export functions
+// ----------------------------------------------------------------
+/**
+ * Exports a single ST Formula as a Lean 4 module containing a
+ * `def stmt : Prop := ...` and an optional `theorem stmt_proof : stmt := by ...`.
+ */
+function exportToLean4(formula, opts) {
+    const moduleName = opts?.moduleName ?? 'STExport';
+    const emitProof = opts?.emitProof ?? true;
+    const imports = resolveImports(opts);
+    const term = formulaToLeanTerm(formula);
+    const lines = [];
+    const importLines = emitImports(imports);
+    if (importLines.length > 0) {
+        lines.push(...importLines);
+        lines.push('');
+    }
+    lines.push(`namespace ${moduleName}`);
+    lines.push('');
+    lines.push(`def stmt : Prop := ${term}`);
+    if (emitProof) {
+        lines.push('');
+        lines.push(`theorem stmt_proof : stmt := by`);
+        lines.push(heuristicTactics(formula));
+    }
+    lines.push('');
+    lines.push(`end ${moduleName}`);
+    return lines.join('\n');
+}
+/**
+ * Exports an ST Proof object as a Lean 4 module whose theorem body is
+ * derived from the proof steps.
+ */
+function exportProofToLean4(proof, opts) {
+    const moduleName = opts?.moduleName ?? 'STExport';
+    const emitProof = opts?.emitProof ?? true;
+    const imports = resolveImports(opts);
+    const term = formulaToLeanTerm(proof.goal);
+    const lines = [];
+    const importLines = emitImports(imports);
+    if (importLines.length > 0) {
+        lines.push(...importLines);
+        lines.push('');
+    }
+    lines.push(`namespace ${moduleName}`);
+    lines.push('');
+    lines.push(`def stmt : Prop := ${term}`);
+    if (emitProof) {
+        lines.push('');
+        lines.push(`theorem stmt_proof : stmt := by`);
+        lines.push(buildTacticBlock(proof));
+    }
+    lines.push('');
+    lines.push(`end ${moduleName}`);
+    return lines.join('\n');
+}
+/**
+ * Exports a small theory (axioms + theorems) as a single Lean 4 module.
+ * Axioms become `axiom ax_i : <prop>` declarations; theorems become
+ * `theorem th_i : <prop> := by sorry` skeletons that the user fills in.
+ */
+function exportTheoryToLean4(axioms, theorems, opts) {
+    const moduleName = opts?.moduleName ?? 'STExport';
+    const emitProof = opts?.emitProof ?? true;
+    const imports = resolveImports(opts);
+    const lines = [];
+    const importLines = emitImports(imports);
+    if (importLines.length > 0) {
+        lines.push(...importLines);
+        lines.push('');
+    }
+    lines.push(`namespace ${moduleName}`);
+    axioms.forEach((ax, idx) => {
+        lines.push('');
+        lines.push(`axiom ax_${idx + 1} : ${formulaToLeanTerm(ax)}`);
+    });
+    theorems.forEach((th, idx) => {
+        lines.push('');
+        lines.push(`def stmt_${idx + 1} : Prop := ${formulaToLeanTerm(th)}`);
+        if (emitProof) {
+            lines.push(`theorem stmt_${idx + 1}_proof : stmt_${idx + 1} := by`);
+            lines.push(heuristicTactics(th));
+        }
+    });
+    lines.push('');
+    lines.push(`end ${moduleName}`);
+    return lines.join('\n');
+}
+//# sourceMappingURL=index.js.map

package/dist/tooling/exporters/lean4/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/tooling/exporters/lean4/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2DAA2D;AAC3D,+DAA+D;AAC/D,8DAA8D;AAC9D,6CAA6C;AAC7C,6DAA6D;AAC7D,qEAAqE;AACrE,sEAAsE;AACtE,+DAA+D;AAC/D,+DAA+D;AAC/D,mEAAmE;AACnE,+DAA+D;;;AA8D/D,8CAsEC;AAuBD,8CA8DC;AA+ID,sCA4BC;AAMD,gDA4BC;AAOD,kDAoCC;AA9bD,mEAAmE;AACnE,yBAAyB;AACzB,mEAAmE;AAEtD,QAAA,cAAc,GAAyD;IAClF,4CAA4C;IAC5C,OAAO,EAAE,EAAE;IACX,+DAA+D;IAC/D,QAAQ,EAAE,CAAC,MAAM,CAAC;IAClB,wEAAwE;IACxE,OAAO,EAAE,CAAC,gBAAgB,CAAC;CAC5B,CAAC;AAEF,mEAAmE;AACnE,iBAAiB;AACjB,mEAAmE;AAEnE;;;;GAIG;AACU,QAAA,SAAS,GAAwB,IAAI,GAAG,CAAC;IACpD,CAAC,KAAK,EAAE,GAAG,CAAC;IACZ,CAAC,KAAK,EAAE,GAAG,CAAC;IACZ,CAAC,IAAI,EAAE,GAAG,CAAC;IACX,CAAC,SAAS,EAAE,GAAG,CAAC;IAChB,CAAC,eAAe,EAAE,GAAG,CAAC;IACtB,CAAC,QAAQ,EAAE,GAAG,CAAC;IACf,CAAC,QAAQ,EAAE,GAAG,CAAC;IACf,CAAC,MAAM,EAAE,MAAM,CAAC;IAChB,CAAC,OAAO,EAAE,OAAO,CAAC;CACnB,CAAC,CAAC;AAEH,mEAAmE;AACnE,wBAAwB;AACxB,mEAAmE;AAEnE;;;;GAIG;AACH,SAAgB,iBAAiB,CAAC,OAAgB;IAChD,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM;YACT,OAAO,OAAO,CAAC,IAAI,IAAI,aAAa,CAAC;QAEvC,KAAK,MAAM;YACT,OAAO,MAAM,CAAC;QAEhB,KAAK,OAAO;YACV,OAAO,OAAO,CAAC;QAEjB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK;gBAAE,OAAO,6BAA6B,CAAC;YACjD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAC1C,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,QAAQ,IAAI,CAAC,CAAC,CAAC,MAAM,QAAQ,GAAG,CAAC;QACtE,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;gBAAE,OAAO,8BAA8B,CAAC;YAC3D,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,MAAM,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC;QACtE,CAAC;QAED,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;gBAAE,OAAO,6BAA6B,CAAC;YAC1D,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,MAAM,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC;QACtE,CAAC;QAED,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU;gBAAE,OAAO,kCAAkC,CAAC;YAC1E,OAAO,IAAI,iBAAiB,CAAC,UAAU,CAAC,MAAM,iBAAiB,CAAC,UAAU,CAAC,GAAG,CAAC;QACjF,CAAC;QAED,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;gBAAE,OAAO,wCAAwC,CAAC;YACrE,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,MAAM,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC;QACtE,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAC;YACzC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI;gBAAE,OAAO,+BAA+B,QAAQ,MAAM,CAAC;YAChE,OAAO,MAAM,QAAQ,YAAY,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC;QAC9D,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAC;YACzC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI;gBAAE,OAAO,+BAA+B,QAAQ,MAAM,CAAC;YAChE,OAAO,MAAM,QAAQ,YAAY,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC;QAC9D,CAAC;QAED,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,GAAG,CAAC;YACjC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;YACrD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACrC,OAAO,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACzC,CAAC;QAED;YACE,OAAO,iCAAiC,OAAO,CAAC,IAAI,MAAM,CAAC;IAC/D,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,SAAS,WAAW,CAAC,CAAU;IAC7B,OAAO,CACL,CAAC,CAAC,IAAI,KAAK,KAAK;QAChB,CAAC,CAAC,IAAI,KAAK,IAAI;QACf,CAAC,CAAC,IAAI,KAAK,SAAS;QACpB,CAAC,CAAC,IAAI,KAAK,eAAe;QAC1B,CAAC,CAAC,IAAI,KAAK,QAAQ;QACnB,CAAC,CAAC,IAAI,KAAK,QAAQ,CACpB,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,uBAAuB;AACvB,mEAAmE;AAEnE;;;;GAIG;AACH,SAAgB,iBAAiB,CAAC,IAAY;IAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAE7B,IAAI,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;QAC3E,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;QAChG,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QAC3E,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACrD,OAAO,cAAc,CAAC;IACxB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/C,OAAO,sBAAsB,CAAC;IAChC,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACrD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,OAAO,4DAA4D,CAAC;IACtE,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,OAAO,YAAY,CAAC;IACtB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,EAAE,CAAC;QAC9E,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACnD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAClD,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACnD,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAClD,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3E,OAAO,sBAAsB,CAAC;IAChC,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;QACxC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QAChD,OAAO,YAAY,CAAC;IACtB,CAAC;IACD,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QACxB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,OAAO,kBAAkB,IAAI,EAAE,CAAC;AAClC,CAAC;AAED,mEAAmE;AACnE,iDAAiD;AACjD,mEAAmE;AAEnE,SAAS,iBAAiB,CAAC,IAAe;IACxC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QACtF,OAAO,eAAe,IAAI,CAAC,UAAU,gCAAgC,CAAC;IACxE,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,YAAY,IAAI,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;QAC5F,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IACD,OAAO,OAAO,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;AACxD,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAY;IACpC,IAAI,KAAK,CAAC,MAAM,KAAK,UAAU,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5D,OAAO,gDAAgD,CAAC;IAC1D,CAAC;IACD,OAAO,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvD,CAAC;AAED,mEAAmE;AACnE,qCAAqC;AACrC,mEAAmE;AAEnE,oDAAoD;AACpD,SAAS,gBAAgB,CAAC,OAAgB;IACxC,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;QACxE,OAAO,0BAA0B,CAAC;IACpC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+CAA+C;AAC/C,SAAS,mBAAmB,CAAC,OAAgB;IAC3C,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC9C,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,OAAO,EAAE,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;YAC1D,OAAO,+BAA+B,CAAC;QACzC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gDAAgD;AAChD,SAAS,oBAAoB,CAAC,OAAgB;IAC5C,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC9C,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,QAAQ,EAAE,IAAI,KAAK,MAAM,IAAI,QAAQ,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;YAC5D,OAAO,gCAAgC,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8BAA8B;AAC9B,SAAS,WAAW,CAAC,OAAgB;IACnC,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACvC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACjC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,MAAM,EAAE,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YACzD,OAAO,0BAA0B,CAAC;QACpC,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,MAAM,EAAE,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1D,OAAO,iCAAiC,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gEAAgE;AAChE,SAAS,gBAAgB,CAAC,OAAgB;IACxC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAC3C,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAE9B,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACjC,IAAI,GAAG;QAAE,OAAO,GAAG,CAAC;IAEpB,MAAM,OAAO,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC7C,IAAI,OAAO;QAAE,OAAO,OAAO,CAAC;IAE5B,MAAM,QAAQ,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAC/C,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAE9B,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,IAAI,EAAE,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,GAAG,EAAE,IAAI,KAAK,WAAW,IAAI,GAAG,EAAE,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACxD,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC;gBAClC,wDAAwD;gBACxD,OAAO,wCAAwC,KAAK,MAAM,CAAC;YAC7D,CAAC;QACH,CAAC;QACD,OAAO,aAAa,OAAO,CAAC,QAAQ,IAAI,GAAG,6BAA6B,CAAC;IAC3E,CAAC;IAED,OAAO,2BAA2B,CAAC;AACrC,CAAC;AAED,mEAAmE;AACnE,0BAA0B;AAC1B,mEAAmE;AAEnE,SAAS,cAAc,CAAC,IAAoC;IAC1D,IAAI,IAAI,EAAE,OAAO,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,OAAO,CAAC;IACrD,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,IAAI,CAAC;IAC5C,OAAO,UAAU,CAAC,CAAC,CAAC,sBAAc,CAAC,OAAO,CAAC,CAAC,CAAC,sBAAc,CAAC,OAAO,CAAC;AACtE,CAAC;AAED,SAAS,WAAW,CAAC,OAAiB;IACpC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;AACvE,CAAC;AAED,mEAAmE;AACnE,wBAAwB;AACxB,mEAAmE;AAEnE;;;GAGG;AACH,SAAgB,aAAa,CAAC,OAAgB,EAAE,IAAyB;IACvE,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,UAAU,CAAC;IAClD,MAAM,SAAS,GAAG,IAAI,EAAE,SAAS,IAAI,IAAI,CAAC;IAC1C,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAErC,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,MAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,aAAa,UAAU,EAAE,CAAC,CAAC;IACtC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,sBAAsB,IAAI,EAAE,CAAC,CAAC;IAEzC,IAAI,SAAS,EAAE,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,OAAO,UAAU,EAAE,CAAC,CAAC;IAEhC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,SAAgB,kBAAkB,CAAC,KAAY,EAAE,IAAyB;IACxE,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,UAAU,CAAC;IAClD,MAAM,SAAS,GAAG,IAAI,EAAE,SAAS,IAAI,IAAI,CAAC;IAC1C,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAErC,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,MAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,aAAa,UAAU,EAAE,CAAC,CAAC;IACtC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,sBAAsB,IAAI,EAAE,CAAC,CAAC;IAEzC,IAAI,SAAS,EAAE,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,OAAO,UAAU,EAAE,CAAC,CAAC;IAEhC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;;GAIG;AACH,SAAgB,mBAAmB,CACjC,MAAiB,EACjB,QAAmB,EACnB,IAAyB;IAEzB,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,UAAU,CAAC;IAClD,MAAM,SAAS,GAAG,IAAI,EAAE,SAAS,IAAI,IAAI,CAAC;IAC1C,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAErC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,aAAa,UAAU,EAAE,CAAC,CAAC;IAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE;QACzB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,MAAM,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE;QAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,cAAc,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACrE,IAAI,SAAS,EAAE,CAAC;YACd,KAAK,CAAC,IAAI,CAAC,gBAAgB,GAAG,GAAG,CAAC,iBAAiB,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;YACpE,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,OAAO,UAAU,EAAE,CAAC,CAAC;IAEhC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/tooling/mathlib/group.d.ts

@@ -0,0 +1,27 @@
+import type { Group, Magma, VerificationResult } from './types';
+/**
+ * (a · b) · c = a · (b · c) para todo a,b,c en el muestreo.
+ */
+export declare function isAssociative<T>(m: Magma<T>, elements: T[], eq?: (a: T, b: T) => boolean): boolean;
+/**
+ * a · b = b · a para todo a,b. Falla rápido si encuentra contraejemplo.
+ */
+export declare function isCommutative<T>(m: Magma<T>, elements: T[], eq?: (a: T, b: T) => boolean): boolean;
+/**
+ * Para todo a: id · a = a ∧ a · id = a.
+ */
+export declare function hasIdentity<T>(m: Magma<T>, elements: T[], id: T, eq?: (a: T, b: T) => boolean): boolean;
+/**
+ * Para todo a: a · a⁻¹ = id ∧ a⁻¹ · a = id.
+ */
+export declare function hasInverses<T>(g: Group<T>, elements: T[], eq?: (a: T, b: T) => boolean): boolean;
+/**
+ * Verifica los 4 axiomas de grupo: clausura (implícita en el tipo),
+ * asociatividad, identidad e inversos. Reporta qué axiomas fallaron.
+ */
+export declare function verifyGroup<T>(g: Group<T>, elements: T[], eq?: (a: T, b: T) => boolean): VerificationResult;
+/**
+ * Verifica que un grupo es abeliano (verifyGroup + conmutatividad).
+ */
+export declare function verifyAbelianGroup<T>(g: Group<T>, elements: T[], eq?: (a: T, b: T) => boolean): VerificationResult;
+//# sourceMappingURL=group.d.ts.map

package/dist/tooling/mathlib/group.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"group.d.ts","sourceRoot":"","sources":["../../../src/tooling/mathlib/group.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAEhE;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EACX,QAAQ,EAAE,CAAC,EAAE,EACb,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAA2B,GAC9C,OAAO,CAWT;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EACX,QAAQ,EAAE,CAAC,EAAE,EACb,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAA2B,GAC9C,OAAO,CAOT;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EACX,QAAQ,EAAE,CAAC,EAAE,EACb,EAAE,EAAE,CAAC,EACL,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAA2B,GAC9C,OAAO,CAMT;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EACX,QAAQ,EAAE,CAAC,EAAE,EACb,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAA2B,GAC9C,OAAO,CAOT;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EACX,QAAQ,EAAE,CAAC,EAAE,EACb,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAA2B,GAC9C,kBAAkB,CAMpB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EACX,QAAQ,EAAE,CAAC,EAAE,EACb,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAA2B,GAC9C,kBAAkB,CAIpB"}

package/dist/tooling/mathlib/group.js

@@ -0,0 +1,89 @@
+"use strict";
+// ============================================================
+// ST Mathlib — Group theory
+// Axiomas: asociatividad, identidad, inversos, conmutatividad.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isAssociative = isAssociative;
+exports.isCommutative = isCommutative;
+exports.hasIdentity = hasIdentity;
+exports.hasInverses = hasInverses;
+exports.verifyGroup = verifyGroup;
+exports.verifyAbelianGroup = verifyAbelianGroup;
+/**
+ * (a · b) · c = a · (b · c) para todo a,b,c en el muestreo.
+ */
+function isAssociative(m, elements, eq = (a, b) => a === b) {
+    for (const a of elements) {
+        for (const b of elements) {
+            for (const c of elements) {
+                const left = m.op(m.op(a, b), c);
+                const right = m.op(a, m.op(b, c));
+                if (!eq(left, right))
+                    return false;
+            }
+        }
+    }
+    return true;
+}
+/**
+ * a · b = b · a para todo a,b. Falla rápido si encuentra contraejemplo.
+ */
+function isCommutative(m, elements, eq = (a, b) => a === b) {
+    for (const a of elements) {
+        for (const b of elements) {
+            if (!eq(m.op(a, b), m.op(b, a)))
+                return false;
+        }
+    }
+    return true;
+}
+/**
+ * Para todo a: id · a = a ∧ a · id = a.
+ */
+function hasIdentity(m, elements, id, eq = (a, b) => a === b) {
+    for (const a of elements) {
+        if (!eq(m.op(id, a), a))
+            return false;
+        if (!eq(m.op(a, id), a))
+            return false;
+    }
+    return true;
+}
+/**
+ * Para todo a: a · a⁻¹ = id ∧ a⁻¹ · a = id.
+ */
+function hasInverses(g, elements, eq = (a, b) => a === b) {
+    for (const a of elements) {
+        const inv = g.inverse(a);
+        if (!eq(g.op(a, inv), g.identity))
+            return false;
+        if (!eq(g.op(inv, a), g.identity))
+            return false;
+    }
+    return true;
+}
+/**
+ * Verifica los 4 axiomas de grupo: clausura (implícita en el tipo),
+ * asociatividad, identidad e inversos. Reporta qué axiomas fallaron.
+ */
+function verifyGroup(g, elements, eq = (a, b) => a === b) {
+    const failures = [];
+    if (!isAssociative(g, elements, eq))
+        failures.push('asociatividad');
+    if (!hasIdentity(g, elements, g.identity, eq))
+        failures.push('identidad');
+    if (!hasInverses(g, elements, eq))
+        failures.push('inversos');
+    return { valid: failures.length === 0, failures };
+}
+/**
+ * Verifica que un grupo es abeliano (verifyGroup + conmutatividad).
+ */
+function verifyAbelianGroup(g, elements, eq = (a, b) => a === b) {
+    const base = verifyGroup(g, elements, eq);
+    if (!isCommutative(g, elements, eq))
+        base.failures.push('conmutatividad');
+    return { valid: base.failures.length === 0, failures: base.failures };
+}
+//# sourceMappingURL=group.js.map

package/dist/tooling/mathlib/group.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"group.js","sourceRoot":"","sources":["../../../src/tooling/mathlib/group.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4BAA4B;AAC5B,+DAA+D;AAC/D,+DAA+D;;AAO/D,sCAeC;AAKD,sCAWC;AAKD,kCAWC;AAKD,kCAWC;AAMD,kCAUC;AAKD,gDAQC;AA/FD;;GAEG;AACH,SAAgB,aAAa,CAC3B,CAAW,EACX,QAAa,EACb,KAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAE/C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjC,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAClC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;YACrC,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,aAAa,CAC3B,CAAW,EACX,QAAa,EACb,KAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAE/C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,WAAW,CACzB,CAAW,EACX,QAAa,EACb,EAAK,EACL,KAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAE/C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,WAAW,CACzB,CAAW,EACX,QAAa,EACb,KAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAE/C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC;QAChD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC;IAClD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CACzB,CAAW,EACX,QAAa,EACb,KAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAE/C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACpE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC1E,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC7D,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,SAAgB,kBAAkB,CAChC,CAAW,EACX,QAAa,EACb,KAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAE/C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC;IAC1C,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC;QAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;IAC1E,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;AACxE,CAAC"}

package/dist/tooling/mathlib/index.d.ts

@@ -0,0 +1,8 @@
+export type { AlgebraicStructure, AlgebraAxiom, PartialOrder, TotalOrder, Magma, Semigroup, Monoid, Group, AbelianGroup, Ring, Lemma, VerificationResult, } from './types';
+export { isReflexive, isAntisymmetric, isTransitive, isLattice, verifyPartialOrder } from './order';
+export { isAssociative, isCommutative, hasIdentity, hasInverses, verifyGroup, verifyAbelianGroup, } from './group';
+export { verifyRing, isField } from './ring';
+export { intAdditiveGroup, intRing, rationalsField, rational, rationalEq, rationalDiv, zModN, zModNElements, zModNDiv, sym3, sym3Elements, perm3Eq, } from './instances';
+export type { Rational, Perm3 } from './instances';
+export { STANDARD_LEMMAS } from './lemmas';
+//# sourceMappingURL=index.d.ts.map

package/dist/tooling/mathlib/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/tooling/mathlib/index.ts"],"names":[],"mappings":"AAMA,YAAY,EACV,kBAAkB,EAClB,YAAY,EACZ,YAAY,EACZ,UAAU,EACV,KAAK,EACL,SAAS,EACT,MAAM,EACN,KAAK,EACL,YAAY,EACZ,IAAI,EACJ,KAAK,EACL,kBAAkB,GACnB,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,YAAY,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAEpG,OAAO,EACL,aAAa,EACb,aAAa,EACb,WAAW,EACX,WAAW,EACX,WAAW,EACX,kBAAkB,GACnB,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,QAAQ,CAAC;AAE7C,OAAO,EACL,gBAAgB,EAChB,OAAO,EACP,cAAc,EACd,QAAQ,EACR,UAAU,EACV,WAAW,EACX,KAAK,EACL,aAAa,EACb,QAAQ,EACR,IAAI,EACJ,YAAY,EACZ,OAAO,GACR,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAEnD,OAAO,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC"}

package/dist/tooling/mathlib/index.js

@@ -0,0 +1,40 @@
+"use strict";
+// ============================================================
+// ST Mathlib — Subset curado de definiciones algebraicas.
+// Inspirado en Lean mathlib. Soporta order theory, group theory,
+// ring theory + instancias estándar (Z, Q, Z/nZ, S_3) + lemas.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.STANDARD_LEMMAS = exports.perm3Eq = exports.sym3Elements = exports.sym3 = exports.zModNDiv = exports.zModNElements = exports.zModN = exports.rationalDiv = exports.rationalEq = exports.rational = exports.rationalsField = exports.intRing = exports.intAdditiveGroup = exports.isField = exports.verifyRing = exports.verifyAbelianGroup = exports.verifyGroup = exports.hasInverses = exports.hasIdentity = exports.isCommutative = exports.isAssociative = exports.verifyPartialOrder = exports.isLattice = exports.isTransitive = exports.isAntisymmetric = exports.isReflexive = void 0;
+var order_1 = require("./order");
+Object.defineProperty(exports, "isReflexive", { enumerable: true, get: function () { return order_1.isReflexive; } });
+Object.defineProperty(exports, "isAntisymmetric", { enumerable: true, get: function () { return order_1.isAntisymmetric; } });
+Object.defineProperty(exports, "isTransitive", { enumerable: true, get: function () { return order_1.isTransitive; } });
+Object.defineProperty(exports, "isLattice", { enumerable: true, get: function () { return order_1.isLattice; } });
+Object.defineProperty(exports, "verifyPartialOrder", { enumerable: true, get: function () { return order_1.verifyPartialOrder; } });
+var group_1 = require("./group");
+Object.defineProperty(exports, "isAssociative", { enumerable: true, get: function () { return group_1.isAssociative; } });
+Object.defineProperty(exports, "isCommutative", { enumerable: true, get: function () { return group_1.isCommutative; } });
+Object.defineProperty(exports, "hasIdentity", { enumerable: true, get: function () { return group_1.hasIdentity; } });
+Object.defineProperty(exports, "hasInverses", { enumerable: true, get: function () { return group_1.hasInverses; } });
+Object.defineProperty(exports, "verifyGroup", { enumerable: true, get: function () { return group_1.verifyGroup; } });
+Object.defineProperty(exports, "verifyAbelianGroup", { enumerable: true, get: function () { return group_1.verifyAbelianGroup; } });
+var ring_1 = require("./ring");
+Object.defineProperty(exports, "verifyRing", { enumerable: true, get: function () { return ring_1.verifyRing; } });
+Object.defineProperty(exports, "isField", { enumerable: true, get: function () { return ring_1.isField; } });
+var instances_1 = require("./instances");
+Object.defineProperty(exports, "intAdditiveGroup", { enumerable: true, get: function () { return instances_1.intAdditiveGroup; } });
+Object.defineProperty(exports, "intRing", { enumerable: true, get: function () { return instances_1.intRing; } });
+Object.defineProperty(exports, "rationalsField", { enumerable: true, get: function () { return instances_1.rationalsField; } });
+Object.defineProperty(exports, "rational", { enumerable: true, get: function () { return instances_1.rational; } });
+Object.defineProperty(exports, "rationalEq", { enumerable: true, get: function () { return instances_1.rationalEq; } });
+Object.defineProperty(exports, "rationalDiv", { enumerable: true, get: function () { return instances_1.rationalDiv; } });
+Object.defineProperty(exports, "zModN", { enumerable: true, get: function () { return instances_1.zModN; } });
+Object.defineProperty(exports, "zModNElements", { enumerable: true, get: function () { return instances_1.zModNElements; } });
+Object.defineProperty(exports, "zModNDiv", { enumerable: true, get: function () { return instances_1.zModNDiv; } });
+Object.defineProperty(exports, "sym3", { enumerable: true, get: function () { return instances_1.sym3; } });
+Object.defineProperty(exports, "sym3Elements", { enumerable: true, get: function () { return instances_1.sym3Elements; } });
+Object.defineProperty(exports, "perm3Eq", { enumerable: true, get: function () { return instances_1.perm3Eq; } });
+var lemmas_1 = require("./lemmas");
+Object.defineProperty(exports, "STANDARD_LEMMAS", { enumerable: true, get: function () { return lemmas_1.STANDARD_LEMMAS; } });
+//# sourceMappingURL=index.js.map

package/dist/tooling/mathlib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/tooling/mathlib/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0DAA0D;AAC1D,iEAAiE;AACjE,+DAA+D;AAC/D,+DAA+D;;;AAiB/D,iCAAoG;AAA3F,oGAAA,WAAW,OAAA;AAAE,wGAAA,eAAe,OAAA;AAAE,qGAAA,YAAY,OAAA;AAAE,kGAAA,SAAS,OAAA;AAAE,2GAAA,kBAAkB,OAAA;AAElF,iCAOiB;AANf,sGAAA,aAAa,OAAA;AACb,sGAAA,aAAa,OAAA;AACb,oGAAA,WAAW,OAAA;AACX,oGAAA,WAAW,OAAA;AACX,oGAAA,WAAW,OAAA;AACX,2GAAA,kBAAkB,OAAA;AAGpB,+BAA6C;AAApC,kGAAA,UAAU,OAAA;AAAE,+FAAA,OAAO,OAAA;AAE5B,yCAaqB;AAZnB,6GAAA,gBAAgB,OAAA;AAChB,oGAAA,OAAO,OAAA;AACP,2GAAA,cAAc,OAAA;AACd,qGAAA,QAAQ,OAAA;AACR,uGAAA,UAAU,OAAA;AACV,wGAAA,WAAW,OAAA;AACX,kGAAA,KAAK,OAAA;AACL,0GAAA,aAAa,OAAA;AACb,qGAAA,QAAQ,OAAA;AACR,iGAAA,IAAI,OAAA;AACJ,yGAAA,YAAY,OAAA;AACZ,oGAAA,OAAO,OAAA;AAIT,mCAA2C;AAAlC,yGAAA,eAAe,OAAA"}