@proposit/proposit-core 0.8.9

package/dist/lib/core/evaluation/argument-evaluation.js

@@ -0,0 +1,535 @@
+import { isClaimBound, isPremiseBound, } from "../../schemata/index.js";
+import { kleeneAnd, kleeneNot, kleeneOr, kleeneImplies, kleeneIff, } from "./kleene.js";
+import { makeErrorIssue, makeValidationResult } from "./validation.js";
+/**
+ * Run fixed-point constraint propagation over accepted/rejected operators.
+ * Fills unknown (null) variable values based on operator semantics.
+ * Never overwrites user-assigned values (true/false).
+ */
+export function propagateOperatorConstraints(ctx, assignment) {
+    const vars = { ...assignment.variables };
+    const opAssignments = assignment.operatorAssignments;
+    // Collect all expressions across all premises, indexed by id
+    const exprById = new Map();
+    // Children lookup: parentId -> sorted children
+    const childrenOf = new Map();
+    for (const pm of ctx.listPremises()) {
+        for (const expr of pm.getExpressions()) {
+            exprById.set(expr.id, expr);
+        }
+        // Build children map using getChildExpressions for each operator/formula
+        for (const expr of pm.getExpressions()) {
+            if (expr.type === "operator" || expr.type === "formula") {
+                childrenOf.set(expr.id, pm.getChildExpressions(expr.id));
+            }
+        }
+    }
+    /**
+     * Resolve the current Kleene value of an expression subtree
+     * given the current variable assignments. Does not force-accept
+     * nested operators — evaluates them normally via Kleene logic.
+     */
+    const resolveValue = (exprId) => {
+        const expr = exprById.get(exprId);
+        if (!expr)
+            return null;
+        if (expr.type === "variable") {
+            return (vars[expr
+                .variableId] ?? null);
+        }
+        if (expr.type === "formula") {
+            const children = childrenOf.get(expr.id) ?? [];
+            return children.length > 0 ? resolveValue(children[0].id) : null;
+        }
+        // operator
+        const op = expr.operator;
+        const children = childrenOf.get(expr.id) ?? [];
+        switch (op) {
+            case "not":
+                return kleeneNot(resolveValue(children[0].id));
+            case "and":
+                return children.reduce((acc, child) => kleeneAnd(acc, resolveValue(child.id)), true);
+            case "or":
+                return children.reduce((acc, child) => kleeneOr(acc, resolveValue(child.id)), false);
+            case "implies": {
+                return kleeneImplies(resolveValue(children[0].id), resolveValue(children[1].id));
+            }
+            case "iff": {
+                return kleeneIff(resolveValue(children[0].id), resolveValue(children[1].id));
+            }
+        }
+    };
+    /**
+     * Unwrap formula wrappers to find the leaf variable expression.
+     * Returns the variableId if the leaf is a variable, otherwise null.
+     */
+    const resolveLeafVariableId = (expr) => {
+        if (expr.type === "variable") {
+            return expr.variableId;
+        }
+        if (expr.type === "formula") {
+            const children = childrenOf.get(expr.id) ?? [];
+            if (children.length > 0) {
+                return resolveLeafVariableId(children[0]);
+            }
+        }
+        return null;
+    };
+    // Track which variable IDs were explicitly set by the user
+    // (true or false). These are never overwritten by propagation.
+    const userAssigned = new Set();
+    for (const [varId, val] of Object.entries(vars)) {
+        if (val !== null && val !== undefined)
+            userAssigned.add(varId);
+    }
+    /**
+     * Try to set a child expression's variable to a value.
+     * Never overwrites user-assigned values.
+     * False overrides propagated true (rejection wins).
+     * Returns true if a value changed.
+     */
+    const trySetChild = (child, value) => {
+        const varId = resolveLeafVariableId(child);
+        if (varId == null || userAssigned.has(varId))
+            return false;
+        const current = vars[varId] ?? null;
+        if (current === null) {
+            vars[varId] = value;
+            return true;
+        }
+        // False overrides propagated true
+        if (value === false && current === true) {
+            vars[varId] = false;
+            return true;
+        }
+        return false;
+    };
+    // Two-phase propagation: rejections first (to establish false values),
+    // then acceptances (which only fill remaining unknowns).
+    // This prevents acceptance from deriving values through chains that
+    // are later invalidated by rejection.
+    for (const phase of ["rejected", "accepted"]) {
+        let changed = true;
+        while (changed) {
+            changed = false;
+            for (const [exprId, expr] of exprById) {
+                if (expr.type !== "operator")
+                    continue;
+                const state = opAssignments[exprId];
+                if (state !== phase)
+                    continue;
+                const op = expr
+                    .operator;
+                const children = childrenOf.get(exprId) ?? [];
+                if (state === "accepted") {
+                    switch (op) {
+                        case "not": {
+                            // ¬A accepted (= true) => child must be false
+                            if (children.length > 0) {
+                                if (trySetChild(children[0], false))
+                                    changed = true;
+                            }
+                            break;
+                        }
+                        case "and": {
+                            // A ∧ B accepted => all children must be true
+                            for (const child of children) {
+                                if (trySetChild(child, true))
+                                    changed = true;
+                            }
+                            break;
+                        }
+                        case "or": {
+                            // A ∨ B accepted: if all-but-one are false, remaining must be true
+                            const unknownChildren = [];
+                            let allOthersAreFalse = true;
+                            for (const child of children) {
+                                const childValue = resolveValue(child.id);
+                                if (childValue === null) {
+                                    unknownChildren.push(child);
+                                }
+                                else if (childValue !== false) {
+                                    allOthersAreFalse = false;
+                                }
+                            }
+                            if (unknownChildren.length === 1 &&
+                                allOthersAreFalse) {
+                                if (trySetChild(unknownChildren[0], true))
+                                    changed = true;
+                            }
+                            break;
+                        }
+                        case "implies": {
+                            // A → B accepted: if A=true => B=true; if B=false => A=false
+                            if (children.length >= 2) {
+                                const leftValue = resolveValue(children[0].id);
+                                const rightValue = resolveValue(children[1].id);
+                                if (leftValue === true) {
+                                    if (trySetChild(children[1], true))
+                                        changed = true;
+                                }
+                                if (rightValue === false) {
+                                    if (trySetChild(children[0], false))
+                                        changed = true;
+                                }
+                            }
+                            break;
+                        }
+                        case "iff": {
+                            // A ↔ B accepted: if A known => B matches; if B known => A matches
+                            if (children.length >= 2) {
+                                const leftValue = resolveValue(children[0].id);
+                                const rightValue = resolveValue(children[1].id);
+                                if (leftValue !== null) {
+                                    if (trySetChild(children[1], leftValue))
+                                        changed = true;
+                                }
+                                if (rightValue !== null) {
+                                    if (trySetChild(children[0], rightValue))
+                                        changed = true;
+                                }
+                            }
+                            break;
+                        }
+                    }
+                }
+                else {
+                    // state === "rejected" — expression forced false
+                    switch (op) {
+                        case "not": {
+                            // ¬A rejected (= false) => child must be true
+                            if (children.length > 0) {
+                                if (trySetChild(children[0], true))
+                                    changed = true;
+                            }
+                            break;
+                        }
+                        case "and": {
+                            // A ∧ B rejected (= false): if all-but-one are true, remaining must be false
+                            const unknownChildren = [];
+                            let allOthersAreTrue = true;
+                            for (const child of children) {
+                                const childValue = resolveValue(child.id);
+                                if (childValue === null) {
+                                    unknownChildren.push(child);
+                                }
+                                else if (childValue !== true) {
+                                    allOthersAreTrue = false;
+                                }
+                            }
+                            if (unknownChildren.length === 1 &&
+                                allOthersAreTrue) {
+                                if (trySetChild(unknownChildren[0], false))
+                                    changed = true;
+                            }
+                            break;
+                        }
+                        case "or": {
+                            // A ∨ B rejected (= false) => all children must be false
+                            for (const child of children) {
+                                if (trySetChild(child, false))
+                                    changed = true;
+                            }
+                            break;
+                        }
+                        case "implies": {
+                            // A → B rejected (= false) => A must be true, B must be false
+                            if (children.length >= 2) {
+                                if (trySetChild(children[0], true))
+                                    changed = true;
+                                if (trySetChild(children[1], false))
+                                    changed = true;
+                            }
+                            break;
+                        }
+                        case "iff": {
+                            // A ↔ B rejected (= false): if A known => B is opposite; if B known => A is opposite
+                            if (children.length >= 2) {
+                                const leftValue = resolveValue(children[0].id);
+                                const rightValue = resolveValue(children[1].id);
+                                if (leftValue !== null) {
+                                    if (trySetChild(children[1], !leftValue))
+                                        changed = true;
+                                }
+                                if (rightValue !== null) {
+                                    if (trySetChild(children[0], !rightValue))
+                                        changed = true;
+                                }
+                            }
+                            break;
+                        }
+                    }
+                }
+            }
+        }
+    }
+    return vars;
+}
+/**
+ * Evaluates an argument under a three-valued expression assignment.
+ */
+export function evaluateArgument(ctx, assignment, options) {
+    const validateFirst = options?.validateFirst ?? true;
+    if (validateFirst) {
+        const validation = ctx.validateEvaluability();
+        if (!validation.ok) {
+            return {
+                ok: false,
+                validation,
+            };
+        }
+    }
+    const conclusion = ctx.getConclusionPremise();
+    if (!conclusion) {
+        return {
+            ok: false,
+            validation: makeValidationResult([
+                makeErrorIssue({
+                    code: "ARGUMENT_NO_CONCLUSION",
+                    message: "Argument has no designated conclusion premise.",
+                }),
+            ]),
+        };
+    }
+    const supportingPremises = ctx.listSupportingPremises();
+    const supportingIds = new Set(supportingPremises.map((pm) => pm.getId()));
+    const constraintPremises = ctx
+        .listPremises()
+        .filter((pm) => pm.getId() !== ctx.conclusionPremiseId &&
+        !supportingIds.has(pm.getId()));
+    const allRelevantPremises = [
+        conclusion,
+        ...supportingPremises,
+        ...constraintPremises,
+    ];
+    const allVariableIds = [
+        ...new Set(allRelevantPremises.flatMap((pm) => pm
+            .getExpressions()
+            .filter((expr) => expr.type === "variable")
+            .map((expr) => expr.variableId))),
+    ].sort();
+    // Claim-bound and externally-bound premise variables get truth-table columns;
+    // internally-bound premise variables are resolved lazily.
+    const referencedVariableIds = allVariableIds.filter((vid) => {
+        const v = ctx.getVariable(vid);
+        if (v == null)
+            return false;
+        if (isClaimBound(v))
+            return true;
+        if (isPremiseBound(v) && v.boundArgumentId !== ctx.argumentId)
+            return true;
+        return false;
+    });
+    // Run operator constraint propagation
+    const propagatedVars = propagateOperatorConstraints(ctx, assignment);
+    const propagatedAssignment = {
+        variables: propagatedVars,
+        operatorAssignments: assignment.operatorAssignments,
+    };
+    try {
+        // Build a resolver that lazily evaluates premise-bound variables
+        // by evaluating their bound premise's expression tree under the
+        // same assignment. Results are cached per-variable per-evaluate call.
+        const resolverCache = new Map();
+        const resolver = (variableId) => {
+            if (resolverCache.has(variableId)) {
+                return resolverCache.get(variableId);
+            }
+            const variable = ctx.getVariable(variableId);
+            if (!variable ||
+                !isPremiseBound(variable) ||
+                variable.boundArgumentId !== ctx.argumentId) {
+                // Claim-bound or externally-bound: read from assignment
+                return propagatedAssignment.variables[variableId] ?? null;
+            }
+            // Internal premise-bound: lazy resolution
+            const boundPremiseId = variable.boundPremiseId;
+            const boundPremise = ctx.getPremise(boundPremiseId);
+            if (!boundPremise) {
+                resolverCache.set(variableId, null);
+                return null;
+            }
+            const premiseResult = boundPremise.evaluate(propagatedAssignment, {
+                resolver,
+            });
+            const value = premiseResult?.rootValue ?? null;
+            resolverCache.set(variableId, value);
+            return value;
+        };
+        const evalOpts = {
+            strictUnknownKeys: options?.strictUnknownAssignmentKeys ?? false,
+            resolver,
+        };
+        const conclusionEvaluation = conclusion.evaluate(propagatedAssignment, evalOpts);
+        const supportingEvaluations = supportingPremises.map((pm) => pm.evaluate(propagatedAssignment, evalOpts));
+        const constraintEvaluations = constraintPremises.map((pm) => pm.evaluate(propagatedAssignment, evalOpts));
+        const isAdmissibleAssignment = constraintEvaluations.reduce((acc, result) => kleeneAnd(acc, result.rootValue ?? null), true);
+        const allSupportingPremisesTrue = supportingEvaluations.reduce((acc, result) => kleeneAnd(acc, result.rootValue ?? null), true);
+        const conclusionTrue = conclusionEvaluation.rootValue ?? null;
+        const isCounterexample = kleeneAnd(isAdmissibleAssignment, kleeneAnd(allSupportingPremisesTrue, kleeneNot(conclusionTrue)));
+        const includeExpressionValues = options?.includeExpressionValues ?? true;
+        const includeDiagnostics = options?.includeDiagnostics ?? true;
+        const strip = (result) => ({
+            ...result,
+            expressionValues: includeExpressionValues
+                ? result.expressionValues
+                : {},
+            inferenceDiagnostic: includeDiagnostics
+                ? result.inferenceDiagnostic
+                : undefined,
+        });
+        return {
+            ok: true,
+            assignment: {
+                variables: { ...propagatedAssignment.variables },
+                operatorAssignments: {
+                    ...propagatedAssignment.operatorAssignments,
+                },
+            },
+            referencedVariableIds,
+            conclusion: strip(conclusionEvaluation),
+            supportingPremises: supportingEvaluations.map(strip),
+            constraintPremises: constraintEvaluations.map(strip),
+            isAdmissibleAssignment,
+            allSupportingPremisesTrue,
+            conclusionTrue,
+            isCounterexample,
+            preservesTruthUnderAssignment: kleeneNot(isCounterexample),
+        };
+    }
+    catch (error) {
+        return {
+            ok: false,
+            validation: makeValidationResult([
+                makeErrorIssue({
+                    code: "ASSIGNMENT_MISSING_VARIABLE",
+                    message: error instanceof Error
+                        ? error.message
+                        : "Argument evaluation failed.",
+                }),
+            ]),
+        };
+    }
+}
+/**
+ * Enumerates all 2^n variable assignments and checks for counterexamples.
+ */
+export function checkArgumentValidity(ctx, options) {
+    const validateFirst = options?.validateFirst ?? true;
+    if (validateFirst) {
+        const validation = ctx.validateEvaluability();
+        if (!validation.ok) {
+            return {
+                ok: false,
+                validation,
+            };
+        }
+    }
+    const conclusion = ctx.getConclusionPremise();
+    if (!conclusion) {
+        return {
+            ok: false,
+            validation: makeValidationResult([
+                makeErrorIssue({
+                    code: "ARGUMENT_NO_CONCLUSION",
+                    message: "Argument has no designated conclusion premise.",
+                }),
+            ]),
+        };
+    }
+    const supportingPremises = ctx.listSupportingPremises();
+    const supportingIds = new Set(supportingPremises.map((pm) => pm.getId()));
+    const constraintPremises = ctx
+        .listPremises()
+        .filter((pm) => pm.getId() !== ctx.conclusionPremiseId &&
+        !supportingIds.has(pm.getId()));
+    const allVariableIdsForCheck = [
+        ...new Set([conclusion, ...supportingPremises, ...constraintPremises].flatMap((pm) => pm
+            .getExpressions()
+            .filter((expr) => expr.type === "variable")
+            .map((expr) => expr.variableId))),
+    ].sort();
+    // Claim-bound and externally-bound premise variables get truth-table columns;
+    // internally-bound premise variables are resolved lazily.
+    const checkedVariableIds = allVariableIdsForCheck.filter((vid) => {
+        const v = ctx.getVariable(vid);
+        if (v == null)
+            return false;
+        if (isClaimBound(v))
+            return true;
+        if (isPremiseBound(v) && v.boundArgumentId !== ctx.argumentId)
+            return true;
+        return false;
+    });
+    if (options?.maxVariables !== undefined &&
+        checkedVariableIds.length > options.maxVariables) {
+        return {
+            ok: false,
+            validation: makeValidationResult([
+                makeErrorIssue({
+                    code: "ASSIGNMENT_UNKNOWN_VARIABLE",
+                    message: `Validity check requires ${checkedVariableIds.length} variables, exceeding limit ${options.maxVariables}.`,
+                }),
+            ]),
+        };
+    }
+    const mode = options?.mode ?? "firstCounterexample";
+    const maxAssignmentsChecked = options?.maxAssignmentsChecked;
+    const counterexamples = [];
+    let numAssignmentsChecked = 0;
+    let numAdmissibleAssignments = 0;
+    let truncated = false;
+    const totalAssignments = 2 ** checkedVariableIds.length;
+    for (let mask = 0; mask < totalAssignments; mask++) {
+        if (maxAssignmentsChecked !== undefined &&
+            numAssignmentsChecked >= maxAssignmentsChecked) {
+            truncated = true;
+            break;
+        }
+        const assignment = {
+            variables: {},
+            operatorAssignments: {},
+        };
+        for (let i = 0; i < checkedVariableIds.length; i++) {
+            assignment.variables[checkedVariableIds[i]] = Boolean(mask & (1 << i));
+        }
+        const result = evaluateArgument(ctx, assignment, {
+            validateFirst: false,
+            includeExpressionValues: options?.includeCounterexampleEvaluations ?? false,
+            includeDiagnostics: options?.includeCounterexampleEvaluations ?? false,
+        });
+        if (!result.ok) {
+            return {
+                ok: false,
+                validation: result.validation,
+            };
+        }
+        numAssignmentsChecked += 1;
+        if (result.isAdmissibleAssignment === true) {
+            numAdmissibleAssignments += 1;
+        }
+        if (result.isCounterexample === true) {
+            counterexamples.push({
+                assignment: result.assignment,
+                result,
+            });
+            if (mode === "firstCounterexample") {
+                break;
+            }
+        }
+    }
+    const foundCounterexample = counterexamples.length > 0;
+    const fullyChecked = !truncated &&
+        (mode === "exhaustive" ||
+            (mode === "firstCounterexample" && !foundCounterexample));
+    return {
+        ok: true,
+        isValid: foundCounterexample ? false : fullyChecked ? true : undefined,
+        checkedVariableIds,
+        numAssignmentsChecked,
+        numAdmissibleAssignments,
+        counterexamples,
+        truncated,
+    };
+}
+//# sourceMappingURL=argument-evaluation.js.map

