@proposit/proposit-core 2.2.1 → 2.3.0

package/dist/extensions/pipelines/base/stages/formula-compilation.js

@@ -1,34 +1,167 @@
-// `formula-compilation` — deterministic stage that compiles each
-// `relation-extraction` output into a `parseFormula`-consumable
-// formula string, and mints one dedicated "conclusion premise" whose
-// formula is just the conclusion claim's variable symbol.
+// `formula-compilation` — deterministic stage that turns each `inference`
+// relation into a `parseFormula`-consumable formula string for a freeform
+// premise, sorts citation/axiomatic antecedents out into derivation
+// backing, and mints one dedicated "conclusion premise" whose formula is
+// just the conclusion claim's variable symbol.
 //
-// Compilation rules (spec §7.3):
-//   support           s         → t   ⇒  s_symbol IMPLIES t_symbol
-//   joint-support     s1..sn    → t   ⇒  (s1 AND s2 AND ...) IMPLIES t_symbol
-//   derivation-support s        → t   ⇒  s_symbol IMPLIES t_symbol
+// Inference relations compile to:
+//   antecedents a1..an → consequent c  ⇒  (a1 AND ... AND an) IMPLIES c
+//   (a single antecedent drops the parentheses: a1 IMPLIES c)
 //
-// The conclusion-premise mapping rule:
-//   - When `conclusion-selection.conclusionMiniId` is non-null:
-//     exactly one premise is minted with `roleHint: "conclusion"` and
-//     `formula: <conclusion claim's variable symbol>`.
-//   - When `conclusion-selection.conclusionMiniId` is null OR the
-//     conclusion claim has no resolvable variable symbol:
-//     `conclusionPremiseMiniId` is null and the conclusion premise is
-//     not emitted. The relation premises are still emitted.
+// Citation/axiomatic claims may not sit in a freeform premise (grammar
+// rules D-4 / D-5) — they ground a derivation premise instead.
+// `sortInferenceRelations` extracts any citation/axiomatic antecedent into
+// `derivationBacking` (consumed by the parser to build derivation premises)
+// and keeps only the normal antecedents in the freeform implication. A
+// relation left with no normal antecedents is fully captured by the backing
+// and emits no freeform premise. A relation whose consequent is itself
+// citation/axiomatic, or whose antecedent can't be resolved to a known
+// claim type, is dropped with a recorded warning — a bad relation degrades
+// to "premise omitted", never to a failed import.
 //
-// We emit a `ProcessingFailure` (severity `error`) when a relation's
-// `sources` or `target` cannot be resolved to a variable symbol. The
-// failing relation's premise is dropped from the output (we can't
-// compile it without symbols).
+// The conclusion-premise mapping rule:
+//   - When `conclusion-selection.conclusionMiniId` is non-null AND the
+//     claim resolves to a variable symbol: one premise is minted with
+//     `roleHint: "conclusion"` and `formula: <the claim's symbol>`.
+//   - Otherwise `conclusionPremiseMiniId` is null.
 import { STAGE_IDS, FormulaCompilationOutputSchema, } from "./schemas.js";
 import { deterministicStage } from "../../../../lib/pipelines/stage-helpers.js";
 export const FORMULA_COMPILATION_FAILURE_CODES = {
-    unresolvedSource: "FORMULA_COMPILATION_SOURCE_UNRESOLVED",
-    unresolvedTarget: "FORMULA_COMPILATION_TARGET_UNRESOLVED",
+    unresolvedAntecedent: "FORMULA_COMPILATION_ANTECEDENT_UNRESOLVED",
+    unresolvedConsequent: "FORMULA_COMPILATION_CONSEQUENT_UNRESOLVED",
     unresolvedConclusion: "FORMULA_COMPILATION_CONCLUSION_UNRESOLVED",
-    emptySources: "FORMULA_COMPILATION_SOURCES_EMPTY",
+    emptyAntecedents: "FORMULA_COMPILATION_ANTECEDENTS_EMPTY",
 };
