occam-verify-cli 0.0.524 → 0.0.525

package/src/equality.js

@@ -1,9 +1,10 @@
 "use strict";
 
 import { nodeQuery } from "./utilities/query";
+import { TERM_RULE_NAME } from "./ruleNames";
 
-const leftTermNodeQuery = nodeQuery("/statement/term[0]"),
-      rightTermNodeQuery = nodeQuery("/statement/term[1]");
+const leftTermNodeQuery = nodeQuery("/statement/argument[0]/term!"),
+      rightTermNodeQuery = nodeQuery("/statement/argument[1]/term!");
 
 export default class Equality {
   constructor(leftTermNode, rightTermNode) {
@@ -11,7 +12,7 @@ export default class Equality {
     this.rightTermNode = rightTermNode;
   }
 
-  getLdftTermNode() {
+  getLeftTermNode() {
     return this.leftTermNode;
   }
 
@@ -19,8 +20,79 @@ export default class Equality {
     return this.rightTermNode;
   }
 
-  assert(proofContext) {
-    debugger
+  match(equality, equalities) {
+    let matches = false;
+
+    const leftTermNode = equality.getLeftTermNode(),
+          rightTermNode = equality.getRightTermNode();
+
+    if (!matches) {
+      const reversed = false,
+            leftTermNodeAndRightTermNodeMatch = this.matchLeftTermNodeAndRightTermNode(leftTermNode, rightTermNode, reversed, equalities);
+
+      matches = leftTermNodeAndRightTermNodeMatch;  ///
+    }
+
+    if (!matches) {
+      const reversed = true,
+            leftTermNodeAndRightTermNodeMatch = this.matchLeftTermNodeAndRightTermNode(leftTermNode, rightTermNode, reversed, equalities);
+
+      matches = leftTermNodeAndRightTermNodeMatch;  ///
+    }
+
+    return matches;
+  }
+
+  matchLeftTermNodeAndRightTermNode(leftTermNode, rightTermNode, reversed, equalities) {
+    let leftTermNodeAndRightTermNodeMatch = true;
+
+    if (leftTermNodeAndRightTermNodeMatch) {
+      const leftNonTerminalNode = reversed ?
+                                    this.rightTermNode :
+                                      this.leftTermNode,  ///
+            rightNonTerminalNode = leftTermNode,  ///
+            nonTerminalNodeEquates = equateNonTerminalNode(leftNonTerminalNode, rightNonTerminalNode, equalities);
+
+      leftTermNodeAndRightTermNodeMatch = nonTerminalNodeEquates; ///
+    }
+
+    if (leftTermNodeAndRightTermNodeMatch) {
+      const leftNonTerminalNode = reversed ?
+                                    this.leftTermNode :
+                                      this.rightTermNode,  ///
+            rightNonTerminalNode = rightTermNode,  ///
+            nonTerminalNodeEquates = equateNonTerminalNode(leftNonTerminalNode, rightNonTerminalNode, equalities);
+
+      leftTermNodeAndRightTermNodeMatch = nonTerminalNodeEquates; ///
+    }
+
+    return leftTermNodeAndRightTermNodeMatch;
+  }
+
+  equate(equalities) {
+    const leftNonTerminalNode = this.leftTermNode,  ///
+          rightNonTerminalNode = this.rightTermNode,  ///
+          nonTerminalNodeEquates = equateNonTerminalNode(leftNonTerminalNode, rightNonTerminalNode, equalities),
+          equates = nonTerminalNodeEquates; ///
+
+    return equates;
+  }
+
+  static fromProofStep(proofStep) {
+    let equality = null;
+
+    const statementNode = proofStep.getStatementNode();
+
+    if (statementNode !== null) {
+      const leftTermNode = leftTermNodeQuery(statementNode),
+            rightTermNode = rightTermNodeQuery(statementNode);
+
+      if ((leftTermNode !== null) && (rightTermNode !== null)) {
+        equality = new Equality(leftTermNode, rightTermNode);
+      }
+    }
+
+    return equality;
   }
 
   static fromStatementNode(statementNode) {
@@ -30,4 +102,129 @@ export default class Equality {
 
     return equality;
   }
+
+  static fromLeftTermNodeAndRightTermNode(leftTermNode, rightTermNode) {
+    const equality = new Equality(leftTermNode, rightTermNode);
+
+    return equality;
+  }
+}
+
+function equateNode(nodeA, nodeB, equalities) {
+  let nodeEquates = false;
+
+  const nodeATerminalNode = nodeA.isTerminalNode(),
+        nodeBTerminalNode = nodeB.isTerminalNode();
+
+  if (nodeATerminalNode === nodeBTerminalNode) {
+    if (nodeATerminalNode) {
+      const terminalNodeA = nodeA,  ///
+            terminalNodeB = nodeB,  ///
+            terminalNodeEquates = equateTerminalNode(terminalNodeA, terminalNodeB, equalities);
+
+      nodeEquates = terminalNodeEquates;  ///
+    } else {
+      const nonTerminalNodeA = nodeA,  ///
+            nonTerminalNodeB = nodeB, ///
+            nonTerminalNodeEquates = equateNonTerminalNode(nonTerminalNodeA, nonTerminalNodeB, equalities);
+
+      nodeEquates = nonTerminalNodeEquates; ///
+    }
+  }
+
+  return nodeEquates;
+}
+
+function equateNodes(leftNodes, rightNodes, equalities) {
+  let nodesEquate = false;
+
+  const leftNodesLength = leftNodes.length,
+        rightNodesLength = rightNodes.length;
+
+  if (leftNodesLength === rightNodesLength) {
+    nodesEquate = leftNodes.every((LeftNode, index) => {
+      const rightNode = rightNodes[index],
+            nodeEquates = equateNode(LeftNode, rightNode, equalities);
+
+      if (nodeEquates) {
+        return true;
+      }
+    });
+  }
+
+  return nodesEquate;
+}
+
+function equateTerminalNode(terminalNodeA, terminalNodeB, equalities) {
+  const matches = terminalNodeA.match(terminalNodeB),
+        terminalNodeEquates = matches;  ///
+
+  return terminalNodeEquates;
+}
+
+function equateNonTerminalNode(leftNonTerminalNode, rightNonTerminalNode, equalities) {
+  let nonTerminalNodeEquates = false;
+
+  const leftNonTerminalNodeRuleName = leftNonTerminalNode.getRuleName(),
+        rightNonTerminalNodeRuleName = rightNonTerminalNode.getRuleName();
+
+  if (leftNonTerminalNodeRuleName === rightNonTerminalNodeRuleName) {
+    const ruleName = leftNonTerminalNodeRuleName, ///
+          ruleNameTermRuleName = (ruleName === TERM_RULE_NAME);
+
+    if (ruleNameTermRuleName) {
+      const leftTermNode = leftNonTerminalNode, ///
+            rightTermNode = rightNonTerminalNode, ///
+            termNodeEquates = equateTermNode(leftTermNode, rightTermNode, equalities);
+
+      nonTerminalNodeEquates = termNodeEquates;  ///
+    }
+
+    if (!nonTerminalNodeEquates) {
+      const leftNonTerminalNodeChildNodes = leftNonTerminalNode.getChildNodes(),
+            rightNonTerminalNodeChildNodes = rightNonTerminalNode.getChildNodes(),
+            leftNodes = leftNonTerminalNodeChildNodes, ///
+            rightNodes = rightNonTerminalNodeChildNodes, ///
+            nodesEquate = equateNodes(leftNodes, rightNodes, equalities);
+
+      nonTerminalNodeEquates = nodesEquate; ///
+    }
+  }
+
+  return nonTerminalNodeEquates;
+}
+
+function equateTermNode(leftTermNode, rightTermNode, equalities) {
+  const equality = Equality.fromLeftTermNodeAndRightTermNode(leftTermNode, rightTermNode),
+        equalityA = equality, ///
+        equalityMatches = equalities.some((equality) => { ///
+          let equalitiesB = equalities; ///
+
+          const equalityB = equality; ///
+
+          equalitiesB = filterEqualities(equalitiesB, equalityB);  ///
+
+          const equalityAMatchesEqualityB = equalityA.match(equalityB, equalitiesB);
+
+          if (equalityAMatchesEqualityB) {
+            return true;
+          }
+        }),
+        termNodeEquates = equalityMatches;  ///
+
+  return termNodeEquates;
+}
+
+function filterEqualities(equalities, equality) {
+  const equalityA = equality; ///
+
+  equalities = equalities.filter((equality) => {
+    const equalityB = equality; ///
+
+    if (equalityA !== equalityB) {
+      return true;
+    }
+  });
+
+  return equalities;
 }

package/src/verify/derivation.js

@@ -107,8 +107,10 @@ function verifyChild(childNode, proofContext) {
     }
 
     case QUALIFIED_STATEMENT_RULE_NAME: {
-      const qualifiedStatementNode = childNode,  ///
-            qualifiedStatementVerified = verifyQualifiedStatement(qualifiedStatementNode, proofContext);
+      const derived = true,
+            assertions = [],
+            qualifiedStatementNode = childNode,  ///
+            qualifiedStatementVerified = verifyQualifiedStatement(qualifiedStatementNode, assertions, derived, proofContext);
 
       if (qualifiedStatementVerified) {
         const statementNode = statementNodeQuery(qualifiedStatementNode),

package/src/verify/metastatement/qualified.js

@@ -8,7 +8,7 @@ import { nodeQuery, referenceNameFromReferenceNode } from "../../utilities/query
 const referenceNodeQuery = nodeQuery("/qualifiedMetastatement/qualification!/reference!"),
       metastatementNodeQuery = nodeQuery("/qualifiedMetastatement/metastatement!");
 
-export default function verifyQualifiedMetastatement(qualifiedMetastatementNode, metaproofContext) {
+export default function verifyQualifiedMetastatement(qualifiedMetastatementNode, assertions, derived, metaproofContext) {
   let qualifiedMetastatementVerified = false;
 
   metaproofContext.begin(qualifiedMetastatementNode);
@@ -20,7 +20,7 @@ export default function verifyQualifiedMetastatement(qualifiedMetastatementNode,
 
     metaproofContext.debug(`Verifying the ${metastatementString} qualified metastatement...`);
 
-    let ruleMatchesStatement = true;
+    let ruleMatchesMetastatement = true;
 
     const referenceNode = referenceNodeQuery(qualifiedMetastatementNode);
 
@@ -29,15 +29,12 @@ export default function verifyQualifiedMetastatement(qualifiedMetastatementNode,
             rule = metaproofContext.findRuleByReferenceName(referenceName);
 
       if (rule !== null) {
-        const ruleMatchesStatement = rule.matchMetastatement(metastatementNode, metaproofContext);
-
-        qualifiedMetastatementVerified = ruleMatchesStatement;  ///
+        ruleMatchesMetastatement = rule.matchMetastatement(metastatementNode, metaproofContext);
       }
     }
 
-    if (ruleMatchesStatement) {
-      const assertions = [],
-            metastatementVerified = verifyMetastatement(metastatementNode, assertions, metaproofContext);
+    if (ruleMatchesMetastatement) {
+      const metastatementVerified = verifyMetastatement(metastatementNode, assertions, derived, metaproofContext);
 
       qualifiedMetastatementVerified = metastatementVerified; ///
     }

package/src/verify/metastatement/unqualified.js

@@ -26,7 +26,7 @@ export default function verifyUnqualifiedMetastatement(unqualifiedMetastatementN
     }
 
     if (metastatementMatches) {
-      const metastatementVerified = verifyMetastatement(metastatementNode, assertions, metaproofContext);
+      const metastatementVerified = verifyMetastatement(metastatementNode, assertions, derived, metaproofContext);
 
       unqualifiedMetastatementVerified = metastatementVerified; ///
     }

package/src/verify/metastatement.js

@@ -1,6 +1,6 @@
 "use strict";
 
-export default function verifyMetastatement(metastatementNode, assertions, metaproofContext) {
+export default function verifyMetastatement(metastatementNode, assertions, derived, metaproofContext) {
   let metastatementVerified = true; ///
 
   metaproofContext.begin(metastatementNode);

package/src/verify/ruleDerivation.js

@@ -107,8 +107,10 @@ function verifyChild(childNode, metaproofContext) {
     }
 
     case QUALIFIED_METASTATEMENT_RULE_NAME: {
-      const qualifiedMetastatementNode = childNode,  ///
-            qualifiedMetastatementVerified = verifyQualifiedMetastatement(qualifiedMetastatementNode, metaproofContext);
+      const derived = true,
+            assertions = [],
+            qualifiedMetastatementNode = childNode,  ///
+            qualifiedMetastatementVerified = verifyQualifiedMetastatement(qualifiedMetastatementNode, assertions, derived, metaproofContext);
 
       if (qualifiedMetastatementVerified) {
         const metastatementNode = metastatementNodeQuery(qualifiedMetastatementNode),

package/src/verify/statement/qualified.js

@@ -8,7 +8,7 @@ import { nodeQuery, referenceNameFromReferenceNode } from "../../utilities/query
 const referenceNodeQuery = nodeQuery("/qualifiedStatement/qualification!/reference!"),
       statementNodeQuery = nodeQuery("/qualifiedStatement/statement!");
 
-export default function verifyQualifiedStatement(qualifiedStatementNode, proofContext) {
+export default function verifyQualifiedStatement(qualifiedStatementNode, assertions, derived, proofContext) {
   let qualifiedStatementVerified = false;
 
   proofContext.begin(qualifiedStatementNode);
@@ -34,8 +34,8 @@ export default function verifyQualifiedStatement(qualifiedStatementNode, proofCo
     }
 
     if (ruleMatchesStatement) {
-      const assertions = [],
-            statementVerified = verifyStatement(statementNode, assertions, proofContext);
+      const context = proofContext,
+            statementVerified = verifyStatement(statementNode, assertions, derived, context);
 
       qualifiedStatementVerified = statementVerified; ///
     }

package/src/verify/statement/unqualified.js

@@ -26,7 +26,8 @@ export default function verifyUnqualifiedStatement(unqualifiedStatementNode, ass
     }
 
     if (statementMatches) {
-      const statementVerified = verifyStatement(statementNode, assertions, proofContext);
+      const context = proofContext, ///
+            statementVerified = verifyStatement(statementNode, assertions, derived, context);
 
       unqualifiedStatementVerified = statementVerified;  ///
     }

package/src/verify/statement.js

@@ -1,5 +1,6 @@
 "use strict";
 
+import Equality from "../equality";
 import verifyTerm from "../verify/term";
 import equalityCombinator from "../ocmbinator/equality";
 import bracketedCombinator from "../ocmbinator/bracketed";
@@ -10,6 +11,7 @@ import { objectType } from "../type";
 import { nodeAsString } from "../utilities/string";
 import { OBJECT_TYPE_NAME } from "../typeNames";
 import { STATEMENT_META_TYPE } from "../metaTypes";
+import { MAXIMUM_INDEXES_LENGTH } from "../constants";
 import { nodeQuery, typeNameFromTypeNode } from "../utilities/query";
 import { ARGUMENT_RULE_NAME, META_ARGUMENT_RULE_NAME } from "../ruleNames";
 
@@ -19,56 +21,65 @@ const termNodeQuery = nodeQuery("/argument/term!"),
       statementNodeQuery = nodeQuery("/metaArgument/statement!"),
       typeAssertionNodeQuery = nodeQuery("/statement/typeAssertion!");
 
-export default function verifyStatement(statementNode, assertions, proofContext) {
+export default function verifyStatement(statementNode, assertions, derived, context) {
   let statementVerified = false;
 
-  proofContext.begin(statementNode);
+  context.begin(statementNode);
 
   if (!statementVerified) {
-    const statementVerifiedAsEquality = verifyStatementAsEquality(statementNode, proofContext);
+    const statementVerifiedAsEquality = verifyStatementAsEquality(statementNode, derived, context);
 
     statementVerified = statementVerifiedAsEquality;  //
   }
 
   if (!statementVerified) {
-    const statementVerifiedAsTypeAssertion = verifyStatementAsTypeAssertion(statementNode, assertions, proofContext);
+    const statementVerifiedAsTypeAssertion = verifyStatementAsTypeAssertion(statementNode, assertions, context);
 
     statementVerified = statementVerifiedAsTypeAssertion; ///
   }
 
   if (!statementVerified) {
-    const statementVerifiedAgainstCombinators = verifyStatementAgainstCombinators(statementNode, proofContext);
+    const statementVerifiedAgainstCombinators = verifyStatementAgainstCombinators(statementNode, context);
 
     statementVerified = statementVerifiedAgainstCombinators;  ///
   }
 
   statementVerified ?
-    proofContext.complete(statementNode) :
-      proofContext.halt(statementNode);
+    context.complete(statementNode) :
+      context.halt(statementNode);
 
   return statementVerified;
 }
 
-function verifyStatementAsEquality(statementNode, proofContext) {
+function verifyStatementAsEquality(statementNode, derived, context) {
   let statementVerifiedAsEquality = false;
 
   const combinator = equalityCombinator,  ///
-        statementVerifiedAgainstCombinator = verifyStatementAgainstCombinator(statementNode, combinator, proofContext);
+        statementVerifiedAgainstCombinator = verifyStatementAgainstCombinator(statementNode, combinator, context);
 
   if (statementVerifiedAgainstCombinator) {
     statementVerifiedAsEquality = true;
+
+    if (derived) {
+      const equality = Equality.fromStatementNode(statementNode),
+            proofSteps = context.getProofSteps(),
+            equalities = equalitiesFromProofSteps(proofSteps),
+            equalityEquates = equality.equate(equalities);
+
+      statementVerifiedAsEquality = equalityEquates; ///
+    }
   }
 
   return statementVerifiedAsEquality;
 }
 
-function verifyStatementAsTypeAssertion(statementNode, assertions, proofContext) {
+function verifyStatementAsTypeAssertion(statementNode, assertions, context) {
   let statementVerifiedAsTypeAssertion = false;
 
   const typeAssertionNode = typeAssertionNodeQuery(statementNode);
 
   if (typeAssertionNode !== null) {
-    const typeAssertionVerified = verifyTypeAssertion(typeAssertionNode, assertions, proofContext);
+    const typeAssertionVerified = verifyTypeAssertion(typeAssertionNode, assertions, context);
 
     statementVerifiedAsTypeAssertion = typeAssertionVerified; ///
   }
@@ -76,10 +87,10 @@ function verifyStatementAsTypeAssertion(statementNode, assertions, proofContext)
   return statementVerifiedAsTypeAssertion;
 }
 
-function verifyStatementAgainstCombinators(statementNode, proofContext) {
+function verifyStatementAgainstCombinators(statementNode, context) {
   let statementVerifiedAgainstCombinators = false;
 
-  let combinators = proofContext.getCombinators();
+  let combinators = context.getCombinators();
 
   combinators = [ ///
     bracketedCombinator,
@@ -87,7 +98,7 @@ function verifyStatementAgainstCombinators(statementNode, proofContext) {
   ];
 
   const combinator = combinators.find((combinator) => {
-          const statementVerifiedAgainstCombinator = verifyStatementAgainstCombinator(statementNode, combinator, proofContext);
+          const statementVerifiedAgainstCombinator = verifyStatementAgainstCombinator(statementNode, combinator, context);
 
           if (statementVerifiedAgainstCombinator) {
             return true;
@@ -101,17 +112,17 @@ function verifyStatementAgainstCombinators(statementNode, proofContext) {
   return statementVerifiedAgainstCombinators;
 }
 
-function verifyStatementAgainstCombinator(statementNode, combinator, proofContext) {
+function verifyStatementAgainstCombinator(statementNode, combinator, context) {
   const combinatorStatementNode = combinator.getStatementNode(),
         node = statementNode,  ///
         combinatorNode = combinatorStatementNode, ///
-        nodeVerified = verifyNode(node, combinatorNode, proofContext),
+        nodeVerified = verifyNode(node, combinatorNode, context),
         statementVerifiedAgainstCombinator = nodeVerified;  ///
 
   return statementVerifiedAgainstCombinator;
 }
 
-function verifyNode(node, combinatorNode, proofContext) {
+function verifyNode(node, combinatorNode, context) {
   let nodeVerified;
 
   const nodeTerminalNode = node.isTerminalNode(),
@@ -121,13 +132,13 @@ function verifyNode(node, combinatorNode, proofContext) {
     if (nodeTerminalNode) {
       const terminalNode = node,  ///
             combinatorTerminalNode = combinatorNode,  ///
-            terminalNodeVerified = verifyTerminalNode(terminalNode, combinatorTerminalNode, proofContext);
+            terminalNodeVerified = verifyTerminalNode(terminalNode, combinatorTerminalNode, context);
 
       nodeVerified = terminalNodeVerified;  ///
     } else {
       const nonTerminalNode = node, ///
             combinatorNonTerminalNode = combinatorNode,  ///
-            nonTerminalNodeVerified = verifyNonTerminalNode(nonTerminalNode, combinatorNonTerminalNode, proofContext);
+            nonTerminalNodeVerified = verifyNonTerminalNode(nonTerminalNode, combinatorNonTerminalNode, context);
 
       nodeVerified = nonTerminalNodeVerified; ///
     }
@@ -136,7 +147,7 @@ function verifyNode(node, combinatorNode, proofContext) {
   return nodeVerified;
 }
 
-function verifyNodes(nodes, combinatorNodes, proofContext) {
+function verifyNodes(nodes, combinatorNodes, context) {
   let nodesVerified = false;
 
   const nodesLength = nodes.length,
@@ -145,7 +156,7 @@ function verifyNodes(nodes, combinatorNodes, proofContext) {
   if (nodesLength === combinatorNodesLength) {
     nodesVerified = nodes.every((node, index) => {
       const combinatorNode = combinatorNodes[index],
-            nodeVerified = verifyNode(node, combinatorNode, proofContext);
+            nodeVerified = verifyNode(node, combinatorNode, context);
 
       if (nodeVerified) {
         return true;
@@ -156,7 +167,7 @@ function verifyNodes(nodes, combinatorNodes, proofContext) {
   return nodesVerified;
 }
 
-function verifyTerminalNode(terminalNode, combinatorTerminalNode, proofContext) {
+function verifyTerminalNode(terminalNode, combinatorTerminalNode, context) {
   let terminalNodeVerified = false;
 
   const matches = terminalNode.match(combinatorTerminalNode);
@@ -168,7 +179,7 @@ function verifyTerminalNode(terminalNode, combinatorTerminalNode, proofContext)
   return terminalNodeVerified;
 }
 
-function verifyNonTerminalNode(nonTerminalNode, combinatorNonTerminalNode, proofContext) {
+function verifyNonTerminalNode(nonTerminalNode, combinatorNonTerminalNode, context) {
   let nonTerminalNodeVerified = false;
 
   const ruleName = nonTerminalNode.getRuleName(), ///
@@ -179,7 +190,7 @@ function verifyNonTerminalNode(nonTerminalNode, combinatorNonTerminalNode, proof
       case ARGUMENT_RULE_NAME: {
         const argumentNode = nonTerminalNode, ///
               combinatorArgumentNode = combinatorNonTerminalNode, ///
-              argumentNodeVerified = verifyArgumentNode(argumentNode, combinatorArgumentNode, proofContext);
+              argumentNodeVerified = verifyArgumentNode(argumentNode, combinatorArgumentNode, context);
 
         nonTerminalNodeVerified = argumentNodeVerified; ///
 
@@ -189,7 +200,7 @@ function verifyNonTerminalNode(nonTerminalNode, combinatorNonTerminalNode, proof
       case META_ARGUMENT_RULE_NAME: {
         const metaArgumentNode = nonTerminalNode, ///
               combinatorMetaargumentNode = combinatorNonTerminalNode, ///
-              metaArgumentNodeVerified = verifyMetaargumentNode(metaArgumentNode, combinatorMetaargumentNode, proofContext);
+              metaArgumentNodeVerified = verifyMetaargumentNode(metaArgumentNode, combinatorMetaargumentNode, context);
 
         nonTerminalNodeVerified = metaArgumentNodeVerified; ///
 
@@ -201,7 +212,7 @@ function verifyNonTerminalNode(nonTerminalNode, combinatorNonTerminalNode, proof
               combinatorChildNodes = combinatorNonTerminalNode.getChildNodes(),
               nodes = childNodes, ///
               combinatorNodes = combinatorChildNodes, ///
-              nodesVerified = verifyNodes(nodes, combinatorNodes, proofContext);
+              nodesVerified = verifyNodes(nodes, combinatorNodes, context);
 
         nonTerminalNodeVerified = nodesVerified; ///
 
@@ -213,7 +224,7 @@ function verifyNonTerminalNode(nonTerminalNode, combinatorNonTerminalNode, proof
   return nonTerminalNodeVerified;
 }
 
-function verifyArgumentNode(argumentNode, combinatorArgumentNode, proofContext) {
+function verifyArgumentNode(argumentNode, combinatorArgumentNode, context) {
   let argumentNodeVerified = false;
 
   const termNode = termNodeQuery(argumentNode);
@@ -221,10 +232,9 @@ function verifyArgumentNode(argumentNode, combinatorArgumentNode, proofContext)
   if (termNode === null) {
     const argumentString = nodeAsString(argumentNode);
 
-    proofContext.error(`The ${argumentString} argument should be a term, not a type`);
+    context.error(`The ${argumentString} argument should be a term, not a type`);
   } else {
     const types = [],
-          context = proofContext, ///
           termVerified = verifyTerm(termNode, types, context);
 
     if (termVerified) {
@@ -234,7 +244,7 @@ function verifyArgumentNode(argumentNode, combinatorArgumentNode, proofContext)
             typeName = typeNameFromTypeNode(typeNode),
             type = (typeName === OBJECT_TYPE_NAME) ?
                      objectType :  ///
-                       proofContext.findTypeByTypeName(typeName),
+                       context.findTypeByTypeName(typeName),
             statementTypeEqualToOrSubTypeOfType = termType.isEqualToOrSubTypeOf(type);
 
       if (statementTypeEqualToOrSubTypeOfType) {
@@ -246,7 +256,7 @@ function verifyArgumentNode(argumentNode, combinatorArgumentNode, proofContext)
   return argumentNodeVerified;
 }
 
-function verifyMetaargumentNode(metaArgumentNode, combinatorMetaargumentNode, proofContext) {
+function verifyMetaargumentNode(metaArgumentNode, combinatorMetaargumentNode, context) {
   let metaArgumentNodeVerified = false;
 
   const statementNode = statementNodeQuery(metaArgumentNode);
@@ -254,10 +264,11 @@ function verifyMetaargumentNode(metaArgumentNode, combinatorMetaargumentNode, pr
   if (statementNode === null) {
     const metaArgumentString = nodeAsString(metaArgumentNode);
 
-    proofContext.error(`The '${metaArgumentString}' meta-argument should be a statement, not a meta-type.`);
+    context.error(`The '${metaArgumentString}' meta-argument should be a statement, not a meta-type.`);
   } else {
-    const assertions = null,
-          statementVerified = verifyStatement(statementNode, assertions, proofContext);
+    const derived = false,
+          assertions = null,
+          statementVerified = verifyStatement(statementNode, assertions, derived, context);
 
     if (statementVerified) {
       const combinatorMetaTYpeNode = metaTypeNodeQuery(combinatorMetaargumentNode);
@@ -273,10 +284,28 @@ function verifyMetaargumentNode(metaArgumentNode, combinatorMetaargumentNode, pr
       if (!metaArgumentNodeVerified) {
         const combinatorMetaargumentString = nodeAsString(combinatorMetaargumentNode);
 
-        proofContext.error(`The '${combinatorMetaargumentString}' combinator meta-argument should be the 'Statement' meta-type.`);
+        context.error(`The '${combinatorMetaargumentString}' combinator meta-argument should be the 'Statement' meta-type.`);
       }
     }
   }
 
   return metaArgumentNodeVerified;
 }
+
+function equalitiesFromProofSteps(proofSteps) {
+  const start = -MAXIMUM_INDEXES_LENGTH;  ///
+
+  proofSteps = proofSteps.slice(start); ///
+
+  const equalities = proofSteps.reduce((equalities, proofStep, index) => {
+    const equality = Equality.fromProofStep(proofStep);
+
+    if (equality !== null) {
+      equalities.push(equality);
+    }
+
+    return equalities;
+  }, []);
+
+  return equalities;
+}