package/dist/lib/core/evaluation/argument-evaluation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"argument-evaluation.js","sourceRoot":"","sources":["../../../../src/lib/core/evaluation/argument-evaluation.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,YAAY,EACZ,cAAc,GAGjB,MAAM,yBAAyB,CAAA;AAahC,OAAO,EACH,SAAS,EACT,SAAS,EACT,QAAQ,EACR,aAAa,EACb,SAAS,GACZ,MAAM,aAAa,CAAA;AACpB,OAAO,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAA;AA2CtE;;;;GAIG;AACH,MAAM,UAAU,4BAA4B,CACxC,GAA+B,EAC/B,UAAqC;IAErC,MAAM,IAAI,GAA4B,EAAE,GAAG,UAAU,CAAC,SAAS,EAAE,CAAA;IACjE,MAAM,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAA;IAEpD,6DAA6D;IAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAGrB,CAAA;IACH,+CAA+C;IAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,EAA0C,CAAA;IAEpE,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,YAAY,EAAE,EAAE,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC;YACrC,QAAQ,CAAC,GAAG,CACR,IAAI,CAAC,EAAE,EACP,IAA4D,CAC/D,CAAA;QACL,CAAC;QACD,yEAAyE;QACzE,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACtD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;YAC5D,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,MAAM,YAAY,GAAG,CAAC,MAAc,EAAuB,EAAE;QACzD,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAA;QAEtB,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,OAAO,CACH,IAAI,CACC,IAAiD;iBAC7C,UAAU,CAClB,IAAI,IAAI,CACZ,CAAA;QACL,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;YAC9C,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QACpE,CAAC;QAED,WAAW;QACX,MAAM,EAAE,GAAI,IAAiD,CAAC,QAAQ,CAAA;QACtE,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QAE9C,QAAQ,EAAE,EAAE,CAAC;YACT,KAAK,KAAK;gBACN,OAAO,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAClD,KAAK,KAAK;gBACN,OAAO,QAAQ,CAAC,MAAM,CAClB,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EACtD,IAAI,CACP,CAAA;YACL,KAAK,IAAI;gBACL,OAAO,QAAQ,CAAC,MAAM,CAClB,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EACrD,KAAK,CACR,CAAA;YACL,KAAK,SAAS,CAAC,CAAC,CAAC;gBACb,OAAO,aAAa,CAChB,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAC5B,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAC/B,CAAA;YACL,CAAC;YACD,KAAK,KAAK,CAAC,CAAC,CAAC;gBACT,OAAO,SAAS,CACZ,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAC5B,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAC/B,CAAA;YACL,CAAC;QACL,CAAC;IACL,CAAC,CAAA;IAED;;;OAGG;IACH,MAAM,qBAAqB,GAAG,CAC1B,IAAkC,EACrB,EAAE;QACf,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,UAAU,CAAA;QAC1B,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;YAC9C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,OAAO,qBAAqB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;YAC7C,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC,CAAA;IAED,2DAA2D;IAC3D,+DAA+D;IAC/D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAA;IACtC,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS;YAAE,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAClE,CAAC;IAED;;;;;OAKG;IACH,MAAM,WAAW,GAAG,CAChB,KAAmC,EACnC,KAAc,EACP,EAAE;QACT,MAAM,KAAK,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAA;QAC1C,IAAI,KAAK,IAAI,IAAI,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAA;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAA;QACnC,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;YACnB,OAAO,IAAI,CAAA;QACf,CAAC;QACD,kCAAkC;QAClC,IAAI,KAAK,KAAK,KAAK,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;YACnB,OAAO,IAAI,CAAA;QACf,CAAC;QACD,OAAO,KAAK,CAAA;IAChB,CAAC,CAAA;IAED,uEAAuE;IACvE,yDAAyD;IACzD,oEAAoE;IACpE,sCAAsC;IACtC,KAAK,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,UAAU,CAAU,EAAE,CAAC;QACpD,IAAI,OAAO,GAAG,IAAI,CAAA;QAClB,OAAO,OAAO,EAAE,CAAC;YACb,OAAO,GAAG,KAAK,CAAA;YAEf,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACpC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;oBAAE,SAAQ;gBACtC,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,CAAA;gBACnC,IAAI,KAAK,KAAK,KAAK;oBAAE,SAAQ;gBAE7B,MAAM,EAAE,GAAI,IAAiD;qBACxD,QAAQ,CAAA;gBACb,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAA;gBAE7C,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;oBACvB,QAAQ,EAAE,EAAE,CAAC;wBACT,KAAK,KAAK,CAAC,CAAC,CAAC;4BACT,8CAA8C;4BAC9C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gCACtB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;oCAC/B,OAAO,GAAG,IAAI,CAAA;4BACtB,CAAC;4BACD,MAAK;wBACT,CAAC;wBACD,KAAK,KAAK,CAAC,CAAC,CAAC;4BACT,8CAA8C;4BAC9C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gCAC3B,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC;oCAAE,OAAO,GAAG,IAAI,CAAA;4BAChD,CAAC;4BACD,MAAK;wBACT,CAAC;wBACD,KAAK,IAAI,CAAC,CAAC,CAAC;4BACR,mEAAmE;4BACnE,MAAM,eAAe,GACjB,EAAE,CAAA;4BACN,IAAI,iBAAiB,GAAG,IAAI,CAAA;4BAC5B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gCAC3B,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;gCACzC,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;oCACtB,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gCAC/B,CAAC;qCAAM,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;oCAC9B,iBAAiB,GAAG,KAAK,CAAA;gCAC7B,CAAC;4BACL,CAAC;4BACD,IACI,eAAe,CAAC,MAAM,KAAK,CAAC;gCAC5B,iBAAiB,EACnB,CAAC;gCACC,IAAI,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;oCACrC,OAAO,GAAG,IAAI,CAAA;4BACtB,CAAC;4BACD,MAAK;wBACT,CAAC;wBACD,KAAK,SAAS,CAAC,CAAC,CAAC;4BACb,6DAA6D;4BAC7D,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gCACvB,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gCAC9C,MAAM,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gCAC/C,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oCACrB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;wCAC9B,OAAO,GAAG,IAAI,CAAA;gCACtB,CAAC;gCACD,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;oCACvB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;wCAC/B,OAAO,GAAG,IAAI,CAAA;gCACtB,CAAC;4BACL,CAAC;4BACD,MAAK;wBACT,CAAC;wBACD,KAAK,KAAK,CAAC,CAAC,CAAC;4BACT,mEAAmE;4BACnE,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gCACvB,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gCAC9C,MAAM,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gCAC/C,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oCACrB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;wCACnC,OAAO,GAAG,IAAI,CAAA;gCACtB,CAAC;gCACD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;oCACtB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC;wCACpC,OAAO,GAAG,IAAI,CAAA;gCACtB,CAAC;4BACL,CAAC;4BACD,MAAK;wBACT,CAAC;oBACL,CAAC;gBACL,CAAC;qBAAM,CAAC;oBACJ,iDAAiD;oBACjD,QAAQ,EAAE,EAAE,CAAC;wBACT,KAAK,KAAK,CAAC,CAAC,CAAC;4BACT,8CAA8C;4BAC9C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gCACtB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;oCAC9B,OAAO,GAAG,IAAI,CAAA;4BACtB,CAAC;4BACD,MAAK;wBACT,CAAC;wBACD,KAAK,KAAK,CAAC,CAAC,CAAC;4BACT,6EAA6E;4BAC7E,MAAM,eAAe,GACjB,EAAE,CAAA;4BACN,IAAI,gBAAgB,GAAG,IAAI,CAAA;4BAC3B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gCAC3B,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;gCACzC,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;oCACtB,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gCAC/B,CAAC;qCAAM,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;oCAC7B,gBAAgB,GAAG,KAAK,CAAA;gCAC5B,CAAC;4BACL,CAAC;4BACD,IACI,eAAe,CAAC,MAAM,KAAK,CAAC;gCAC5B,gBAAgB,EAClB,CAAC;gCACC,IAAI,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;oCACtC,OAAO,GAAG,IAAI,CAAA;4BACtB,CAAC;4BACD,MAAK;wBACT,CAAC;wBACD,KAAK,IAAI,CAAC,CAAC,CAAC;4BACR,yDAAyD;4BACzD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gCAC3B,IAAI,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC;oCAAE,OAAO,GAAG,IAAI,CAAA;4BACjD,CAAC;4BACD,MAAK;wBACT,CAAC;wBACD,KAAK,SAAS,CAAC,CAAC,CAAC;4BACb,8DAA8D;4BAC9D,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gCACvB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;oCAC9B,OAAO,GAAG,IAAI,CAAA;gCAClB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;oCAC/B,OAAO,GAAG,IAAI,CAAA;4BACtB,CAAC;4BACD,MAAK;wBACT,CAAC;wBACD,KAAK,KAAK,CAAC,CAAC,CAAC;4BACT,qFAAqF;4BACrF,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gCACvB,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gCAC9C,MAAM,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;gCAC/C,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oCACrB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC;wCACpC,OAAO,GAAG,IAAI,CAAA;gCACtB,CAAC;gCACD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;oCACtB,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC;wCACrC,OAAO,GAAG,IAAI,CAAA;gCACtB,CAAC;4BACL,CAAC;4BACD,MAAK;wBACT,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAA;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC5B,GAA+B,EAC/B,UAAqC,EACrC,OAAwC;IAExC,MAAM,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,IAAI,CAAA;IACpD,IAAI,aAAa,EAAE,CAAC;QAChB,MAAM,UAAU,GAAG,GAAG,CAAC,oBAAoB,EAAE,CAAA;QAC7C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;YACjB,OAAO;gBACH,EAAE,EAAE,KAAK;gBACT,UAAU;aACb,CAAA;QACL,CAAC;IACL,CAAC;IAED,MAAM,UAAU,GAAG,GAAG,CAAC,oBAAoB,EAAE,CAAA;IAC7C,IAAI,CAAC,UAAU,EAAE,CAAC;QACd,OAAO;YACH,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,oBAAoB,CAAC;gBAC7B,cAAc,CAAC;oBACX,IAAI,EAAE,wBAAwB;oBAC9B,OAAO,EAAE,gDAAgD;iBAC5D,CAAC;aACL,CAAC;SACL,CAAA;IACL,CAAC;IAED,MAAM,kBAAkB,GAAG,GAAG,CAAC,sBAAsB,EAAE,CAAA;IACvD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IACzE,MAAM,kBAAkB,GAAG,GAAG;SACzB,YAAY,EAAE;SACd,MAAM,CACH,CAAC,EAAE,EAAE,EAAE,CACH,EAAE,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,mBAAmB;QACtC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CACrC,CAAA;IAEL,MAAM,mBAAmB,GAAG;QACxB,UAAU;QACV,GAAG,kBAAkB;QACrB,GAAG,kBAAkB;KACxB,CAAA;IACD,MAAM,cAAc,GAAG;QACnB,GAAG,IAAI,GAAG,CACN,mBAAmB,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAC/B,EAAE;aACG,cAAc,EAAE;aAChB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;aAC1C,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CACtC,CACJ;KACJ,CAAC,IAAI,EAAE,CAAA;IAER,8EAA8E;IAC9E,0DAA0D;IAC1D,MAAM,qBAAqB,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;QACxD,MAAM,CAAC,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,CAAC,IAAI,IAAI;YAAE,OAAO,KAAK,CAAA;QAC3B,IAAI,YAAY,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAA;QAChC,IAAI,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,eAAe,KAAK,GAAG,CAAC,UAAU;YACzD,OAAO,IAAI,CAAA;QACf,OAAO,KAAK,CAAA;IAChB,CAAC,CAAC,CAAA;IAEF,sCAAsC;IACtC,MAAM,cAAc,GAAG,4BAA4B,CAAC,GAAG,EAAE,UAAU,CAAC,CAAA;IACpE,MAAM,oBAAoB,GAA8B;QACpD,SAAS,EAAE,cAAc;QACzB,mBAAmB,EAAE,UAAU,CAAC,mBAAmB;KACtD,CAAA;IAED,IAAI,CAAC;QACD,iEAAiE;QACjE,gEAAgE;QAChE,sEAAsE;QACtE,MAAM,aAAa,GAAG,IAAI,GAAG,EAA0B,CAAA;QACvD,MAAM,QAAQ,GAAG,CAAC,UAAkB,EAAkB,EAAE;YACpD,IAAI,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAChC,OAAO,aAAa,CAAC,GAAG,CAAC,UAAU,CAAE,CAAA;YACzC,CAAC;YACD,MAAM,QAAQ,GAAG,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,CAAA;YAC5C,IACI,CAAC,QAAQ;gBACT,CAAC,cAAc,CAAC,QAAQ,CAAC;gBACzB,QAAQ,CAAC,eAAe,KAAK,GAAG,CAAC,UAAU,EAC7C,CAAC;gBACC,wDAAwD;gBACxD,OAAO,oBAAoB,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,IAAI,CAAA;YAC7D,CAAC;YACD,0CAA0C;YAC1C,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAA;YAC9C,MAAM,YAAY,GAAG,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,CAAA;YACnD,IAAI,CAAC,YAAY,EAAE,CAAC;gBAChB,aAAa,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;gBACnC,OAAO,IAAI,CAAA;YACf,CAAC;YACD,MAAM,aAAa,GAAG,YAAY,CAAC,QAAQ,CAAC,oBAAoB,EAAE;gBAC9D,QAAQ;aACX,CAAC,CAAA;YACF,MAAM,KAAK,GAAG,aAAa,EAAE,SAAS,IAAI,IAAI,CAAA;YAC9C,aAAa,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;YACpC,OAAO,KAAK,CAAA;QAChB,CAAC,CAAA;QAED,MAAM,QAAQ,GAAG;YACb,iBAAiB,EAAE,OAAO,EAAE,2BAA2B,IAAI,KAAK;YAChE,QAAQ;SACX,CAAA;QACD,MAAM,oBAAoB,GAAG,UAAU,CAAC,QAAQ,CAC5C,oBAAoB,EACpB,QAAQ,CACX,CAAA;QACD,MAAM,qBAAqB,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CACxD,EAAE,CAAC,QAAQ,CAAC,oBAAoB,EAAE,QAAQ,CAAC,CAC9C,CAAA;QACD,MAAM,qBAAqB,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CACxD,EAAE,CAAC,QAAQ,CAAC,oBAAoB,EAAE,QAAQ,CAAC,CAC9C,CAAA;QAED,MAAM,sBAAsB,GACxB,qBAAqB,CAAC,MAAM,CACxB,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI,CAAC,EACzD,IAAI,CACP,CAAA;QACL,MAAM,yBAAyB,GAC3B,qBAAqB,CAAC,MAAM,CACxB,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI,CAAC,EACzD,IAAI,CACP,CAAA;QACL,MAAM,cAAc,GAChB,oBAAoB,CAAC,SAAS,IAAI,IAAI,CAAA;QAC1C,MAAM,gBAAgB,GAAG,SAAS,CAC9B,sBAAsB,EACtB,SAAS,CAAC,yBAAyB,EAAE,SAAS,CAAC,cAAc,CAAC,CAAC,CAClE,CAAA;QAED,MAAM,uBAAuB,GAAG,OAAO,EAAE,uBAAuB,IAAI,IAAI,CAAA;QACxE,MAAM,kBAAkB,GAAG,OAAO,EAAE,kBAAkB,IAAI,IAAI,CAAA;QAC9D,MAAM,KAAK,GAAG,CACV,MAAoC,EACR,EAAE,CAAC,CAAC;YAChC,GAAG,MAAM;YACT,gBAAgB,EAAE,uBAAuB;gBACrC,CAAC,CAAC,MAAM,CAAC,gBAAgB;gBACzB,CAAC,CAAC,EAAE;YACR,mBAAmB,EAAE,kBAAkB;gBACnC,CAAC,CAAC,MAAM,CAAC,mBAAmB;gBAC5B,CAAC,CAAC,SAAS;SAClB,CAAC,CAAA;QAEF,OAAO;YACH,EAAE,EAAE,IAAI;YACR,UAAU,EAAE;gBACR,SAAS,EAAE,EAAE,GAAG,oBAAoB,CAAC,SAAS,EAAE;gBAChD,mBAAmB,EAAE;oBACjB,GAAG,oBAAoB,CAAC,mBAAmB;iBAC9C;aACJ;YACD,qBAAqB;YACrB,UAAU,EAAE,KAAK,CAAC,oBAAoB,CAAC;YACvC,kBAAkB,EAAE,qBAAqB,CAAC,GAAG,CAAC,KAAK,CAAC;YACpD,kBAAkB,EAAE,qBAAqB,CAAC,GAAG,CAAC,KAAK,CAAC;YACpD,sBAAsB;YACtB,yBAAyB;YACzB,cAAc;YACd,gBAAgB;YAChB,6BAA6B,EAAE,SAAS,CAAC,gBAAgB,CAAC;SAC7D,CAAA;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACb,OAAO;YACH,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,oBAAoB,CAAC;gBAC7B,cAAc,CAAC;oBACX,IAAI,EAAE,6BAA6B;oBACnC,OAAO,EACH,KAAK,YAAY,KAAK;wBAClB,CAAC,CAAC,KAAK,CAAC,OAAO;wBACf,CAAC,CAAC,6BAA6B;iBAC1C,CAAC;aACL,CAAC;SACL,CAAA;IACL,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACjC,GAA+B,EAC/B,OAAmC;IAEnC,MAAM,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,IAAI,CAAA;IACpD,IAAI,aAAa,EAAE,CAAC;QAChB,MAAM,UAAU,GAAG,GAAG,CAAC,oBAAoB,EAAE,CAAA;QAC7C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;YACjB,OAAO;gBACH,EAAE,EAAE,KAAK;gBACT,UAAU;aACb,CAAA;QACL,CAAC;IACL,CAAC;IAED,MAAM,UAAU,GAAG,GAAG,CAAC,oBAAoB,EAAE,CAAA;IAC7C,IAAI,CAAC,UAAU,EAAE,CAAC;QACd,OAAO;YACH,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,oBAAoB,CAAC;gBAC7B,cAAc,CAAC;oBACX,IAAI,EAAE,wBAAwB;oBAC9B,OAAO,EAAE,gDAAgD;iBAC5D,CAAC;aACL,CAAC;SACL,CAAA;IACL,CAAC;IAED,MAAM,kBAAkB,GAAG,GAAG,CAAC,sBAAsB,EAAE,CAAA;IACvD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IACzE,MAAM,kBAAkB,GAAG,GAAG;SACzB,YAAY,EAAE;SACd,MAAM,CACH,CAAC,EAAE,EAAE,EAAE,CACH,EAAE,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,mBAAmB;QACtC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CACrC,CAAA;IAEL,MAAM,sBAAsB,GAAG;QAC3B,GAAG,IAAI,GAAG,CACN,CAAC,UAAU,EAAE,GAAG,kBAAkB,EAAE,GAAG,kBAAkB,CAAC,CAAC,OAAO,CAC9D,CAAC,EAAE,EAAE,EAAE,CACH,EAAE;aACG,cAAc,EAAE;aAChB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;aAC1C,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAC1C,CACJ;KACJ,CAAC,IAAI,EAAE,CAAA;IAER,8EAA8E;IAC9E,0DAA0D;IAC1D,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;QAC7D,MAAM,CAAC,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,CAAC,IAAI,IAAI;YAAE,OAAO,KAAK,CAAA;QAC3B,IAAI,YAAY,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAA;QAChC,IAAI,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,eAAe,KAAK,GAAG,CAAC,UAAU;YACzD,OAAO,IAAI,CAAA;QACf,OAAO,KAAK,CAAA;IAChB,CAAC,CAAC,CAAA;IAEF,IACI,OAAO,EAAE,YAAY,KAAK,SAAS;QACnC,kBAAkB,CAAC,MAAM,GAAG,OAAO,CAAC,YAAY,EAClD,CAAC;QACC,OAAO;YACH,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,oBAAoB,CAAC;gBAC7B,cAAc,CAAC;oBACX,IAAI,EAAE,6BAA6B;oBACnC,OAAO,EAAE,2BAA2B,kBAAkB,CAAC,MAAM,+BAA+B,OAAO,CAAC,YAAY,GAAG;iBACtH,CAAC;aACL,CAAC;SACL,CAAA;IACL,CAAC;IAED,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,qBAAqB,CAAA;IACnD,MAAM,qBAAqB,GAAG,OAAO,EAAE,qBAAqB,CAAA;IAC5D,MAAM,eAAe,GAA0B,EAAE,CAAA;IACjD,IAAI,qBAAqB,GAAG,CAAC,CAAA;IAC7B,IAAI,wBAAwB,GAAG,CAAC,CAAA;IAChC,IAAI,SAAS,GAAG,KAAK,CAAA;IAErB,MAAM,gBAAgB,GAAG,CAAC,IAAI,kBAAkB,CAAC,MAAM,CAAA;IACvD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,gBAAgB,EAAE,IAAI,EAAE,EAAE,CAAC;QACjD,IACI,qBAAqB,KAAK,SAAS;YACnC,qBAAqB,IAAI,qBAAqB,EAChD,CAAC;YACC,SAAS,GAAG,IAAI,CAAA;YAChB,MAAK;QACT,CAAC;QAED,MAAM,UAAU,GAA8B;YAC1C,SAAS,EAAE,EAAE;YACb,mBAAmB,EAAE,EAAE;SAC1B,CAAA;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,UAAU,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CACjD,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAClB,CAAA;QACL,CAAC;QAED,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,EAAE,UAAU,EAAE;YAC7C,aAAa,EAAE,KAAK;YACpB,uBAAuB,EACnB,OAAO,EAAE,gCAAgC,IAAI,KAAK;YACtD,kBAAkB,EACd,OAAO,EAAE,gCAAgC,IAAI,KAAK;SACzD,CAAC,CAAA;QAEF,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACb,OAAO;gBACH,EAAE,EAAE,KAAK;gBACT,UAAU,EAAE,MAAM,CAAC,UAAU;aAChC,CAAA;QACL,CAAC;QAED,qBAAqB,IAAI,CAAC,CAAA;QAE1B,IAAI,MAAM,CAAC,sBAAsB,KAAK,IAAI,EAAE,CAAC;YACzC,wBAAwB,IAAI,CAAC,CAAA;QACjC,CAAC;QAED,IAAI,MAAM,CAAC,gBAAgB,KAAK,IAAI,EAAE,CAAC;YACnC,eAAe,CAAC,IAAI,CAAC;gBACjB,UAAU,EAAE,MAAM,CAAC,UAAW;gBAC9B,MAAM;aACT,CAAC,CAAA;YACF,IAAI,IAAI,KAAK,qBAAqB,EAAE,CAAC;gBACjC,MAAK;YACT,CAAC;QACL,CAAC;IACL,CAAC;IAED,MAAM,mBAAmB,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,CAAA;IACtD,MAAM,YAAY,GACd,CAAC,SAAS;QACV,CAAC,IAAI,KAAK,YAAY;YAClB,CAAC,IAAI,KAAK,qBAAqB,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAA;IAEjE,OAAO;QACH,EAAE,EAAE,IAAI;QACR,OAAO,EAAE,mBAAmB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;QACtE,kBAAkB;QAClB,qBAAqB;QACrB,wBAAwB;QACxB,eAAe;QACf,SAAS;KACZ,CAAA;AACL,CAAC"}

