fitch-js 0.1.0

package/dist/cjs/proofChecker.js

@@ -0,0 +1,163 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.checkProof = checkProof;
+Object.defineProperty(exports, "formulasEqual", {
+  enumerable: true,
+  get: function get() {
+    return _ruleValidators.formulasEqual;
+  }
+});
+exports.getAvailableTerms = getAvailableTerms;
+Object.defineProperty(exports, "isLineAvailable", {
+  enumerable: true,
+  get: function get() {
+    return _ruleValidators.isLineAvailable;
+  }
+});
+Object.defineProperty(exports, "isValidCitation", {
+  enumerable: true,
+  get: function get() {
+    return _ruleValidators.isValidCitation;
+  }
+});
+Object.defineProperty(exports, "occursFree", {
+  enumerable: true,
+  get: function get() {
+    return _ruleValidators.occursFree;
+  }
+});
+Object.defineProperty(exports, "substitute", {
+  enumerable: true,
+  get: function get() {
+    return _ruleValidators.substitute;
+  }
+});
+var _types = require("./types.js");
+var _ruleValidators = require("./ruleValidators.js");
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+/**
+ * Gets all available terms from premises and hypotheses at the current scope
+ * @param {import('./types').ProofLine[]} previousLines
+ * @param {number[]} currentLocation
+ * @returns {Set<string>}
+ */
+function getAvailableTerms(previousLines, currentLocation) {
+  var terms = new Set();
+  var _iterator = _createForOfIteratorHelper(previousLines),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var line = _step.value;
+      if ((line.rule === _types.RULES.PREMISE || line.rule === _types.RULES.HYPOTHESIS) && (0, _ruleValidators.isLineAvailable)(currentLocation, line.location)) {
+        (0, _types.getAllTerms)(line.formula).forEach(function (term) {
+          return terms.add(term);
+        });
+      }
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  return terms;
+}
+
+/**
+ * Validates a single proof line
+ * @param {import('./types').ProofLine} line
+ * @param {import('./types').ProofLine[]} previousLines
+ * @param {number} lineIndex
+ * @param {number} numPremises
+ * @returns {string[]} Array of issues found
+ */
+function validateLine(line, previousLines, lineIndex, numPremises) {
+  var issues = [];
+
+  // Validate premises
+  if (lineIndex < numPremises) {
+    if (line.rule !== _types.RULES.PREMISE) {
+      issues.push('Line must be marked as a premise');
+    }
+    return issues;
+  }
+
+  // Check rule requirements exist
+  var requirements = _types.RULE_REQUIREMENTS[line.rule];
+  if (!requirements) {
+    issues.push("Unknown rule: ".concat(line.rule));
+    return issues;
+  }
+
+  // Validate citation counts
+  if (line.citations.length !== requirements.lines) {
+    issues.push("Rule ".concat(line.rule, " requires exactly ").concat(requirements.lines, " line citations"));
+  }
+  if (line.subproofs.length !== requirements.subproofs) {
+    issues.push("Rule ".concat(line.rule, " requires exactly ").concat(requirements.subproofs, " subproof citations"));
+  }
+
+  // Skip structural rules that don't need validation
+  if (line.rule === _types.RULES.PREMISE || line.rule === _types.RULES.HYPOTHESIS) {
+    return issues;
+  }
+
+  // Get the appropriate validator and execute it
+  var validator = _ruleValidators.RULE_VALIDATORS[line.rule];
+  if (validator) {
+    validator(line, previousLines, lineIndex, issues);
+  }
+  return issues;
+}
+
+/**
+ * Validates an entire proof
+ * @param {import('./types').Proof} proof
+ * @returns {import('./types').ValidationResult}
+ */
+function checkProof(proof) {
+  var result = {
+    isValid: true,
+    issues: [],
+    conclusionReached: false
+  };
+
+  // Validate each line
+  var _loop = function _loop(i) {
+    var line = proof.lines[i];
+    var previousLines = proof.lines.slice(0, i);
+    var lineIssues = validateLine(line, previousLines, i, proof.numPremises);
+    if (lineIssues.length > 0) {
+      var _result$issues;
+      result.isValid = false;
+      (_result$issues = result.issues).push.apply(_result$issues, _toConsumableArray(lineIssues.map(function (issue) {
+        return "Line ".concat(i + 1, ": ").concat(issue);
+      })));
+    }
+
+    // Check if conclusion is reached
+    if ((0, _ruleValidators.formulasEqual)(line.formula, proof.conclusion)) {
+      result.conclusionReached = true;
+    }
+  };
+  for (var i = 0; i < proof.lines.length; i++) {
+    _loop(i);
+  }
+
+  // Verify conclusion was reached
+  if (!result.conclusionReached) {
+    result.issues.push('Conclusion not reached in proof');
+    result.isValid = false;
+  }
+  return result;
+}
+
+// Re-export utilities for external use