+// Claim types that may only ground a derivation premise — never sit in a
+// freeform premise. An inference antecedent of one of these types is
+// extracted into derivation backing instead of the freeform formula.
+const DERIVATION_ONLY_CLAIM_TYPES = new Set(["citation", "axiomatic"]);
+export const RELATION_PLACEMENT_FAILURE_CODES = {
+    droppedTypedConsequent: "RELATION_PLACEMENT_DROPPED_TYPED_CONSEQUENT",
+    droppedUnresolvedClaim: "RELATION_PLACEMENT_DROPPED_UNRESOLVED_CLAIM",
+    droppedEmptyAntecedents: "RELATION_PLACEMENT_DROPPED_EMPTY_ANTECEDENTS",
+};
+/**
+ * Resolve each claim's effective type into a `miniId → type` map,
+ * preferring the `claim-type-classification` entry and falling back to the
+ * canonicalizer's drafted `type`. This is the SAME resolution
+ * `finalizeResponseV2` uses, so the sort and finalize never disagree on
+ * whether a claim is citation/axiomatic — a disagreement is exactly what
+ * would let a citation slip into a freeform premise.
+ */
+export function resolveClaimTypes(input) {
+    const byMiniId = new Map();
+    for (const claim of input.canonicalClaims) {
+        byMiniId.set(claim.miniId, claim.type);
+    }
+    for (const entry of input.classifications) {
+        byMiniId.set(entry.miniId, entry.type);
+    }
+    return byMiniId;
+}
+/**
+ * Deterministically sort inference relations into freeform premises and
+ * derivation backing. For each relation:
+ *  - drop (warn) if the consequent is citation/axiomatic — a typed claim
+ *    cannot be the consequent of an implication;
+ *  - dedupe antecedents and drop a self-referential antecedent;
+ *  - drop (warn) the whole relation if any antecedent's type can't be
+ *    resolved — never silently treat an unresolved id as `normal`;
+ *  - route citation/axiomatic antecedents into `derivationBacking`;
+ *  - keep the normal antecedents as the freeform implication; if none
+ *    remain, the relation is fully captured by the backing and yields no
+ *    freeform premise.
+ */
+export function sortInferenceRelations(input) {
+    const emit = input.addFailure ?? (() => undefined);
+    const freeformRelations = [];
+    const derivationBacking = new Map();
+    const addBacking = (consequent, supporter) => {
+        const list = derivationBacking.get(consequent) ?? [];
+        if (!list.includes(supporter))
+            list.push(supporter);
+        derivationBacking.set(consequent, list);
+    };
+    for (const relation of input.relations) {
+        const consequentType = input.typeByClaimMiniId.get(relation.consequent);
+        if (consequentType === undefined) {
+            emit({
+                code: RELATION_PLACEMENT_FAILURE_CODES.droppedUnresolvedClaim,
+                message: `Relation "${relation.relationId}" consequent "${relation.consequent}" has no resolvable claim type; dropping.`,
+                severity: "warning",
+                context: {
+                    relationId: relation.relationId,
+                    claimMiniId: relation.consequent,
+                },
+            });
+            continue;
+        }
+        if (DERIVATION_ONLY_CLAIM_TYPES.has(consequentType)) {
+            emit({
+                code: RELATION_PLACEMENT_FAILURE_CODES.droppedTypedConsequent,
+                message: `Relation "${relation.relationId}" has a ${consequentType} consequent; citation/axiomatic claims cannot be an implication's consequent. Dropping.`,
+                severity: "warning",
+                context: {
+                    relationId: relation.relationId,
+                    consequent: relation.consequent,
+                    consequentType,
+                },
+            });
+            continue;
+        }
+        // Dedupe antecedents and drop any self-reference to the consequent.
+        const antecedents = [...new Set(relation.antecedents)].filter((a) => a !== relation.consequent);
+        if (antecedents.length === 0) {
+            emit({
+                code: RELATION_PLACEMENT_FAILURE_CODES.droppedEmptyAntecedents,
+                message: `Relation "${relation.relationId}" has no usable antecedents; dropping.`,
+                severity: "warning",
+                context: { relationId: relation.relationId },
+            });
+            continue;
+        }
+        const normalAntecedents = [];
+        const typedAntecedents = [];
+        let unresolved = false;
+        for (const antecedent of antecedents) {
+            const type = input.typeByClaimMiniId.get(antecedent);
+            if (type === undefined) {
+                emit({
+                    code: RELATION_PLACEMENT_FAILURE_CODES.droppedUnresolvedClaim,
+                    message: `Relation "${relation.relationId}" antecedent "${antecedent}" has no resolvable claim type; dropping the relation rather than treating it as normal.`,
+                    severity: "warning",
+                    context: {
+                        relationId: relation.relationId,
+                        claimMiniId: antecedent,
+                    },
+                });
+                unresolved = true;
+                break;
+            }
+            if (DERIVATION_ONLY_CLAIM_TYPES.has(type)) {
+                typedAntecedents.push(antecedent);
+            }
+            else {
+                normalAntecedents.push(antecedent);
+            }
+        }
+        if (unresolved)
+            continue;
+        for (const supporter of typedAntecedents) {
+            addBacking(relation.consequent, supporter);
+        }
+        if (normalAntecedents.length === 0) {
+            // Fully captured by derivation backing; no freeform premise.
+            continue;
+        }
+        freeformRelations.push({
+            relationId: relation.relationId,
+            antecedents: normalAntecedents,
+            consequent: relation.consequent,
+        });
+    }
+    return { freeformRelations, derivationBacking };
+}
 function buildClaimToSymbol(variables) {
     const m = new Map();
     for (const v of variables) {
@@ -36,94 +169,71 @@ function buildClaimToSymbol(variables) {
     }
     return m;
 }
-function relationToRoleHint(type) {
-    switch (type) {
-        case "support":
-            return "support";
-        case "joint-support":
-            return "joint-support";
-        case "derivation-support":
-            return "derivation";
-    }
-}
 /**
- * Pure helper exposed for direct testing.
+ * Compile freeform relations into premise formulas, and mint the
+ * conclusion premise. Pure helper exposed for direct testing. The stage's
+ * `derivationBacking` is added by the stage wrapper, not here.
  */
 export function compileFormulas(input) {
     const claimToSymbol = buildClaimToSymbol(input.variables);
-    const noopEmit = () => {
-        // intentionally empty — tests can supply addFailure to capture emits
-    };
-    const emit = input.addFailure ?? noopEmit;
+    const emit = input.addFailure ?? (() => undefined);
     const premises = [];
-    // Compile each relation into a premise.
-    for (const relation of input.relations) {
-        if (relation.sources.length === 0) {
+    for (const relation of input.freeformRelations) {
+        if (relation.antecedents.length === 0) {
             emit({
-                code: FORMULA_COMPILATION_FAILURE_CODES.emptySources,
-                message: `Relation "${relation.relationId}" has no sources; cannot compile.`,
+                code: FORMULA_COMPILATION_FAILURE_CODES.emptyAntecedents,
+                message: `Relation "${relation.relationId}" has no antecedents; cannot compile.`,
                 severity: "warning",
                 context: { relationId: relation.relationId },
             });
             continue;
         }
-        const targetSymbol = claimToSymbol.get(relation.target);
-        if (!targetSymbol) {
+        const consequentSymbol = claimToSymbol.get(relation.consequent);
+        if (!consequentSymbol) {
             emit({
-                code: FORMULA_COMPILATION_FAILURE_CODES.unresolvedTarget,
-                message: `Relation "${relation.relationId}" target claim "${relation.target}" has no variable assignment; dropping.`,
+                code: FORMULA_COMPILATION_FAILURE_CODES.unresolvedConsequent,
+                message: `Relation "${relation.relationId}" consequent claim "${relation.consequent}" has no variable assignment; dropping.`,
                 severity: "error",
                 context: {
                     relationId: relation.relationId,
-                    targetClaimMiniId: relation.target,
+                    consequentClaimMiniId: relation.consequent,
                 },
             });
             continue;
         }
-        const sourceSymbols = [];
-        let sourcesOk = true;
-        for (const src of relation.sources) {
-            const sym = claimToSymbol.get(src);
+        const antecedentSymbols = [];
+        let antecedentsOk = true;
+        for (const antecedent of relation.antecedents) {
+            const sym = claimToSymbol.get(antecedent);
             if (!sym) {
                 emit({
-                    code: FORMULA_COMPILATION_FAILURE_CODES.unresolvedSource,
-                    message: `Relation "${relation.relationId}" source claim "${src}" has no variable assignment; dropping.`,
+                    code: FORMULA_COMPILATION_FAILURE_CODES.unresolvedAntecedent,
+                    message: `Relation "${relation.relationId}" antecedent claim "${antecedent}" has no variable assignment; dropping.`,
                     severity: "error",
                     context: {
                         relationId: relation.relationId,
-                        sourceClaimMiniId: src,
+                        antecedentClaimMiniId: antecedent,
                     },
                 });
-                sourcesOk = false;
+                antecedentsOk = false;
                 break;
             }
-            sourceSymbols.push(sym);
+            antecedentSymbols.push(sym);
         }
-        if (!sourcesOk)
+        if (!antecedentsOk)
             continue;
-        let formula;
-        if (relation.type === "joint-support" && sourceSymbols.length > 1) {
-            formula = `(${sourceSymbols.join(" and ")}) implies ${targetSymbol}`;
-        }
-        else if (sourceSymbols.length === 1) {
-            formula = `${sourceSymbols[0]} implies ${targetSymbol}`;
-        }
-        else {
-            // joint-support with exactly one source — degenerate; still
-            // compile as a plain support implication (the parens would
-            // be redundant). joint-support with zero sources is caught
-            // by the emptySources guard above.
-            formula = `${sourceSymbols.join(" and ")} implies ${targetSymbol}`;
-        }
+        const formula = antecedentSymbols.length > 1
+            ? `(${antecedentSymbols.join(" and ")}) implies ${consequentSymbol}`
+            : `${antecedentSymbols[0]} implies ${consequentSymbol}`;
         premises.push({
             premiseMiniId: input.generateId(),
             formula,
-            roleHint: relationToRoleHint(relation.type),
+            roleHint: "freeform",
             sourceRelationId: relation.relationId,
         });
     }
-    // Mint the conclusion premise iff conclusion-selection chose a
-    // claim AND the claim resolves to a known variable symbol.
+    // Mint the conclusion premise iff conclusion-selection chose a claim
+    // AND the claim resolves to a known variable symbol.
     let conclusionPremiseMiniId = null;
     const conclusionClaimMiniId = input.conclusion?.conclusionMiniId ?? null;
     if (conclusionClaimMiniId !== null) {
@@ -156,6 +266,7 @@ export const formulaCompilationStage = deterministicStage({
         STAGE_IDS.conclusionSelection,
         STAGE_IDS.variableAssignment,
         STAGE_IDS.claimTypeClassification,
+        STAGE_IDS.claimCanonicalization,
     ],
     outputSchema: FormulaCompilationOutputSchema,
     fn: (ctx) => {
@@ -163,13 +274,30 @@ export const formulaCompilationStage = deterministicStage({
         const relations = relationEnvelope?.relations ?? [];
         const conclusion = ctx.get(STAGE_IDS.conclusionSelection);
         const variables = ctx.get(STAGE_IDS.variableAssignment) ?? [];
-        return compileFormulas({
+        const typeEnvelope = ctx.get(STAGE_IDS.claimTypeClassification);
+        const canon = ctx.get(STAGE_IDS.claimCanonicalization);
+        const { freeformRelations, derivationBacking } = sortInferenceRelations({
             relations,
+            typeByClaimMiniId: resolveClaimTypes({
+                classifications: typeEnvelope?.classifications ?? [],
+                canonicalClaims: canon?.canonicalClaims ?? [],
+            }),
+            addFailure: ctx.addFailure,
+        });
+        const compiled = compileFormulas({
+            freeformRelations,
             conclusion,
             variables,
             generateId: ctx.generateId,
             addFailure: ctx.addFailure,
         });
+        return {
+            ...compiled,
+            derivationBacking: [...derivationBacking.entries()].map(([derivedClaimMiniId, supportingClaimMiniIds]) => ({
+                derivedClaimMiniId,
+                supportingClaimMiniIds,
+            })),
+        };
     },
 });
 //# sourceMappingURL=formula-compilation.js.map

package/dist/extensions/pipelines/base/stages/formula-compilation.js.map

@@ -1 +1 @@
-{"version":3,"file":"formula-compilation.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/formula-compilation.ts"],"names":[],"mappings":"AAAA,iEAAiE;AACjE,gEAAgE;AAChE,qEAAqE;AACrE,0DAA0D;AAC1D,EAAE;AACF,iCAAiC;AACjC,mEAAmE;AACnE,8EAA8E;AAC9E,mEAAmE;AACnE,EAAE;AACF,uCAAuC;AACvC,gEAAgE;AAChE,sEAAsE;AACtE,uDAAuD;AACvD,kEAAkE;AAClE,0DAA0D;AAC1D,sEAAsE;AACtE,4DAA4D;AAC5D,EAAE;AACF,qEAAqE;AACrE,qEAAqE;AACrE,kEAAkE;AAClE,+BAA+B;AAE/B,OAAO,EACH,SAAS,EACT,8BAA8B,GAMjC,MAAM,cAAc,CAAA;AACrB,OAAO,EAAE,kBAAkB,EAAE,MAAM,4CAA4C,CAAA;AAG/E,MAAM,CAAC,MAAM,iCAAiC,GAAG;IAC7C,gBAAgB,EAAE,uCAAuC;IACzD,gBAAgB,EAAE,uCAAuC;IACzD,oBAAoB,EAAE,2CAA2C;IACjE,YAAY,EAAE,mCAAmC;CAC3C,CAAA;AAgBV,SAAS,kBAAkB,CACvB,SAAoC;IAEpC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAkB,CAAA;IACnC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QACxB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;IAClC,CAAC;IACD,OAAO,CAAC,CAAA;AACZ,CAAC;AAED,SAAS,kBAAkB,CACvB,IAAwD;IAExD,QAAQ,IAAI,EAAE,CAAC;QACX,KAAK,SAAS;YACV,OAAO,SAAS,CAAA;QACpB,KAAK,eAAe;YAChB,OAAO,eAAe,CAAA;QAC1B,KAAK,oBAAoB;YACrB,OAAO,YAAY,CAAA;IAC3B,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC3B,KAA4B;IAE5B,MAAM,aAAa,GAAG,kBAAkB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;IACzD,MAAM,QAAQ,GAAqD,GAAG,EAAE;QACpE,qEAAqE;IACzE,CAAC,CAAA;IACD,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,IAAI,QAAQ,CAAA;IAEzC,MAAM,QAAQ,GAA0C,EAAE,CAAA;IAE1D,wCAAwC;IACxC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACrC,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC;gBACD,IAAI,EAAE,iCAAiC,CAAC,YAAY;gBACpD,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,mCAAmC;gBAC5E,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE;aAC/C,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;QACvD,IAAI,CAAC,YAAY,EAAE,CAAC;YAChB,IAAI,CAAC;gBACD,IAAI,EAAE,iCAAiC,CAAC,gBAAgB;gBACxD,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,mBAAmB,QAAQ,CAAC,MAAM,yCAAyC;gBACpH,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE;oBACL,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,iBAAiB,EAAE,QAAQ,CAAC,MAAM;iBACrC;aACJ,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,MAAM,aAAa,GAAa,EAAE,CAAA;QAClC,IAAI,SAAS,GAAG,IAAI,CAAA;QACpB,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAClC,IAAI,CAAC,GAAG,EAAE,CAAC;gBACP,IAAI,CAAC;oBACD,IAAI,EAAE,iCAAiC,CAAC,gBAAgB;oBACxD,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,mBAAmB,GAAG,yCAAyC;oBACxG,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE;wBACL,UAAU,EAAE,QAAQ,CAAC,UAAU;wBAC/B,iBAAiB,EAAE,GAAG;qBACzB;iBACJ,CAAC,CAAA;gBACF,SAAS,GAAG,KAAK,CAAA;gBACjB,MAAK;YACT,CAAC;YACD,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC3B,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,SAAQ;QAExB,IAAI,OAAe,CAAA;QACnB,IAAI,QAAQ,CAAC,IAAI,KAAK,eAAe,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChE,OAAO,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,YAAY,EAAE,CAAA;QACxE,CAAC;aAAM,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpC,OAAO,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE,CAAA;QAC3D,CAAC;aAAM,CAAC;YACJ,4DAA4D;YAC5D,2DAA2D;YAC3D,2DAA2D;YAC3D,mCAAmC;YACnC,OAAO,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,YAAY,EAAE,CAAA;QACtE,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC;YACV,aAAa,EAAE,KAAK,CAAC,UAAU,EAAE;YACjC,OAAO;YACP,QAAQ,EAAE,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC;YAC3C,gBAAgB,EAAE,QAAQ,CAAC,UAAU;SACxC,CAAC,CAAA;IACN,CAAC;IAED,+DAA+D;IAC/D,2DAA2D;IAC3D,IAAI,uBAAuB,GAAkB,IAAI,CAAA;IACjD,MAAM,qBAAqB,GAAG,KAAK,CAAC,UAAU,EAAE,gBAAgB,IAAI,IAAI,CAAA;IACxE,IAAI,qBAAqB,KAAK,IAAI,EAAE,CAAC;QACjC,MAAM,gBAAgB,GAAG,aAAa,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAA;QACjE,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACpB,IAAI,CAAC;gBACD,IAAI,EAAE,iCAAiC,CAAC,oBAAoB;gBAC5D,OAAO,EAAE,qBAAqB,qBAAqB,+DAA+D;gBAClH,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,EAAE,qBAAqB,EAAE;aACrC,CAAC,CAAA;QACN,CAAC;aAAM,CAAC;YACJ,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,EAAE,CAAA;YAC7B,QAAQ,CAAC,IAAI,CAAC;gBACV,aAAa,EAAE,EAAE;gBACjB,OAAO,EAAE,gBAAgB;gBACzB,QAAQ,EAAE,YAAY;gBACtB,gBAAgB,EAAE,IAAI;aACzB,CAAC,CAAA;YACF,uBAAuB,GAAG,EAAE,CAAA;QAChC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,uBAAuB,EAAE,CAAA;AAChD,CAAC;AAED,MAAM,CAAC,MAAM,uBAAuB,GAChC,kBAAkB,CAA4B;IAC1C,EAAE,EAAE,SAAS,CAAC,kBAAkB;IAChC,SAAS,EAAE;QACP,SAAS,CAAC,kBAAkB;QAC5B,SAAS,CAAC,mBAAmB;QAC7B,SAAS,CAAC,kBAAkB;QAC5B,SAAS,CAAC,uBAAuB;KACpC;IACD,YAAY,EAAE,8BAA8B;IAC5C,EAAE,EAAE,CAAC,GAAkB,EAAE,EAAE;QACvB,MAAM,gBAAgB,GAAG,GAAG,CAAC,GAAG,CAC5B,SAAS,CAAC,kBAAkB,CAC/B,CAAA;QACD,MAAM,SAAS,GAAG,gBAAgB,EAAE,SAAS,IAAI,EAAE,CAAA;QACnD,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CACtB,SAAS,CAAC,mBAAmB,CAChC,CAAA;QACD,MAAM,SAAS,GACX,GAAG,CAAC,GAAG,CACH,SAAS,CAAC,kBAAkB,CAC/B,IAAI,EAAE,CAAA;QACX,OAAO,eAAe,CAAC;YACnB,SAAS;YACT,UAAU;YACV,SAAS;YACT,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,UAAU,EAAE,GAAG,CAAC,UAAU;SAC7B,CAAC,CAAA;IACN,CAAC;CACJ,CAAC,CAAA"}
+{"version":3,"file":"formula-compilation.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/formula-compilation.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,0EAA0E;AAC1E,oEAAoE;AACpE,yEAAyE;AACzE,+CAA+C;AAC/C,EAAE;AACF,kCAAkC;AAClC,wEAAwE;AACxE,8DAA8D;AAC9D,EAAE;AACF,uEAAuE;AACvE,+DAA+D;AAC/D,2EAA2E;AAC3E,4EAA4E;AAC5E,uEAAuE;AACvE,4EAA4E;AAC5E,uEAAuE;AACvE,uEAAuE;AACvE,2EAA2E;AAC3E,kDAAkD;AAClD,EAAE;AACF,uCAAuC;AACvC,uEAAuE;AACvE,sEAAsE;AACtE,oEAAoE;AACpE,mDAAmD;AAEnD,OAAO,EACH,SAAS,EACT,8BAA8B,GASjC,MAAM,cAAc,CAAA;AACrB,OAAO,EAAE,kBAAkB,EAAE,MAAM,4CAA4C,CAAA;AAG/E,MAAM,CAAC,MAAM,iCAAiC,GAAG;IAC7C,oBAAoB,EAAE,2CAA2C;IACjE,oBAAoB,EAAE,2CAA2C;IACjE,oBAAoB,EAAE,2CAA2C;IACjE,gBAAgB,EAAE,uCAAuC;CACnD,CAAA;AAEV,yEAAyE;AACzE,qEAAqE;AACrE,qEAAqE;AACrE,MAAM,2BAA2B,GAAG,IAAI,GAAG,CAEzC,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAAA;AAE5B,MAAM,CAAC,MAAM,gCAAgC,GAAG;IAC5C,sBAAsB,EAAE,6CAA6C;IACrE,sBAAsB,EAAE,6CAA6C;IACrE,uBAAuB,EAAE,8CAA8C;CACjE,CAAA;AASV;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAMjC;IACG,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiD,CAAA;IACzE,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;QACxC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;IAC1C,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;QACxC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;IAC1C,CAAC;IACD,OAAO,QAAQ,CAAA;AACnB,CAAC;AAkBD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAItC;IACG,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAA;IAClD,MAAM,iBAAiB,GAAwB,EAAE,CAAA;IACjD,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAoB,CAAA;IAErD,MAAM,UAAU,GAAG,CAAC,UAAkB,EAAE,SAAiB,EAAE,EAAE;QACzD,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAA;QACpD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACnD,iBAAiB,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;IAC3C,CAAC,CAAA;IAED,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACrC,MAAM,cAAc,GAAG,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAA;QACvE,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC;gBACD,IAAI,EAAE,gCAAgC,CAAC,sBAAsB;gBAC7D,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,iBAAiB,QAAQ,CAAC,UAAU,2CAA2C;gBACxH,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE;oBACL,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,WAAW,EAAE,QAAQ,CAAC,UAAU;iBACnC;aACJ,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,IAAI,2BAA2B,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC;gBACD,IAAI,EAAE,gCAAgC,CAAC,sBAAsB;gBAC7D,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,WAAW,cAAc,yFAAyF;gBAC3J,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE;oBACL,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,cAAc;iBACjB;aACJ,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QAED,oEAAoE;QACpE,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CACzD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,UAAU,CACnC,CAAA;QACD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC;gBACD,IAAI,EAAE,gCAAgC,CAAC,uBAAuB;gBAC9D,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,wCAAwC;gBACjF,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE;aAC/C,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QAED,MAAM,iBAAiB,GAAa,EAAE,CAAA;QACtC,MAAM,gBAAgB,GAAa,EAAE,CAAA;QACrC,IAAI,UAAU,GAAG,KAAK,CAAA;QACtB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YACpD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACrB,IAAI,CAAC;oBACD,IAAI,EAAE,gCAAgC,CAAC,sBAAsB;oBAC7D,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,iBAAiB,UAAU,0FAA0F;oBAC9J,QAAQ,EAAE,SAAS;oBACnB,OAAO,EAAE;wBACL,UAAU,EAAE,QAAQ,CAAC,UAAU;wBAC/B,WAAW,EAAE,UAAU;qBAC1B;iBACJ,CAAC,CAAA;gBACF,UAAU,GAAG,IAAI,CAAA;gBACjB,MAAK;YACT,CAAC;YACD,IAAI,2BAA2B,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YACrC,CAAC;iBAAM,CAAC;gBACJ,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YACtC,CAAC;QACL,CAAC;QACD,IAAI,UAAU;YAAE,SAAQ;QAExB,KAAK,MAAM,SAAS,IAAI,gBAAgB,EAAE,CAAC;YACvC,UAAU,CAAC,QAAQ,CAAC,UAAU,EAAE,SAAS,CAAC,CAAA;QAC9C,CAAC;QAED,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,6DAA6D;YAC7D,SAAQ;QACZ,CAAC;QACD,iBAAiB,CAAC,IAAI,CAAC;YACnB,UAAU,EAAE,QAAQ,CAAC,UAAU;YAC/B,WAAW,EAAE,iBAAiB;YAC9B,UAAU,EAAE,QAAQ,CAAC,UAAU;SAClC,CAAC,CAAA;IACN,CAAC;IAED,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,CAAA;AACnD,CAAC;AAUD,SAAS,kBAAkB,CACvB,SAAoC;IAEpC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAkB,CAAA;IACnC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QACxB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;IAClC,CAAC;IACD,OAAO,CAAC,CAAA;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAC3B,KAA4B;IAE5B,MAAM,aAAa,GAAG,kBAAkB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;IACzD,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAA;IAElD,MAAM,QAAQ,GAA0C,EAAE,CAAA;IAE1D,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;QAC7C,IAAI,QAAQ,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC;gBACD,IAAI,EAAE,iCAAiC,CAAC,gBAAgB;gBACxD,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,uCAAuC;gBAChF,QAAQ,EAAE,SAAS;gBACnB,OAAO,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE;aAC/C,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,MAAM,gBAAgB,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAA;QAC/D,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACpB,IAAI,CAAC;gBACD,IAAI,EAAE,iCAAiC,CAAC,oBAAoB;gBAC5D,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,uBAAuB,QAAQ,CAAC,UAAU,yCAAyC;gBAC5H,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE;oBACL,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,qBAAqB,EAAE,QAAQ,CAAC,UAAU;iBAC7C;aACJ,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,MAAM,iBAAiB,GAAa,EAAE,CAAA;QACtC,IAAI,aAAa,GAAG,IAAI,CAAA;QACxB,KAAK,MAAM,UAAU,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;YAC5C,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YACzC,IAAI,CAAC,GAAG,EAAE,CAAC;gBACP,IAAI,CAAC;oBACD,IAAI,EAAE,iCAAiC,CAAC,oBAAoB;oBAC5D,OAAO,EAAE,aAAa,QAAQ,CAAC,UAAU,uBAAuB,UAAU,yCAAyC;oBACnH,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE;wBACL,UAAU,EAAE,QAAQ,CAAC,UAAU;wBAC/B,qBAAqB,EAAE,UAAU;qBACpC;iBACJ,CAAC,CAAA;gBACF,aAAa,GAAG,KAAK,CAAA;gBACrB,MAAK;YACT,CAAC;YACD,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC/B,CAAC;QACD,IAAI,CAAC,aAAa;YAAE,SAAQ;QAE5B,MAAM,OAAO,GACT,iBAAiB,CAAC,MAAM,GAAG,CAAC;YACxB,CAAC,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,gBAAgB,EAAE;YACpE,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,YAAY,gBAAgB,EAAE,CAAA;QAE/D,QAAQ,CAAC,IAAI,CAAC;YACV,aAAa,EAAE,KAAK,CAAC,UAAU,EAAE;YACjC,OAAO;YACP,QAAQ,EAAE,UAAU;YACpB,gBAAgB,EAAE,QAAQ,CAAC,UAAU;SACxC,CAAC,CAAA;IACN,CAAC;IAED,qEAAqE;IACrE,qDAAqD;IACrD,IAAI,uBAAuB,GAAkB,IAAI,CAAA;IACjD,MAAM,qBAAqB,GAAG,KAAK,CAAC,UAAU,EAAE,gBAAgB,IAAI,IAAI,CAAA;IACxE,IAAI,qBAAqB,KAAK,IAAI,EAAE,CAAC;QACjC,MAAM,gBAAgB,GAAG,aAAa,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAA;QACjE,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACpB,IAAI,CAAC;gBACD,IAAI,EAAE,iCAAiC,CAAC,oBAAoB;gBAC5D,OAAO,EAAE,qBAAqB,qBAAqB,+DAA+D;gBAClH,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,EAAE,qBAAqB,EAAE;aACrC,CAAC,CAAA;QACN,CAAC;aAAM,CAAC;YACJ,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,EAAE,CAAA;YAC7B,QAAQ,CAAC,IAAI,CAAC;gBACV,aAAa,EAAE,EAAE;gBACjB,OAAO,EAAE,gBAAgB;gBACzB,QAAQ,EAAE,YAAY;gBACtB,gBAAgB,EAAE,IAAI;aACzB,CAAC,CAAA;YACF,uBAAuB,GAAG,EAAE,CAAA;QAChC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,uBAAuB,EAAE,CAAA;AAChD,CAAC;AAED,MAAM,CAAC,MAAM,uBAAuB,GAChC,kBAAkB,CAA4B;IAC1C,EAAE,EAAE,SAAS,CAAC,kBAAkB;IAChC,SAAS,EAAE;QACP,SAAS,CAAC,kBAAkB;QAC5B,SAAS,CAAC,mBAAmB;QAC7B,SAAS,CAAC,kBAAkB;QAC5B,SAAS,CAAC,uBAAuB;QACjC,SAAS,CAAC,qBAAqB;KAClC;IACD,YAAY,EAAE,8BAA8B;IAC5C,EAAE,EAAE,CAAC,GAAkB,EAAE,EAAE;QACvB,MAAM,gBAAgB,GAAG,GAAG,CAAC,GAAG,CAC5B,SAAS,CAAC,kBAAkB,CAC/B,CAAA;QACD,MAAM,SAAS,GAAG,gBAAgB,EAAE,SAAS,IAAI,EAAE,CAAA;QACnD,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CACtB,SAAS,CAAC,mBAAmB,CAChC,CAAA;QACD,MAAM,SAAS,GACX,GAAG,CAAC,GAAG,CACH,SAAS,CAAC,kBAAkB,CAC/B,IAAI,EAAE,CAAA;QACX,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CACxB,SAAS,CAAC,uBAAuB,CACpC,CAAA;QACD,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CACjB,SAAS,CAAC,qBAAqB,CAClC,CAAA;QACD,MAAM,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,GAC1C,sBAAsB,CAAC;YACnB,SAAS;YACT,iBAAiB,EAAE,iBAAiB,CAAC;gBACjC,eAAe,EAAE,YAAY,EAAE,eAAe,IAAI,EAAE;gBACpD,eAAe,EAAE,KAAK,EAAE,eAAe,IAAI,EAAE;aAChD,CAAC;YACF,UAAU,EAAE,GAAG,CAAC,UAAU;SAC7B,CAAC,CAAA;QACN,MAAM,QAAQ,GAAG,eAAe,CAAC;YAC7B,iBAAiB;YACjB,UAAU;YACV,SAAS;YACT,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,UAAU,EAAE,GAAG,CAAC,UAAU;SAC7B,CAAC,CAAA;QACF,OAAO;YACH,GAAG,QAAQ;YACX,iBAAiB,EAAE,CAAC,GAAG,iBAAiB,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CACnD,CAAC,CAAC,kBAAkB,EAAE,sBAAsB,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC/C,kBAAkB;gBAClB,sBAAsB;aACzB,CAAC,CACL;SACJ,CAAA;IACL,CAAC;CACJ,CAAC,CAAA"}

package/dist/extensions/pipelines/base/stages/relation-extraction.d.ts

@@ -3,7 +3,7 @@ import type { TStage } from "../../../../lib/pipelines/types.js";
 import type { TLlmStageOptionsOverride } from "../types.js";
 export declare const RELATION_EXTRACTION_MODEL = "gpt-5.5";
 export declare const RELATION_EXTRACTION_REASONING: "minimal" | "low" | "medium" | "high";
-export declare const RELATION_EXTRACTION_SYSTEM_PROMPT = "You identify support relationships between canonical claims in an argument.\n\nGiven the canonical claim set, the per-claim type map, and the original segments, emit one entry per supporting relationship. Return an object with a single key `relations` whose value is the array. There are three relation kinds:\n\n- `\"support\"` \u2014 a single claim S supports another claim T. Use this for ordinary \"P, therefore Q\" support edges where the supporting evidence is a single normal-typed proposition.\n- `\"joint-support\"` \u2014 multiple claims S1, S2, ... jointly support T. Use this when the author commits to a syllogistic step that requires ALL of the sources to hold (e.g. major premise + minor premise \u2192 conclusion).\n- `\"derivation-support\"` \u2014 a citation-typed or axiomatic-typed claim S supports a normal-typed claim T. Use this exclusively for relations whose source is \"citation\" or \"axiomatic\". The shape is otherwise identical to `\"support\"`.\n\nFor each relation emit:\n- a fresh `relationId` (r1, r2, ...)\n- the `type`\n- `sources` \u2014 an array of supporting claim miniIds (length 1 for support and derivation-support; length \u2265 2 for joint-support)\n- `target` \u2014 the supported claim's miniId\n- `evidence.segmentIds` \u2014 the segments that ground the relation (often a single segment containing a \"therefore\", \"so\", \"because\")\n- `evidence.quote` \u2014 a short verbatim quote from the input that justifies the relation\n\n## Conservatism rules\n\n- Do not invent relations. If the author doesn't actually argue from S to T, don't emit a relation between them.\n- Do not double-count. If two claims share an axiomatic backing, that's one derivation-support relation per claim, not a joint-support pair.\n- The conclusion of the argument is identified in a separate stage; do NOT emit a special \"conclusion\" relation here. Just emit the support edges you see; the conclusion stage selects from your output.\n- Avoid attack/rebuttal relations entirely in this MVP \u2014 the pipeline does not yet handle them.\n\nIf there are no relations to emit, return `{ \"relations\": [] }`.";
+export declare const RELATION_EXTRACTION_SYSTEM_PROMPT = "You identify inference relationships between canonical claims in an argument.\n\nGiven the canonical claim set, the per-claim type map, and the original segments, emit one entry per inference. Return an object with a single key `relations` whose value is the array.\n\nAn `inference` relation says: the claims in `antecedents`, taken together, imply the claim in `consequent`. Use a SINGLE antecedent for an ordinary \"P, therefore Q\" step; use MULTIPLE antecedents when the author commits to a step that requires ALL of them to hold together (e.g. major premise + minor premise \u2192 conclusion).\n\nFor each relation emit:\n- a fresh `relationId` (r1, r2, ...)\n- `type` \u2014 always `\"inference\"`\n- `antecedents` \u2014 an array of the supporting claim miniIds (one or more) whose conjunction implies the consequent\n- `consequent` \u2014 the implied claim's miniId\n- `evidence.segmentIds` \u2014 the segments that ground the relation (often a single segment containing a \"therefore\", \"so\", \"because\")\n- `evidence.quote` \u2014 a short verbatim quote from the input that justifies the relation\n\n`antecedents` and `consequent` are CLAIM miniIds \u2014 NOT source citations. A citation-typed or axiomatic-typed claim may appear in `antecedents` (the pipeline routes it to where it belongs); do not special-case it. A citation/axiomatic claim is never a `consequent`.\n\n## Conservatism rules\n\n- Do not invent relations. If the author doesn't actually argue from the antecedents to the consequent, don't emit a relation.\n- Do not double-count. If several claims share the same backing, emit one relation per consequent, not a redundant pairing.\n- The conclusion of the argument is identified in a separate stage; do NOT emit a special \"conclusion\" relation here. Just emit the inference edges you see; the conclusion stage selects from your output.\n- Avoid attack/rebuttal relations entirely for now \u2014 the pipeline does not yet handle them.\n\nIf there are no relations to emit, return `{ \"relations\": [] }`.";
 /** Internal default knobs for the relation-extraction stage. */
 export declare const RELATION_EXTRACTION_STAGE_DEFAULTS: TLlmStageOptionsOverride;
 /** Build the relation-extraction stage with optional caller overrides. */

package/dist/extensions/pipelines/base/stages/relation-extraction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"relation-extraction.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/relation-extraction.ts"],"names":[],"mappings":"AASA,OAAO,EAMH,KAAK,yBAAyB,EAEjC,MAAM,cAAc,CAAA;AAErB,OAAO,KAAK,EAAE,MAAM,EAAiB,MAAM,oCAAoC,CAAA;AAC/E,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAA;AAE3D,eAAO,MAAM,yBAAyB,YAAY,CAAA;AAClD,eAAO,MAAM,6BAA6B,EACpC,SAAS,GACT,KAAK,GACL,QAAQ,GACR,MAAe,CAAA;AAErB,eAAO,MAAM,iCAAiC,6lEAuBqB,CAAA;AAuCnE,gEAAgE;AAChE,eAAO,MAAM,kCAAkC,EAAE,wBAGhD,CAAA;AAED,0EAA0E;AAC1E,wBAAgB,6BAA6B,CACzC,OAAO,CAAC,EAAE,wBAAwB,GACnC,MAAM,CAAC,yBAAyB,CAAC,CAgBnC;AAED,iDAAiD;AACjD,eAAO,MAAM,uBAAuB,EAAE,MAAM,CAAC,yBAAyB,CACnC,CAAA"}
+{"version":3,"file":"relation-extraction.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/relation-extraction.ts"],"names":[],"mappings":"AAUA,OAAO,EAMH,KAAK,yBAAyB,EAEjC,MAAM,cAAc,CAAA;AAErB,OAAO,KAAK,EAAE,MAAM,EAAiB,MAAM,oCAAoC,CAAA;AAC/E,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAA;AAE3D,eAAO,MAAM,yBAAyB,YAAY,CAAA;AAClD,eAAO,MAAM,6BAA6B,EACpC,SAAS,GACT,KAAK,GACL,QAAQ,GACR,MAAe,CAAA;AAErB,eAAO,MAAM,iCAAiC,2/DAuBqB,CAAA;AAuCnE,gEAAgE;AAChE,eAAO,MAAM,kCAAkC,EAAE,wBAGhD,CAAA;AAED,0EAA0E;AAC1E,wBAAgB,6BAA6B,CACzC,OAAO,CAAC,EAAE,wBAAwB,GACnC,MAAM,CAAC,yBAAyB,CAAC,CAgBnC;AAED,iDAAiD;AACjD,eAAO,MAAM,uBAAuB,EAAE,MAAM,CAAC,yBAAyB,CACnC,CAAA"}

package/dist/extensions/pipelines/base/stages/relation-extraction.js

@@ -1,37 +1,38 @@
 // `relation-extraction` — strong-reasoning stage that identifies the
-// supporting relationships between canonical claims. MVP relation
-// types: support, joint-support, derivation-support.
+// inference relationships between canonical claims. Each relation is an
+// `inference`: its `antecedents` claims, taken together, imply its
+// `consequent` claim.
 //
-// Per spec §6.4 this stage uses gpt-5.5 with reasoning_effort=high —
-// it's the most subtle judgement call in the pipeline. The output is
-// a graph; the conclusion + the support graph drive the
-// formula-compilation stage that comes next.
+// This stage uses gpt-5.5 with reasoning_effort=high — it's the most
+// subtle judgement call in the pipeline. The output is a graph; the
+// conclusion + the inference graph drive the formula-compilation stage
+// that comes next.
 import { STAGE_IDS, RelationExtractionOutputSchema, } from "./schemas.js";
 import { llmStage } from "../../../../lib/pipelines/stage-helpers.js";
 export const RELATION_EXTRACTION_MODEL = "gpt-5.5";
 export const RELATION_EXTRACTION_REASONING = "high";
-export const RELATION_EXTRACTION_SYSTEM_PROMPT = `You identify support relationships between canonical claims in an argument.
+export const RELATION_EXTRACTION_SYSTEM_PROMPT = `You identify inference relationships between canonical claims in an argument.
 
-Given the canonical claim set, the per-claim type map, and the original segments, emit one entry per supporting relationship. Return an object with a single key \`relations\` whose value is the array. There are three relation kinds:
+Given the canonical claim set, the per-claim type map, and the original segments, emit one entry per inference. Return an object with a single key \`relations\` whose value is the array.
 
-- \`"support"\` — a single claim S supports another claim T. Use this for ordinary "P, therefore Q" support edges where the supporting evidence is a single normal-typed proposition.
-- \`"joint-support"\` — multiple claims S1, S2, ... jointly support T. Use this when the author commits to a syllogistic step that requires ALL of the sources to hold (e.g. major premise + minor premise → conclusion).
-- \`"derivation-support"\` — a citation-typed or axiomatic-typed claim S supports a normal-typed claim T. Use this exclusively for relations whose source is "citation" or "axiomatic". The shape is otherwise identical to \`"support"\`.
+An \`inference\` relation says: the claims in \`antecedents\`, taken together, imply the claim in \`consequent\`. Use a SINGLE antecedent for an ordinary "P, therefore Q" step; use MULTIPLE antecedents when the author commits to a step that requires ALL of them to hold together (e.g. major premise + minor premise → conclusion).
 
 For each relation emit:
 - a fresh \`relationId\` (r1, r2, ...)
-- the \`type\`
-- \`sources\` — an array of supporting claim miniIds (length 1 for support and derivation-support; length ≥ 2 for joint-support)
-- \`target\` — the supported claim's miniId
+- \`type\` — always \`"inference"\`
+- \`antecedents\` — an array of the supporting claim miniIds (one or more) whose conjunction implies the consequent
+- \`consequent\` — the implied claim's miniId
 - \`evidence.segmentIds\` — the segments that ground the relation (often a single segment containing a "therefore", "so", "because")
 - \`evidence.quote\` — a short verbatim quote from the input that justifies the relation
 
+\`antecedents\` and \`consequent\` are CLAIM miniIds — NOT source citations. A citation-typed or axiomatic-typed claim may appear in \`antecedents\` (the pipeline routes it to where it belongs); do not special-case it. A citation/axiomatic claim is never a \`consequent\`.
+
 ## Conservatism rules
 
-- Do not invent relations. If the author doesn't actually argue from S to T, don't emit a relation between them.
-- Do not double-count. If two claims share an axiomatic backing, that's one derivation-support relation per claim, not a joint-support pair.
-- The conclusion of the argument is identified in a separate stage; do NOT emit a special "conclusion" relation here. Just emit the support edges you see; the conclusion stage selects from your output.
-- Avoid attack/rebuttal relations entirely in this MVP — the pipeline does not yet handle them.
+- Do not invent relations. If the author doesn't actually argue from the antecedents to the consequent, don't emit a relation.
+- Do not double-count. If several claims share the same backing, emit one relation per consequent, not a redundant pairing.
+- The conclusion of the argument is identified in a separate stage; do NOT emit a special "conclusion" relation here. Just emit the inference edges you see; the conclusion stage selects from your output.
+- Avoid attack/rebuttal relations entirely for now — the pipeline does not yet handle them.
 
 If there are no relations to emit, return \`{ "relations": [] }\`.`;
 function buildPrompt(ctx) {
@@ -59,7 +60,7 @@ function buildPrompt(ctx) {
         .map((s) => `  [${s.segmentId}] ${JSON.stringify(s.text)}`)
         .join("\n");
     const markedSystem = `<!-- stage-id: ${STAGE_IDS.relationExtraction} -->\n${RELATION_EXTRACTION_SYSTEM_PROMPT}`;
-    const user = `Canonical claims (with refined types):\n${claimLines}\n\nSegments:\n${segmentLines}\n\nEmit every support relationship as a relations array.`;
+    const user = `Canonical claims (with refined types):\n${claimLines}\n\nSegments:\n${segmentLines}\n\nEmit every inference relationship as a relations array.`;
     return { system: markedSystem, user };
 }
 /** Internal default knobs for the relation-extraction stage. */

package/dist/extensions/pipelines/base/stages/relation-extraction.js.map

@@ -1 +1 @@
-{"version":3,"file":"relation-extraction.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/relation-extraction.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,kEAAkE;AAClE,qDAAqD;AACrD,EAAE;AACF,qEAAqE;AACrE,qEAAqE;AACrE,wDAAwD;AACxD,6CAA6C;AAE7C,OAAO,EACH,SAAS,EACT,8BAA8B,GAMjC,MAAM,cAAc,CAAA;AACrB,OAAO,EAAE,QAAQ,EAAE,MAAM,4CAA4C,CAAA;AAIrE,MAAM,CAAC,MAAM,yBAAyB,GAAG,SAAS,CAAA;AAClD,MAAM,CAAC,MAAM,6BAA6B,GAI3B,MAAM,CAAA;AAErB,MAAM,CAAC,MAAM,iCAAiC,GAAG;;;;;;;;;;;;;;;;;;;;;;;mEAuBkB,CAAA;AAEnE,SAAS,WAAW,CAAC,GAAkB;IACnC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CACjB,SAAS,CAAC,qBAAqB,CAClC,CAAA;IACD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CACxB,SAAS,CAAC,uBAAuB,CACpC,CAAA;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAyC,CAAA;IACrE,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,eAAe,IAAI,EAAE,EAAE,CAAC;QACtD,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACzC,CAAC;IACD,MAAM,eAAe,GAAG,GAAG,CAAC,GAAG,CAAsB,SAAS,CAAC,YAAY,CAAC,CAAA;IAC5E,MAAM,QAAQ,GAAG,eAAe,EAAE,QAAQ,IAAI,EAAE,CAAA;IAEhD,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,eAAe,IAAI,EAAE,CAAC;SAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACP,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAA;QAC9D,OAAO,MAAM,CAAC,CAAC,MAAM,UAAU,WAAW,WAAW,CAAC,CAAC,eAAe,WAAW,IAAI,CAAC,SAAS,CAC3F;YACI,GAAG,CAAC;YACJ,MAAM,EAAE,SAAS;YACjB,UAAU,EAAE,SAAS;YACrB,eAAe,EAAE,SAAS;YAC1B,IAAI,EAAE,SAAS;SAClB,CACJ,EAAE,CAAA;IACP,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;IACf,MAAM,YAAY,GAAG,QAAQ;SACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;SAC1D,IAAI,CAAC,IAAI,CAAC,CAAA;IAEf,MAAM,YAAY,GAAG,kBAAkB,SAAS,CAAC,kBAAkB,SAAS,iCAAiC,EAAE,CAAA;IAC/G,MAAM,IAAI,GAAG,2CAA2C,UAAU,kBAAkB,YAAY,2DAA2D,CAAA;IAC3J,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,CAAA;AACzC,CAAC;AAED,gEAAgE;AAChE,MAAM,CAAC,MAAM,kCAAkC,GAA6B;IACxE,KAAK,EAAE,yBAAyB;IAChC,eAAe,EAAE,6BAA6B;CACjD,CAAA;AAED,0EAA0E;AAC1E,MAAM,UAAU,6BAA6B,CACzC,OAAkC;IAElC,OAAO,QAAQ,CAA4B;QACvC,EAAE,EAAE,SAAS,CAAC,kBAAkB;QAChC,SAAS,EAAE;YACP,SAAS,CAAC,qBAAqB;YAC/B,SAAS,CAAC,uBAAuB;YACjC,SAAS,CAAC,YAAY;SACzB;QACD,YAAY,EAAE,8BAA8B;QAC5C,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,yBAAyB;QAClD,eAAe,EAAE,OAAO,EAAE,eAAe;QACzC,eAAe,EACX,OAAO,EAAE,eAAe,IAAI,6BAA6B;QAC7D,KAAK,EAAE,OAAO,EAAE,KAAK;QACrB,WAAW;KACd,CAAC,CAAA;AACN,CAAC;AAED,iDAAiD;AACjD,MAAM,CAAC,MAAM,uBAAuB,GAChC,6BAA6B,EAAE,CAAA"}
+{"version":3,"file":"relation-extraction.js","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/relation-extraction.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,wEAAwE;AACxE,mEAAmE;AACnE,sBAAsB;AACtB,EAAE;AACF,qEAAqE;AACrE,oEAAoE;AACpE,uEAAuE;AACvE,mBAAmB;AAEnB,OAAO,EACH,SAAS,EACT,8BAA8B,GAMjC,MAAM,cAAc,CAAA;AACrB,OAAO,EAAE,QAAQ,EAAE,MAAM,4CAA4C,CAAA;AAIrE,MAAM,CAAC,MAAM,yBAAyB,GAAG,SAAS,CAAA;AAClD,MAAM,CAAC,MAAM,6BAA6B,GAI3B,MAAM,CAAA;AAErB,MAAM,CAAC,MAAM,iCAAiC,GAAG;;;;;;;;;;;;;;;;;;;;;;;mEAuBkB,CAAA;AAEnE,SAAS,WAAW,CAAC,GAAkB;IACnC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CACjB,SAAS,CAAC,qBAAqB,CAClC,CAAA;IACD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CACxB,SAAS,CAAC,uBAAuB,CACpC,CAAA;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAyC,CAAA;IACrE,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,eAAe,IAAI,EAAE,EAAE,CAAC;QACtD,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACzC,CAAC;IACD,MAAM,eAAe,GAAG,GAAG,CAAC,GAAG,CAAsB,SAAS,CAAC,YAAY,CAAC,CAAA;IAC5E,MAAM,QAAQ,GAAG,eAAe,EAAE,QAAQ,IAAI,EAAE,CAAA;IAEhD,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,eAAe,IAAI,EAAE,CAAC;SAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACP,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAA;QAC9D,OAAO,MAAM,CAAC,CAAC,MAAM,UAAU,WAAW,WAAW,CAAC,CAAC,eAAe,WAAW,IAAI,CAAC,SAAS,CAC3F;YACI,GAAG,CAAC;YACJ,MAAM,EAAE,SAAS;YACjB,UAAU,EAAE,SAAS;YACrB,eAAe,EAAE,SAAS;YAC1B,IAAI,EAAE,SAAS;SAClB,CACJ,EAAE,CAAA;IACP,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;IACf,MAAM,YAAY,GAAG,QAAQ;SACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;SAC1D,IAAI,CAAC,IAAI,CAAC,CAAA;IAEf,MAAM,YAAY,GAAG,kBAAkB,SAAS,CAAC,kBAAkB,SAAS,iCAAiC,EAAE,CAAA;IAC/G,MAAM,IAAI,GAAG,2CAA2C,UAAU,kBAAkB,YAAY,6DAA6D,CAAA;IAC7J,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,CAAA;AACzC,CAAC;AAED,gEAAgE;AAChE,MAAM,CAAC,MAAM,kCAAkC,GAA6B;IACxE,KAAK,EAAE,yBAAyB;IAChC,eAAe,EAAE,6BAA6B;CACjD,CAAA;AAED,0EAA0E;AAC1E,MAAM,UAAU,6BAA6B,CACzC,OAAkC;IAElC,OAAO,QAAQ,CAA4B;QACvC,EAAE,EAAE,SAAS,CAAC,kBAAkB;QAChC,SAAS,EAAE;YACP,SAAS,CAAC,qBAAqB;YAC/B,SAAS,CAAC,uBAAuB;YACjC,SAAS,CAAC,YAAY;SACzB;QACD,YAAY,EAAE,8BAA8B;QAC5C,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,yBAAyB;QAClD,eAAe,EAAE,OAAO,EAAE,eAAe;QACzC,eAAe,EACX,OAAO,EAAE,eAAe,IAAI,6BAA6B;QAC7D,KAAK,EAAE,OAAO,EAAE,KAAK;QACrB,WAAW;KACd,CAAC,CAAA;AACN,CAAC;AAED,iDAAiD;AACjD,MAAM,CAAC,MAAM,uBAAuB,GAChC,6BAA6B,EAAE,CAAA"}

package/dist/extensions/pipelines/base/stages/schemas.d.ts

@@ -104,14 +104,12 @@ export declare const VariableAssignmentOutputSchema: Type.TArray<Type.TObject<{
 }>>;
 export type TVariableAssignmentOutput = Static<typeof VariableAssignmentOutputSchema>;
 export type TAssignedVariable = TVariableAssignmentOutput[number];
-export declare const RelationKindSchema: Type.TUnion<[Type.TLiteral<"support">, Type.TLiteral<"joint-support">, Type.TLiteral<"derivation-support">]>;
-export type TRelationKind = Static<typeof RelationKindSchema>;
 export declare const RelationExtractionOutputSchema: Type.TObject<{
     relations: Type.TArray<Type.TObject<{
         relationId: Type.TString;
-        type: Type.TUnion<[Type.TLiteral<"support">, Type.TLiteral<"joint-support">, Type.TLiteral<"derivation-support">]>;
-        sources: Type.TArray<Type.TString>;
-        target: Type.TString;
+        type: Type.TLiteral<"inference">;
+        antecedents: Type.TArray<Type.TString>;
+        consequent: Type.TString;
         evidence: Type.TObject<{
             segmentIds: Type.TArray<Type.TString>;
             quote: Type.TString;
@@ -119,7 +117,7 @@ export declare const RelationExtractionOutputSchema: Type.TObject<{
     }>>;
 }>;
 export type TRelationExtractionOutput = Static<typeof RelationExtractionOutputSchema>;
-export type TRelation = TRelationExtractionOutput["relations"][number];
+export type TInferenceRelation = TRelationExtractionOutput["relations"][number];
 export declare const ConclusionSelectionLlmOutputSchema: Type.TObject<{
     conclusionCandidates: Type.TArray<Type.TString>;
     rationale: Type.TString;
@@ -131,16 +129,20 @@ export declare const ConclusionSelectionOutputSchema: Type.TObject<{
     rationale: Type.TString;
 }>;
 export type TConclusionSelectionOutput = Static<typeof ConclusionSelectionOutputSchema>;
-export declare const FormulaPremiseRoleHintSchema: Type.TUnion<[Type.TLiteral<"support">, Type.TLiteral<"joint-support">, Type.TLiteral<"derivation">, Type.TLiteral<"conclusion">]>;
+export declare const FormulaPremiseRoleHintSchema: Type.TUnion<[Type.TLiteral<"freeform">, Type.TLiteral<"conclusion">]>;
 export type TFormulaPremiseRoleHint = Static<typeof FormulaPremiseRoleHintSchema>;
 export declare const FormulaCompilationOutputSchema: Type.TObject<{
     premises: Type.TArray<Type.TObject<{
         premiseMiniId: Type.TString;
         formula: Type.TString;
-        roleHint: Type.TUnion<[Type.TLiteral<"support">, Type.TLiteral<"joint-support">, Type.TLiteral<"derivation">, Type.TLiteral<"conclusion">]>;
+        roleHint: Type.TUnion<[Type.TLiteral<"freeform">, Type.TLiteral<"conclusion">]>;
         sourceRelationId: Type.TUnion<[Type.TString, Type.TNull]>;
     }>>;
     conclusionPremiseMiniId: Type.TUnion<[Type.TString, Type.TNull]>;
+    derivationBacking: Type.TArray<Type.TObject<{
+        derivedClaimMiniId: Type.TString;
+        supportingClaimMiniIds: Type.TArray<Type.TString>;
+    }>>;
 }>;
 export type TFormulaCompilationOutput = Static<typeof FormulaCompilationOutputSchema>;
 export type TCompiledPremise = TFormulaCompilationOutput["premises"][number];

package/dist/extensions/pipelines/base/stages/schemas.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"schemas.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/schemas.ts"],"names":[],"mappings":"AAOA,OAAO,IAAI,EAAE,EAAE,KAAK,MAAM,EAAE,MAAM,SAAS,CAAA;AAiB3C,eAAO,MAAM,UAAU;;;EASrB,CAAA;AACF,MAAM,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,UAAU,CAAC,CAAA;AAiB7C,eAAO,MAAM,wBAAwB;;;;;;;;;EAQnC,CAAA;AACF,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,OAAO,wBAAwB,CAAC,CAAA;AACzE,MAAM,MAAM,QAAQ,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAA;AAI9D,eAAO,MAAM,kCAAkC;;;;;;;;;;EAS7C,CAAA;AACF,MAAM,MAAM,6BAA6B,GAAG,MAAM,CAC9C,OAAO,kCAAkC,CAC5C,CAAA;AACD,MAAM,MAAM,aAAa,GAAG,6BAA6B,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAA;AAI7E,eAAO,MAAM,mCAAmC;;;;;;;;;;;EAU9C,CAAA;AACF,MAAM,MAAM,8BAA8B,GAAG,MAAM,CAC/C,OAAO,mCAAmC,CAC7C,CAAA;AACD,MAAM,MAAM,eAAe,GAAG,8BAA8B,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAA;AAI/E,eAAO,MAAM,mCAAmC;;;;;;;;;;EAS9C,CAAA;AACF,MAAM,MAAM,8BAA8B,GAAG,MAAM,CAC/C,OAAO,mCAAmC,CAC7C,CAAA;AACD,MAAM,MAAM,eAAe,GAAG,8BAA8B,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAA;AAkB9E,eAAO,MAAM,wBAAwB;;;;;EAanC,CAAA;AACF,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,OAAO,wBAAwB,CAAC,CAAA;AAazE,eAAO,MAAM,yBAAyB;;;EAGpC,CAAA;AACF,MAAM,MAAM,oBAAoB,GAAG,MAAM,CAAC,OAAO,yBAAyB,CAAC,CAAA;AAE3E,eAAO,MAAM,iCAAiC;;;;;;;;;;;EAG5C,CAAA;AACF,MAAM,MAAM,4BAA4B,GAAG,MAAM,CAC7C,OAAO,iCAAiC,CAC3C,CAAA;AACD,gEAAgE;AAChE,MAAM,MAAM,eAAe,GAAG,mBAAmB,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;AAU3E,eAAO,MAAM,kCAAkC;;;;EAQ7C,CAAA;AACF,MAAM,MAAM,6BAA6B,GAAG,MAAM,CAC9C,OAAO,kCAAkC,CAC5C,CAAA;AAED,eAAO,MAAM,mCAAmC;;;;;;EAE9C,CAAA;AACF,MAAM,MAAM,8BAA8B,GAAG,MAAM,CAC/C,OAAO,mCAAmC,CAC7C,CAAA;AAID,eAAO,MAAM,8BAA8B;;;;GAM1C,CAAA;AACD,MAAM,MAAM,yBAAyB,GAAG,MAAM,CAC1C,OAAO,8BAA8B,CACxC,CAAA;AACD,MAAM,MAAM,iBAAiB,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAA;AAIjE,eAAO,MAAM,kBAAkB,8GAI7B,CAAA;AACF,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,kBAAkB,CAAC,CAAA;AAE7D,eAAO,MAAM,8BAA8B;;;;;;;;;;;EAazC,CAAA;AACF,MAAM,MAAM,yBAAyB,GAAG,MAAM,CAC1C,OAAO,8BAA8B,CACxC,CAAA;AACD,MAAM,MAAM,SAAS,GAAG,yBAAyB,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAA;AAQtE,eAAO,MAAM,kCAAkC;;;EAG7C,CAAA;AACF,MAAM,MAAM,6BAA6B,GAAG,MAAM,CAC9C,OAAO,kCAAkC,CAC5C,CAAA;AAOD,eAAO,MAAM,+BAA+B;;;;EAI1C,CAAA;AACF,MAAM,MAAM,0BAA0B,GAAG,MAAM,CAC3C,OAAO,+BAA+B,CACzC,CAAA;AAID,eAAO,MAAM,4BAA4B,mIAKvC,CAAA;AACF,MAAM,MAAM,uBAAuB,GAAG,MAAM,CACxC,OAAO,4BAA4B,CACtC,CAAA;AAED,eAAO,MAAM,8BAA8B;;;;;;;;EAazC,CAAA;AACF,MAAM,MAAM,yBAAyB,GAAG,MAAM,CAC1C,OAAO,8BAA8B,CACxC,CAAA;AACD,MAAM,MAAM,gBAAgB,GAAG,yBAAyB,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAA;AAO5E,eAAO,MAAM,2BAA2B;;;;GAMvC,CAAA;AACD,MAAM,MAAM,sBAAsB,GAAG,MAAM,CAAC,OAAO,2BAA2B,CAAC,CAAA;AAI/E,eAAO,MAAM,SAAS;;;;;;;;;;;;;;;CAqBZ,CAAA"}
+{"version":3,"file":"schemas.d.ts","sourceRoot":"","sources":["../../../../../src/extensions/pipelines/base/stages/schemas.ts"],"names":[],"mappings":"AAOA,OAAO,IAAI,EAAE,EAAE,KAAK,MAAM,EAAE,MAAM,SAAS,CAAA;AAiB3C,eAAO,MAAM,UAAU;;;EASrB,CAAA;AACF,MAAM,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,UAAU,CAAC,CAAA;AAiB7C,eAAO,MAAM,wBAAwB;;;;;;;;;EAQnC,CAAA;AACF,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,OAAO,wBAAwB,CAAC,CAAA;AACzE,MAAM,MAAM,QAAQ,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAA;AAI9D,eAAO,MAAM,kCAAkC;;;;;;;;;;EAS7C,CAAA;AACF,MAAM,MAAM,6BAA6B,GAAG,MAAM,CAC9C,OAAO,kCAAkC,CAC5C,CAAA;AACD,MAAM,MAAM,aAAa,GAAG,6BAA6B,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAA;AAI7E,eAAO,MAAM,mCAAmC;;;;;;;;;;;EAU9C,CAAA;AACF,MAAM,MAAM,8BAA8B,GAAG,MAAM,CAC/C,OAAO,mCAAmC,CAC7C,CAAA;AACD,MAAM,MAAM,eAAe,GAAG,8BAA8B,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAA;AAI/E,eAAO,MAAM,mCAAmC;;;;;;;;;;EAS9C,CAAA;AACF,MAAM,MAAM,8BAA8B,GAAG,MAAM,CAC/C,OAAO,mCAAmC,CAC7C,CAAA;AACD,MAAM,MAAM,eAAe,GAAG,8BAA8B,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAA;AAkB9E,eAAO,MAAM,wBAAwB;;;;;EAanC,CAAA;AACF,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,OAAO,wBAAwB,CAAC,CAAA;AAazE,eAAO,MAAM,yBAAyB;;;EAGpC,CAAA;AACF,MAAM,MAAM,oBAAoB,GAAG,MAAM,CAAC,OAAO,yBAAyB,CAAC,CAAA;AAE3E,eAAO,MAAM,iCAAiC;;;;;;;;;;;EAG5C,CAAA;AACF,MAAM,MAAM,4BAA4B,GAAG,MAAM,CAC7C,OAAO,iCAAiC,CAC3C,CAAA;AACD,gEAAgE;AAChE,MAAM,MAAM,eAAe,GAAG,mBAAmB,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;AAU3E,eAAO,MAAM,kCAAkC;;;;EAQ7C,CAAA;AACF,MAAM,MAAM,6BAA6B,GAAG,MAAM,CAC9C,OAAO,kCAAkC,CAC5C,CAAA;AAED,eAAO,MAAM,mCAAmC;;;;;;EAE9C,CAAA;AACF,MAAM,MAAM,8BAA8B,GAAG,MAAM,CAC/C,OAAO,mCAAmC,CAC7C,CAAA;AAID,eAAO,MAAM,8BAA8B;;;;GAM1C,CAAA;AACD,MAAM,MAAM,yBAAyB,GAAG,MAAM,CAC1C,OAAO,8BAA8B,CACxC,CAAA;AACD,MAAM,MAAM,iBAAiB,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAA;AAIjE,eAAO,MAAM,8BAA8B;;;;;;;;;;;EAezC,CAAA;AACF,MAAM,MAAM,yBAAyB,GAAG,MAAM,CAC1C,OAAO,8BAA8B,CACxC,CAAA;AACD,MAAM,MAAM,kBAAkB,GAAG,yBAAyB,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAA;AAQ/E,eAAO,MAAM,kCAAkC;;;EAG7C,CAAA;AACF,MAAM,MAAM,6BAA6B,GAAG,MAAM,CAC9C,OAAO,kCAAkC,CAC5C,CAAA;AAOD,eAAO,MAAM,+BAA+B;;;;EAI1C,CAAA;AACF,MAAM,MAAM,0BAA0B,GAAG,MAAM,CAC3C,OAAO,+BAA+B,CACzC,CAAA;AAID,eAAO,MAAM,4BAA4B,uEAGvC,CAAA;AACF,MAAM,MAAM,uBAAuB,GAAG,MAAM,CACxC,OAAO,4BAA4B,CACtC,CAAA;AAED,eAAO,MAAM,8BAA8B;;;;;;;;;;;;EAuBzC,CAAA;AACF,MAAM,MAAM,yBAAyB,GAAG,MAAM,CAC1C,OAAO,8BAA8B,CACxC,CAAA;AACD,MAAM,MAAM,gBAAgB,GAAG,yBAAyB,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAA;AAO5E,eAAO,MAAM,2BAA2B;;;;GAMvC,CAAA;AACD,MAAM,MAAM,sBAAsB,GAAG,MAAM,CAAC,OAAO,2BAA2B,CAAC,CAAA;AAI/E,eAAO,MAAM,SAAS;;;;;;;;;;;;;;;CAqBZ,CAAA"}

package/dist/extensions/pipelines/base/stages/schemas.js

@@ -150,17 +150,14 @@ export const VariableAssignmentOutputSchema = Type.Array(Type.Object({
     claimMiniId: Type.String(),
 }));
 // -- Stage 9: relation-extraction --
-export const RelationKindSchema = Type.Union([
-    Type.Literal("support"),
-    Type.Literal("joint-support"),
-    Type.Literal("derivation-support"),
-]);
 export const RelationExtractionOutputSchema = Type.Object({
     relations: Type.Array(Type.Object({
         relationId: Type.String(),
-        type: RelationKindSchema,
-        sources: Type.Array(Type.String()),
-        target: Type.String(),
+        // `type` stays a discriminator so further relation kinds can
+        // be added as union members without reshaping the object.
+        type: Type.Literal("inference"),
+        antecedents: Type.Array(Type.String()),
+        consequent: Type.String(),
         evidence: Type.Object({
             segmentIds: Type.Array(Type.String()),
             quote: Type.String(),
@@ -188,9 +185,7 @@ export const ConclusionSelectionOutputSchema = Type.Object({
 });
 // -- Stage 11: formula-compilation --
 export const FormulaPremiseRoleHintSchema = Type.Union([
-    Type.Literal("support"),
-    Type.Literal("joint-support"),
-    Type.Literal("derivation"),
+    Type.Literal("freeform"),
     Type.Literal("conclusion"),
 ]);
 export const FormulaCompilationOutputSchema = Type.Object({
@@ -204,6 +199,14 @@ export const FormulaCompilationOutputSchema = Type.Object({
         sourceRelationId: Type.Union([Type.String(), Type.Null()]),
     })),
     conclusionPremiseMiniId: Type.Union([Type.String(), Type.Null()]),
+    // Citation/axiomatic backing extracted from inference antecedents:
+    // each entry records that claim `derivedClaimMiniId` is grounded by
+    // the listed citation/axiomatic supporting claims. The parser
+    // materializes these into derivation premises.
+    derivationBacking: Type.Array(Type.Object({
+        derivedClaimMiniId: Type.String(),
+        supportingClaimMiniIds: Type.Array(Type.String()),
+    })),
 });
 // -- Stage 7 + 12 are validation stages whose `run` return value is
 // the same shape: an array of structured processing-failure-context