package/dist/lib/core/evaluation/grading.d.ts

@@ -0,0 +1,28 @@
+import type { TCoreArgumentEvaluationResult } from "../../types/evaluation.js";
+/**
+ * Human-readable grade for an argument evaluation result.
+ * Summarizes the logical status of the argument under the given assignment.
+ */
+export type TCoreEvaluationGrade = "sound" | "vacuously-true" | "unsound" | "counterexample" | "inadmissible" | "indeterminate";
+export interface TCoreEvaluationGrading {
+    /** Machine-readable grade. */
+    grade: TCoreEvaluationGrade;
+    /** Short human-readable label (e.g. "Sound", "Vacuously True"). */
+    label: string;
+    /** Display color name for UI rendering. */
+    color: "green" | "orange" | "red" | "gray";
+}
+/**
+ * Derives a human-readable grade from an argument evaluation result.
+ *
+ * Precedence:
+ * 1. Evaluation failed (ok=false) → indeterminate
+ * 2. Inadmissible assignment → inadmissible
+ * 3. Supporting premise false → unsound
+ * 4. Counterexample (all supporting true, conclusion false) → counterexample
+ * 5. Conclusion vacuously true → vacuously-true
+ * 6. Conclusion true → sound
+ * 7. Otherwise → indeterminate
+ */
+export declare function gradeEvaluation(result: TCoreArgumentEvaluationResult): TCoreEvaluationGrading;
+//# sourceMappingURL=grading.d.ts.map

