lptp-mcp-server 0.1.0

package/build/index.js

@@ -0,0 +1,355 @@
+#!/usr/bin/env node
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const index_js_1 = require("@modelcontextprotocol/sdk/server/index.js");
+const stdio_js_1 = require("@modelcontextprotocol/sdk/server/stdio.js");
+const types_js_1 = require("@modelcontextprotocol/sdk/types.js");
+const lptpExecutor_1 = require("./lptpExecutor");
+const server = new index_js_1.Server({
+    name: "LPTP-MCP-Server",
+    version: "1.0.0",
+}, {
+    capabilities: {
+        tools: {},
+    },
+});
+const LPTP_GRAMMAR_SNIPPET = `
+Term Encoding:
+?x             -> $(x)                      % Variable
+0              -> [n(0, 0)]                 % Constant
+heaps          -> [n(heaps, 0)]             % Constant
+s(?x)          -> [n(s, 1), $(x)]           % Compound (successor)
+[?h|?t]        -> [n('.', 2), $(h), $(t)]   % List (cons)
+[]             -> [n('[]', 0)]              % Empty list
+
+Goals:
+true                -> [&]                              % Empty conjunction
+fail                -> [\\/]                             % Empty disjunction
+?x = s(0)           -> [=, $(x), [n(s,1), [n(0,0)]]]   % Equation
+member(?x, ?l)      -> [n(member, 2), $(x), $(l)]      % Atom
+~member(?x, [])     -> [~, [n(member, 2), $(x), [n('[]', 0)]]]  % Negation
+G1 & G2             -> [&, G1, G2]                      % Conjunction
+G1 \\/ G2            -> [\\/, G1, G2]                     % Disjunction
+
+Formulas:
+tt                  -> [&]                              % Verum
+ff                  -> [\\/]                             % Falsum
+s(?x) = s(?y)       -> [=, [n(s,1), $(x)], [n(s,1), $(y)]]
+succeeds A          -> [succeeds, AtomInternal]
+fails A             -> [fails, AtomInternal]
+terminates G        -> [terminates, GoalInternal]
+\u03c6 & \u03c8               -> [&, \u03c6Internal, \u03c8Internal]
+\u03c6 \\/ \u03c8              -> [\\/, \u03c6Internal, \u03c8Internal]
+\u03c6 => \u03c8              -> [=>, \u03c6Internal, \u03c8Internal]
+all [x]: \u03c6          -> @(all, [x], \u03c6Internal)
+ex [x]: \u03c6           -> @(ex, [x], \u03c6Internal)
+`;
+// ── Shared schema fragments ──────────────────────────────────────────
+const formulaSchema = {
+    type: "object",
+    properties: {
+        formula: {
+            type: "string",
+            description: "The target formal mathematical expression you want to decompose applying the given tactic.",
+        },
+        context: {
+            type: "string",
+            description: "Any external required definitions or `:- needs_gr(...)` references.",
+        },
+    },
+    required: ["formula"],
+};
+const predicateSchema = {
+    type: "object",
+    properties: {
+        predicate_name: {
+            type: "string",
+            description: "The predicate name (e.g. 'append', 'member', 'nat').",
+        },
+        context: {
+            type: "string",
+            description: "Any external required definitions or `:- needs_gr(...)` references.",
+        },
+    },
+    required: ["predicate_name"],
+};
+// ── Tool definitions ─────────────────────────────────────────────────
+server.setRequestHandler(types_js_1.ListToolsRequestSchema, async () => {
+    return {
+        tools: [
+            // ── Meta tools ───────────────────────────────────────
+            {
+                name: "get_lptp_grammar",
+                description: "Returns a basic summary of LPTP Grammar for LLM reasoning.",
+                inputSchema: {
+                    type: "object",
+                    properties: {},
+                },
+            },
+            // ── Proof verification ───────────────────────────────
+            {
+                name: "verify_lemma",
+                description: "Validates a snippet of LPTP proof code (e.g., lemma/3, theorem/3) by running it securely through SWI-Prolog. You can inject external context or axioms.",
+                inputSchema: {
+                    type: "object",
+                    properties: {
+                        proof_code: {
+                            type: "string",
+                            description: "The complete `lemma(...)` or syntax token you expect LPTP to compile.",
+                        },
+                        context: {
+                            type: "string",
+                            description: "Definitions, :- needs_gr() statements, or axioms evaluating before the target lemma.",
+                        },
+                    },
+                    required: ["proof_code"],
+                },
+            },
+            {
+                name: "check_proof",
+                description: "Runs LPTP's native check/1 predicate on an existing .pr proof file on disk. Returns all verification errors or confirms the entire proof is valid.",
+                inputSchema: {
+                    type: "object",
+                    properties: {
+                        file_path: {
+                            type: "string",
+                            description: "Absolute path to the .pr proof file to verify with check/1.",
+                        },
+                    },
+                    required: ["file_path"],
+                },
+            },
+            // ── Generic tactic application ───────────────────────
+            {
+                name: "apply_tactic",
+                description: "Applies an LPTP tactic (e.g., `[ind]`, `[auto(5)]`, `completion`) to a given logical formula and returns the expanded proof derivation tree generated by the theorem prover. Essential for navigating proof trees interactivity.",
+                inputSchema: {
+                    type: "object",
+                    properties: {
+                        formula: {
+                            type: "string",
+                            description: "The target formal mathematical expression you want to decompose applying the given tactic.",
+                        },
+                        tactic: {
+                            type: "string",
+                            description: "The LPTP tactic token, e.g. `[ind]`, `[auto(5)]`, `[unfold]`, `completion`.",
+                        },
+                        context: {
+                            type: "string",
+                            description: "Any external required definitions or `:- needs_gr(...)` references.",
+                        },
+                    },
+                    required: ["formula", "tactic"],
+                },
+            },
+            // ── Individual tactics (from etc/lptp-swi-prolog-mode.el) ──
+            {
+                name: "tactic_auto",
+                description: "Try to prove the formula automatically using LPTP's auto tactic with configurable search depth. Combines multiple proof strategies. Resource-limited: uses call_with_inference_limit/3 and call_with_time_limit/2 to prevent hangs.",
+                inputSchema: {
+                    type: "object",
+                    properties: {
+                        formula: {
+                            type: "string",
+                            description: "The target formal mathematical expression to prove.",
+                        },
+                        depth: {
+                            type: "number",
+                            description: "Search depth for automatic proof (default: 5).",
+                        },
+                        context: {
+                            type: "string",
+                            description: "Any external required definitions or `:- needs_gr(...)` references.",
+                        },
+                        inference_limit: {
+                            type: "number",
+                            description: "Max inference steps before aborting (default: 1000000). Use lower values (e.g. 50000) for bisection scouting.",
+                        },
+                        time_limit_seconds: {
+                            type: "number",
+                            description: "Max wall-clock seconds before aborting (default: 25). Use lower values (e.g. 5) for fast scouting.",
+                        },
+                    },
+                    required: ["formula"],
+                },
+            },
+            {
+                name: "tactic_case",
+                description: "Try to prove the formula by case splitting on disjunctions or pattern matches.",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_comp",
+                description: "Try to prove the formula by taking a completion formula (fixed-point semantics of program clauses).",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_elim",
+                description: "Try to prove the formula by expanding (eliminating) a predicate definition.",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_ex",
+                description: "Try to prove the formula by existential elimination (instantiating an existential quantifier).",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_fact",
+                description: "Try to prove the formula by applying a known fact (lemma, theorem, corollary, or axiom).",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_ind",
+                description: "Try to prove the formula by structural induction on an inductively defined predicate.",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_indqf",
+                description: "Try to prove the formula by quantifier-free induction (induction without universally quantified induction hypothesis).",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_tot",
+                description: "Try to prove the formula by case splitting on totality (termination) of a predicate call.",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_unfold",
+                description: "Try to prove the formula by unfolding an abbreviation or definition.",
+                inputSchema: formulaSchema,
+            },
+            {
+                name: "tactic_debug",
+                description: "Show the available formulas and assumptions in the current proof context. Useful for understanding what facts are available to complete a proof step.",
+                inputSchema: formulaSchema,
+            },
+            // ── Query tools ──────────────────────────────────────
+            {
+                name: "print_definition",
+                description: "Print the completion definition of a predicate. Shows the IND(P) fixed-point axioms (success, failure, termination) generated from the program clauses.",
+                inputSchema: predicateSchema,
+            },
+            {
+                name: "list_facts",
+                description: "List all known theorems, lemmas, and corollaries about a predicate. Useful for discovering what has already been proved.",
+                inputSchema: predicateSchema,
+            },
+            // ── Compilation ──────────────────────────────────────
+            {
+                name: "compile_gr",
+                description: "Compiles a .pl (Prolog program) file into its LPTP ground representation (.gr). The .gr file is written next to the .pl source. Accepts LPTP alias paths (e.g. '$(examples)/gen_99p/list_ops') or filesystem paths (e.g. 'examples/gen_99p/list_ops'). Path must omit the .pl extension.",
+                inputSchema: {
+                    type: "object",
+                    properties: {
+                        file_path: {
+                            type: "string",
+                            description: "Path to the .pl file WITHOUT the .pl extension. Supports LPTP aliases like $(examples), $(lib) or filesystem paths.",
+                        },
+                    },
+                    required: ["file_path"],
+                },
+            },
+        ],
+    };
+});
+// ── Tool dispatch ────────────────────────────────────────────────────
+server.setRequestHandler(types_js_1.CallToolRequestSchema, async (request) => {
+    const args = request.params.arguments;
+    switch (request.params.name) {
+        case "get_lptp_grammar": {
+            return {
+                content: [{ type: "text", text: LPTP_GRAMMAR_SNIPPET }],
+            };
+        }
+        case "verify_lemma": {
+            const result = await (0, lptpExecutor_1.verifyLemma)(args.proof_code, args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "check_proof": {
+            const result = await (0, lptpExecutor_1.checkProof)(args.file_path);
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "compile_gr": {
+            const result = await (0, lptpExecutor_1.compileGr)(args.file_path);
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        // ── Generic tactic ───────────────────────────────────
+        case "apply_tactic": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, args.tactic, args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        // ── Individual tactics ───────────────────────────────
+        case "tactic_auto": {
+            const depth = args.depth ?? 5;
+            const limits = {};
+            if (args.inference_limit != null)
+                limits.inferenceLimit = args.inference_limit;
+            if (args.time_limit_seconds != null)
+                limits.timeLimitS = args.time_limit_seconds;
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, `[auto(${depth})]`, args.context || "", limits);
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_case": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[case]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_comp": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[comp]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_elim": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[elim]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_ex": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[ex]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_fact": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[fact]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_ind": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[ind]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_indqf": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[indqf]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_tot": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[tot]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_unfold": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[unfold]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "tactic_debug": {
+            const result = await (0, lptpExecutor_1.applyTactic)(args.formula, "[debug]", args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        // ── Query tools ──────────────────────────────────────
+        case "print_definition": {
+            const result = await (0, lptpExecutor_1.printDefinition)(args.predicate_name, args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        case "list_facts": {
+            const result = await (0, lptpExecutor_1.listFacts)(args.predicate_name, args.context || "");
+            return { content: [{ type: "text", text: result.output }] };
+        }
+        default:
+            throw new Error("Unknown tool");
+    }
+});
+async function runServer() {
+    const transport = new stdio_js_1.StdioServerTransport();
+    await server.connect(transport);
+    console.error("LPTP-MCP-Server running on stdio");
+}
+runServer().catch((error) => {
+    console.error("Failed to run MCP Server:");
+    console.error(error);
+    process.exit(1);
+});
+//# sourceMappingURL=index.js.map

package/build/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAEA,wEAAmE;AACnE,wEAAiF;AACjF,iEAG4C;AAC5C,iDAA6G;AAE7G,MAAM,MAAM,GAAG,IAAI,iBAAM,CACrB;IACI,IAAI,EAAE,iBAAiB;IACvB,OAAO,EAAE,OAAO;CACnB,EACD;IACI,YAAY,EAAE;QACV,KAAK,EAAE,EAAE;KACZ;CACJ,CACJ,CAAC;AAEF,MAAM,oBAAoB,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8B5B,CAAC;AAEF,wEAAwE;AAExE,MAAM,aAAa,GAAG;IAClB,IAAI,EAAE,QAAiB;IACvB,UAAU,EAAE;QACR,OAAO,EAAE;YACL,IAAI,EAAE,QAAiB;YACvB,WAAW,EAAE,4FAA4F;SAC5G;QACD,OAAO,EAAE;YACL,IAAI,EAAE,QAAiB;YACvB,WAAW,EAAE,qEAAqE;SACrF;KACJ;IACD,QAAQ,EAAE,CAAC,SAAS,CAAC;CACxB,CAAC;AAEF,MAAM,eAAe,GAAG;IACpB,IAAI,EAAE,QAAiB;IACvB,UAAU,EAAE;QACR,cAAc,EAAE;YACZ,IAAI,EAAE,QAAiB;YACvB,WAAW,EAAE,sDAAsD;SACtE;QACD,OAAO,EAAE;YACL,IAAI,EAAE,QAAiB;YACvB,WAAW,EAAE,qEAAqE;SACrF;KACJ;IACD,QAAQ,EAAE,CAAC,gBAAgB,CAAC;CAC/B,CAAC;AAEF,wEAAwE;AAExE,MAAM,CAAC,iBAAiB,CAAC,iCAAsB,EAAE,KAAK,IAAI,EAAE;IACxD,OAAO;QACH,KAAK,EAAE;YACH,wDAAwD;YACxD;gBACI,IAAI,EAAE,kBAAkB;gBACxB,WAAW,EAAE,4DAA4D;gBACzE,WAAW,EAAE;oBACT,IAAI,EAAE,QAAQ;oBACd,UAAU,EAAE,EAAE;iBACjB;aACJ;YACD,wDAAwD;YACxD;gBACI,IAAI,EAAE,cAAc;gBACpB,WAAW,EAAE,yJAAyJ;gBACtK,WAAW,EAAE;oBACT,IAAI,EAAE,QAAQ;oBACd,UAAU,EAAE;wBACR,UAAU,EAAE;4BACR,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,uEAAuE;yBACvF;wBACD,OAAO,EAAE;4BACL,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,sFAAsF;yBACtG;qBACJ;oBACD,QAAQ,EAAE,CAAC,YAAY,CAAC;iBAC3B;aACJ;YACD;gBACI,IAAI,EAAE,aAAa;gBACnB,WAAW,EAAE,oJAAoJ;gBACjK,WAAW,EAAE;oBACT,IAAI,EAAE,QAAQ;oBACd,UAAU,EAAE;wBACR,SAAS,EAAE;4BACP,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,6DAA6D;yBAC7E;qBACJ;oBACD,QAAQ,EAAE,CAAC,WAAW,CAAC;iBAC1B;aACJ;YACD,wDAAwD;YACxD;gBACI,IAAI,EAAE,cAAc;gBACpB,WAAW,EAAE,kOAAkO;gBAC/O,WAAW,EAAE;oBACT,IAAI,EAAE,QAAQ;oBACd,UAAU,EAAE;wBACR,OAAO,EAAE;4BACL,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,4FAA4F;yBAC5G;wBACD,MAAM,EAAE;4BACJ,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,6EAA6E;yBAC7F;wBACD,OAAO,EAAE;4BACL,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,qEAAqE;yBACrF;qBACJ;oBACD,QAAQ,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC;iBAClC;aACJ;YACD,8DAA8D;YAC9D;gBACI,IAAI,EAAE,aAAa;gBACnB,WAAW,EAAE,qOAAqO;gBAClP,WAAW,EAAE;oBACT,IAAI,EAAE,QAAQ;oBACd,UAAU,EAAE;wBACR,OAAO,EAAE;4BACL,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,qDAAqD;yBACrE;wBACD,KAAK,EAAE;4BACH,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,gDAAgD;yBAChE;wBACD,OAAO,EAAE;4BACL,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,qEAAqE;yBACrF;wBACD,eAAe,EAAE;4BACb,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,+GAA+G;yBAC/H;wBACD,kBAAkB,EAAE;4BAChB,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,oGAAoG;yBACpH;qBACJ;oBACD,QAAQ,EAAE,CAAC,SAAS,CAAC;iBACxB;aACJ;YACD;gBACI,IAAI,EAAE,aAAa;gBACnB,WAAW,EAAE,gFAAgF;gBAC7F,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,aAAa;gBACnB,WAAW,EAAE,qGAAqG;gBAClH,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,aAAa;gBACnB,WAAW,EAAE,6EAA6E;gBAC1F,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,WAAW;gBACjB,WAAW,EAAE,gGAAgG;gBAC7G,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,aAAa;gBACnB,WAAW,EAAE,0FAA0F;gBACvG,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,YAAY;gBAClB,WAAW,EAAE,uFAAuF;gBACpG,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,cAAc;gBACpB,WAAW,EAAE,wHAAwH;gBACrI,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,YAAY;gBAClB,WAAW,EAAE,2FAA2F;gBACxG,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,eAAe;gBACrB,WAAW,EAAE,sEAAsE;gBACnF,WAAW,EAAE,aAAa;aAC7B;YACD;gBACI,IAAI,EAAE,cAAc;gBACpB,WAAW,EAAE,uJAAuJ;gBACpK,WAAW,EAAE,aAAa;aAC7B;YACD,wDAAwD;YACxD;gBACI,IAAI,EAAE,kBAAkB;gBACxB,WAAW,EAAE,yJAAyJ;gBACtK,WAAW,EAAE,eAAe;aAC/B;YACD;gBACI,IAAI,EAAE,YAAY;gBAClB,WAAW,EAAE,0HAA0H;gBACvI,WAAW,EAAE,eAAe;aAC/B;YACD,wDAAwD;YACxD;gBACI,IAAI,EAAE,YAAY;gBAClB,WAAW,EAAE,0RAA0R;gBACvS,WAAW,EAAE;oBACT,IAAI,EAAE,QAAQ;oBACd,UAAU,EAAE;wBACR,SAAS,EAAE;4BACP,IAAI,EAAE,QAAQ;4BACd,WAAW,EAAE,qHAAqH;yBACrI;qBACJ;oBACD,QAAQ,EAAE,CAAC,WAAW,CAAC;iBAC1B;aACJ;SACJ;KACJ,CAAC;AACN,CAAC,CAAC,CAAC;AAEH,wEAAwE;AAExE,MAAM,CAAC,iBAAiB,CAAC,gCAAqB,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE;IAC9D,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,SAAgB,CAAC;IAE7C,QAAQ,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC1B,KAAK,kBAAkB,CAAC,CAAC,CAAC;YACtB,OAAO;gBACH,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC;aAC1D,CAAC;QACN,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YAClB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YACtE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACjB,MAAM,MAAM,GAAG,MAAM,IAAA,yBAAU,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChD,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAChB,MAAM,MAAM,GAAG,MAAM,IAAA,wBAAS,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC/C,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,wDAAwD;QACxD,KAAK,cAAc,CAAC,CAAC,CAAC;YAClB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAChF,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,wDAAwD;QACxD,KAAK,aAAa,CAAC,CAAC,CAAC;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAC9B,MAAM,MAAM,GAAqD,EAAE,CAAC;YACpE,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI;gBAAE,MAAM,CAAC,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC;YAC/E,IAAI,IAAI,CAAC,kBAAkB,IAAI,IAAI;gBAAE,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC;YACjF,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,SAAS,KAAK,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC;YAC/F,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACjB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC7E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACjB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC7E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACjB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC7E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC3E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACjB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC7E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAChB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC5E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YAClB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC9E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAChB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC5E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,eAAe,CAAC,CAAC,CAAC;YACnB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC/E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YAClB,MAAM,MAAM,GAAG,MAAM,IAAA,0BAAW,EAAC,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC9E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,wDAAwD;QACxD,KAAK,kBAAkB,CAAC,CAAC,CAAC;YACtB,MAAM,MAAM,GAAG,MAAM,IAAA,8BAAe,EAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAC9E,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAChB,MAAM,MAAM,GAAG,MAAM,IAAA,wBAAS,EAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YACxE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAChE,CAAC;QACD;YACI,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;IACxC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,KAAK,UAAU,SAAS;IACpB,MAAM,SAAS,GAAG,IAAI,+BAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAChC,OAAO,CAAC,KAAK,CAAC,kCAAkC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;IACxB,OAAO,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC;IAC3C,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACrB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC,CAAC,CAAC"}

package/build/lptpExecutor.d.ts

@@ -0,0 +1,19 @@
+export interface ExecutionResult {
+    success: boolean;
+    output: string;
+    derivation?: string;
+    error?: string;
+    warnings?: number;
+    errors?: number;
+}
+export declare function verifyLemma(proofCode: string, context?: string): Promise<ExecutionResult>;
+export declare function applyTactic(formula: string, tactic: string, context?: string, limits?: {
+    timeLimitS?: number;
+    inferenceLimit?: number;
+    depthLimit?: number;
+}): Promise<ExecutionResult>;
+export declare function compileGr(filePath: string): Promise<ExecutionResult>;
+export declare function printDefinition(predicateName: string, context?: string): Promise<ExecutionResult>;
+export declare function listFacts(predicateName: string, context?: string): Promise<ExecutionResult>;
+export declare function checkProof(filePath: string): Promise<ExecutionResult>;
+//# sourceMappingURL=lptpExecutor.d.ts.map

package/build/lptpExecutor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lptpExecutor.d.ts","sourceRoot":"","sources":["../src/lptpExecutor.ts"],"names":[],"mappings":"AAyDA,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAkDD,wBAAsB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,MAAW,GAAG,OAAO,CAAC,eAAe,CAAC,CAiEnG;AAED,wBAAsB,WAAW,CAC7B,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,MAAW,EACpB,MAAM,GAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GACnF,OAAO,CAAC,eAAe,CAAC,CAiF1B;AAED,wBAAsB,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC,CA6D1E;AAED,wBAAsB,eAAe,CAAC,aAAa,EAAE,MAAM,EAAE,OAAO,GAAE,MAAW,GAAG,OAAO,CAAC,eAAe,CAAC,CAsE3G;AAED,wBAAsB,SAAS,CAAC,aAAa,EAAE,MAAM,EAAE,OAAO,GAAE,MAAW,GAAG,OAAO,CAAC,eAAe,CAAC,CAqDrG;AAED,wBAAsB,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC,CA2F3E"}