package/dist/lib/core/evaluation/grading.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"grading.d.ts","sourceRoot":"","sources":["../../../../src/lib/core/evaluation/grading.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,6BAA6B,EAAE,MAAM,2BAA2B,CAAA;AAE9E;;;GAGG;AACH,MAAM,MAAM,oBAAoB,GAC1B,OAAO,GACP,gBAAgB,GAChB,SAAS,GACT,gBAAgB,GAChB,cAAc,GACd,eAAe,CAAA;AAErB,MAAM,WAAW,sBAAsB;IACnC,8BAA8B;IAC9B,KAAK,EAAE,oBAAoB,CAAA;IAC3B,mEAAmE;IACnE,KAAK,EAAE,MAAM,CAAA;IACb,2CAA2C;IAC3C,KAAK,EAAE,OAAO,GAAG,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAA;CAC7C;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAC3B,MAAM,EAAE,6BAA6B,GACtC,sBAAsB,CAmCxB"}

package/dist/lib/core/evaluation/grading.js

@@ -0,0 +1,44 @@
+/**
+ * Derives a human-readable grade from an argument evaluation result.
+ *
+ * Precedence:
+ * 1. Evaluation failed (ok=false) → indeterminate
+ * 2. Inadmissible assignment → inadmissible
+ * 3. Supporting premise false → unsound
+ * 4. Counterexample (all supporting true, conclusion false) → counterexample
+ * 5. Conclusion vacuously true → vacuously-true
+ * 6. Conclusion true → sound
+ * 7. Otherwise → indeterminate
+ */
+export function gradeEvaluation(result) {
+    if (!result.ok) {
+        return { grade: "indeterminate", label: "Indeterminate", color: "gray" };
+    }
+    if (result.isAdmissibleAssignment === false) {
+        return { grade: "inadmissible", label: "Inadmissible", color: "gray" };
+    }
+    if (result.allSupportingPremisesTrue === false) {
+        return { grade: "unsound", label: "Unsound", color: "red" };
+    }
+    if (result.isCounterexample === true) {
+        return {
+            grade: "counterexample",
+            label: "Counterexample",
+            color: "red",
+        };
+    }
+    if (result.conclusionTrue === true) {
+        // Check if conclusion is vacuously true
+        const diag = result.conclusion?.inferenceDiagnostic;
+        if (diag?.kind === "implies" && diag.isVacuouslyTrue === true) {
+            return {
+                grade: "vacuously-true",
+                label: "Vacuously True",
+                color: "orange",
+            };
+        }
+        return { grade: "sound", label: "Sound", color: "green" };
+    }
+    return { grade: "indeterminate", label: "Indeterminate", color: "gray" };
+}
+//# sourceMappingURL=grading.js.map

package/dist/lib/core/evaluation/grading.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"grading.js","sourceRoot":"","sources":["../../../../src/lib/core/evaluation/grading.ts"],"names":[],"mappings":"AAuBA;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAC3B,MAAqC;IAErC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;QACb,OAAO,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;IAC5E,CAAC;IAED,IAAI,MAAM,CAAC,sBAAsB,KAAK,KAAK,EAAE,CAAC;QAC1C,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;IAC1E,CAAC;IAED,IAAI,MAAM,CAAC,yBAAyB,KAAK,KAAK,EAAE,CAAC;QAC7C,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IAC/D,CAAC;IAED,IAAI,MAAM,CAAC,gBAAgB,KAAK,IAAI,EAAE,CAAC;QACnC,OAAO;YACH,KAAK,EAAE,gBAAgB;YACvB,KAAK,EAAE,gBAAgB;YACvB,KAAK,EAAE,KAAK;SACf,CAAA;IACL,CAAC;IAED,IAAI,MAAM,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;QACjC,wCAAwC;QACxC,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,EAAE,mBAAmB,CAAA;QACnD,IAAI,IAAI,EAAE,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI,EAAE,CAAC;YAC5D,OAAO;gBACH,KAAK,EAAE,gBAAgB;gBACvB,KAAK,EAAE,gBAAgB;gBACvB,KAAK,EAAE,QAAQ;aAClB,CAAA;QACL,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;IAC7D,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;AAC5E,CAAC"}

package/dist/lib/core/evaluation/kleene.d.ts

@@ -0,0 +1,12 @@
+import type { TCoreTrivalentValue } from "../../types/evaluation.js";
+/** Kleene three-valued NOT: null propagates. */
+export declare function kleeneNot(a: TCoreTrivalentValue): TCoreTrivalentValue;
+/** Kleene three-valued AND: false dominates, null propagates. */
+export declare function kleeneAnd(a: TCoreTrivalentValue, b: TCoreTrivalentValue): TCoreTrivalentValue;
+/** Kleene three-valued OR: true dominates, null propagates. */
+export declare function kleeneOr(a: TCoreTrivalentValue, b: TCoreTrivalentValue): TCoreTrivalentValue;
+/** Kleene three-valued material implication: NOT a OR b. */
+export declare function kleeneImplies(a: TCoreTrivalentValue, b: TCoreTrivalentValue): TCoreTrivalentValue;
+/** Kleene three-valued biconditional: (a -> b) AND (b -> a). */
+export declare function kleeneIff(a: TCoreTrivalentValue, b: TCoreTrivalentValue): TCoreTrivalentValue;
+//# sourceMappingURL=kleene.d.ts.map

package/dist/lib/core/evaluation/kleene.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kleene.d.ts","sourceRoot":"","sources":["../../../../src/lib/core/evaluation/kleene.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAA;AAEpE,gDAAgD;AAChD,wBAAgB,SAAS,CAAC,CAAC,EAAE,mBAAmB,GAAG,mBAAmB,CAErE;AAED,iEAAiE;AACjE,wBAAgB,SAAS,CACrB,CAAC,EAAE,mBAAmB,EACtB,CAAC,EAAE,mBAAmB,GACvB,mBAAmB,CAIrB;AAED,+DAA+D;AAC/D,wBAAgB,QAAQ,CACpB,CAAC,EAAE,mBAAmB,EACtB,CAAC,EAAE,mBAAmB,GACvB,mBAAmB,CAIrB;AAED,4DAA4D;AAC5D,wBAAgB,aAAa,CACzB,CAAC,EAAE,mBAAmB,EACtB,CAAC,EAAE,mBAAmB,GACvB,mBAAmB,CAErB;AAED,gEAAgE;AAChE,wBAAgB,SAAS,CACrB,CAAC,EAAE,mBAAmB,EACtB,CAAC,EAAE,mBAAmB,GACvB,mBAAmB,CAErB"}