eyeling 1.26.4 → 1.26.6

package/dist/browser/eyeling.browser.js

@@ -6212,16 +6212,16 @@ function __computeConclusionFromFormula(formula) {
   for (const tr of formula.triples) {
     // Treat {A} => {B} as a forward rule.
     if (isLogImplies(tr.p)) {
-      fw.push(__makeRuleFromTerms(tr.s, tr.o, true));
+      fw.push(__copyProofSource(tr, __makeRuleFromTerms(tr.s, tr.o, true)));
       continue;
     }
 
     // Treat {A} <= {B} as the same rule in the other direction, i.e., {B} => {A},
     // so it participates in deductive closure even if only <= is used.
     if (isLogImpliedBy(tr.p)) {
-      fw.push(__makeRuleFromTerms(tr.o, tr.s, true));
+      fw.push(__copyProofSource(tr, __makeRuleFromTerms(tr.o, tr.s, true)));
       // Also index it as a backward rule for completeness (helps proveGoals in some cases).
-      bw.push(__makeRuleFromTerms(tr.s, tr.o, false));
+      bw.push(__copyProofSource(tr, __makeRuleFromTerms(tr.s, tr.o, false)));
       continue;
     }
   }
@@ -8735,7 +8735,7 @@ function forwardChain(facts, forwardRules, backRules, onDerived /* optional */,
           // Promote rule-producing triples to live rules, treating literal true as {}
           // and literal false as a fuse head.
           if (isFwRuleTriple) {
-            const newRule = __makeRuleFromTerms(subj, obj, true);
+            const newRule = __copyProofSource(r, __makeRuleFromTerms(subj, obj, true));
             __prepareForwardRule(newRule);
 
             const key = __ruleKey(
@@ -8752,7 +8752,7 @@ function forwardChain(facts, forwardRules, backRules, onDerived /* optional */,
               rulesChanged = true;
             }
           } else if (isBwRuleTriple) {
-            const newRule = __makeRuleFromTerms(subj, obj, false);
+            const newRule = __copyProofSource(r, __makeRuleFromTerms(subj, obj, false));
 
             const key = __ruleKey(
               newRule.isForward,

package/examples/proof/backward.n3

@@ -0,0 +1,21 @@
+@prefix : <http://example.org/#> .
+@prefix math: <http://www.w3.org/2000/10/swap/math#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+5 :isIndeedMoreInterestingThan 3 .
+
+{ 5 :isIndeedMoreInterestingThan 3 . } pe:why {
+  { 5 :isIndeedMoreInterestingThan 3 . }
+    pe:by [ pe:rule "backward.n3"; pe:line 18 ];
+    pe:uses { 5 :moreInterestingThan 3 . }.
+
+  { 5 :moreInterestingThan 3 . }
+    pe:by [ pe:rule "backward.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value 5 ],
+      [ pe:var "Y"; pe:value 3 ];
+    pe:uses { 5 math:greaterThan 3 . }.
+
+  { 5 math:greaterThan 3 . }
+    pe:by [ pe:builtin math:greaterThan ].
+}.

package/examples/proof/composition-of-injective-functions-is-injective.n3

@@ -0,0 +1,196 @@
+@prefix : <http://examples.org/#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:result :sameInputByCompositeInjectivity (:h :a :b) .
+:result :sameInputByCompositeInjectivity (:h :b :a) .
+
+{ :result :sameInputByCompositeInjectivity (:h :a :b) . } pe:why {
+  { :result :sameInputByCompositeInjectivity (:h :a :b) . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 234 ];
+    pe:binding
+      [ pe:var "h"; pe:value :h ],
+      [ pe:var "x"; pe:value :a ],
+      [ pe:var "y"; pe:value :b ];
+    pe:uses
+      { (:h :a :b) :sameInputUnderEqualCompositeOutput true . },
+      { :a log:notEqualTo :b . }.
+
+  { (:h :a :b) :sameInputUnderEqualCompositeOutput true . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 169 ];
+    pe:binding
+      [ pe:var "f"; pe:value :f ],
+      [ pe:var "fx"; pe:value :p ],
+      [ pe:var "fy"; pe:value :q ],
+      [ pe:var "g"; pe:value :g ],
+      [ pe:var "h"; pe:value :h ],
+      [ pe:var "u"; pe:value :r ],
+      [ pe:var "v"; pe:value :r ],
+      [ pe:var "x"; pe:value :a ],
+      [ pe:var "y"; pe:value :b ];
+    pe:uses
+      { :h :compositeOf (:g :f) . },
+      { :f :injective true . },
+      { :g :injective true . },
+      { (:f :a) :app :p . },
+      { (:f :b) :app :q . },
+      { (:g :p) :app :r . },
+      { (:g :q) :app :r . },
+      { (:r :r) :sameTerm true . },
+      { (:a :b) :sameTerm true . }.
+
+  { :h :compositeOf (:g :f) . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 219 ].
+
+  { :f :injective true . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 216 ].
+
+  { :g :injective true . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 217 ].
+
+  { (:f :a) :app :p . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 221 ].
+
+  { (:f :b) :app :q . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 222 ].
+
+  { (:g :p) :app :r . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 224 ].
+
+  { (:g :q) :app :r . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 225 ].
+
+  { (:r :r) :sameTerm true . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 77 ];
+    pe:binding [ pe:var "z"; pe:value :r ];
+    pe:uses { :r :inZ true . }.
+
+  { :r :inZ true . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 214 ].
+
+  { (:a :b) :sameTerm true . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 117 ];
+    pe:binding
+      [ pe:var "f"; pe:value :f ],
+      [ pe:var "u"; pe:value :p ],
+      [ pe:var "v"; pe:value :q ],
+      [ pe:var "x"; pe:value :a ],
+      [ pe:var "y"; pe:value :b ];
+    pe:uses
+      { :f :injective true . },
+      { (:f :a) :app :p . },
+      { (:f :b) :app :q . },
+      { (:p :q) :sameTerm true . }.
+
+  { (:p :q) :sameTerm true . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 117 ];
+    pe:binding
+      [ pe:var "f"; pe:value :g ],
+      [ pe:var "u"; pe:value :r ],
+      [ pe:var "v"; pe:value :r ],
+      [ pe:var "x"; pe:value :p ],
+      [ pe:var "y"; pe:value :q ];
+    pe:uses
+      { :g :injective true . },
+      { (:g :p) :app :r . },
+      { (:g :q) :app :r . },
+      { (:r :r) :sameTerm true . }.
+
+  { :a log:notEqualTo :b . }
+    pe:by [ pe:builtin log:notEqualTo ].
+}.
+
+{ :result :sameInputByCompositeInjectivity (:h :b :a) . } pe:why {
+  { :result :sameInputByCompositeInjectivity (:h :b :a) . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 234 ];
+    pe:binding
+      [ pe:var "h"; pe:value :h ],
+      [ pe:var "x"; pe:value :b ],
+      [ pe:var "y"; pe:value :a ];
+    pe:uses
+      { (:h :b :a) :sameInputUnderEqualCompositeOutput true . },
+      { :b log:notEqualTo :a . }.
+
+  { (:h :b :a) :sameInputUnderEqualCompositeOutput true . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 169 ];
+    pe:binding
+      [ pe:var "f"; pe:value :f ],
+      [ pe:var "fx"; pe:value :q ],
+      [ pe:var "fy"; pe:value :p ],
+      [ pe:var "g"; pe:value :g ],
+      [ pe:var "h"; pe:value :h ],
+      [ pe:var "u"; pe:value :r ],
+      [ pe:var "v"; pe:value :r ],
+      [ pe:var "x"; pe:value :b ],
+      [ pe:var "y"; pe:value :a ];
+    pe:uses
+      { :h :compositeOf (:g :f) . },
+      { :f :injective true . },
+      { :g :injective true . },
+      { (:f :b) :app :q . },
+      { (:f :a) :app :p . },
+      { (:g :q) :app :r . },
+      { (:g :p) :app :r . },
+      { (:r :r) :sameTerm true . },
+      { (:b :a) :sameTerm true . }.
+
+  { :h :compositeOf (:g :f) . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 219 ].
+
+  { :f :injective true . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 216 ].
+
+  { :g :injective true . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 217 ].
+
+  { (:f :b) :app :q . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 222 ].
+
+  { (:f :a) :app :p . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 221 ].
+
+  { (:g :q) :app :r . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 225 ].
+
+  { (:g :p) :app :r . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 224 ].
+
+  { (:r :r) :sameTerm true . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 77 ];
+    pe:binding [ pe:var "z"; pe:value :r ];
+    pe:uses { :r :inZ true . }.
+
+  { :r :inZ true . }
+    pe:by [ pe:fact "composition-of-injective-functions-is-injective.n3"; pe:line 214 ].
+
+  { (:b :a) :sameTerm true . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 117 ];
+    pe:binding
+      [ pe:var "f"; pe:value :f ],
+      [ pe:var "u"; pe:value :q ],
+      [ pe:var "v"; pe:value :p ],
+      [ pe:var "x"; pe:value :b ],
+      [ pe:var "y"; pe:value :a ];
+    pe:uses
+      { :f :injective true . },
+      { (:f :b) :app :q . },
+      { (:f :a) :app :p . },
+      { (:q :p) :sameTerm true . }.
+
+  { (:q :p) :sameTerm true . }
+    pe:by [ pe:rule "composition-of-injective-functions-is-injective.n3"; pe:line 117 ];
+    pe:binding
+      [ pe:var "f"; pe:value :g ],
+      [ pe:var "u"; pe:value :r ],
+      [ pe:var "v"; pe:value :r ],
+      [ pe:var "x"; pe:value :q ],
+      [ pe:var "y"; pe:value :p ];
+    pe:uses
+      { :g :injective true . },
+      { (:g :q) :app :r . },
+      { (:g :p) :app :r . },
+      { (:r :r) :sameTerm true . }.
+
+  { :b log:notEqualTo :a . }
+    pe:by [ pe:builtin log:notEqualTo ].
+}.

package/examples/proof/derived-backward-rule-2.n3

@@ -0,0 +1,80 @@
+@prefix : <http://example.org/socrates#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+
+{
+    :Socrates a :Human .
+} <= true .
+{
+    :Human rdfs:subClassOf :Mortal .
+} <= true .
+:Socrates a :Mortal .
+:test :is true .
+
+{
+    {
+        :Socrates a :Human .
+    } <= true .
+} pe:why {
+  {
+    {
+        :Socrates a :Human .
+    } <= true .
+}
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 9 ].
+}.
+
+{
+    {
+        :Human rdfs:subClassOf :Mortal .
+    } <= true .
+} pe:why {
+  {
+    {
+        :Human rdfs:subClassOf :Mortal .
+    } <= true .
+}
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 9 ].
+}.
+
+{ :Socrates a :Mortal . } pe:why {
+  { :Socrates a :Mortal . }
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 14 ];
+    pe:binding
+      [ pe:var "A"; pe:value :Human ],
+      [ pe:var "B"; pe:value :Mortal ],
+      [ pe:var "S"; pe:value :Socrates ];
+    pe:uses
+      { :Socrates a :Human . },
+      { :Human rdfs:subClassOf :Mortal . }.
+
+  { :Socrates a :Human . }
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 9 ].
+
+  { :Human rdfs:subClassOf :Mortal . }
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 9 ].
+}.
+
+{ :test :is true . } pe:why {
+  { :test :is true . }
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 21 ];
+    pe:uses { :Socrates a :Mortal . }.
+
+  { :Socrates a :Mortal . }
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 14 ];
+    pe:binding
+      [ pe:var "A"; pe:value :Human ],
+      [ pe:var "B"; pe:value :Mortal ],
+      [ pe:var "S"; pe:value :Socrates ];
+    pe:uses
+      { :Socrates a :Human . },
+      { :Human rdfs:subClassOf :Mortal . }.
+
+  { :Socrates a :Human . }
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 9 ].
+
+  { :Human rdfs:subClassOf :Mortal . }
+    pe:by [ pe:rule "derived-backward-rule-2.n3"; pe:line 9 ].
+}.

package/examples/proof/derived-backward-rule.n3

@@ -0,0 +1,53 @@
+@prefix : <https://eyereasoner.github.io/ns#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+{
+    ?x :childOf ?y .
+} <= {
+    ?y :parentOf ?x .
+} .
+:bob :hasParent :alice .
+
+{
+    {
+        ?x :childOf ?y .
+    } <= {
+        ?y :parentOf ?x .
+    } .
+} pe:why {
+  {
+    {
+        ?x :childOf ?y .
+    } <= {
+        ?y :parentOf ?x .
+    } .
+}
+    pe:by [ pe:rule "derived-backward-rule.n3"; pe:line 16 ];
+    pe:binding
+      [ pe:var "p"; pe:value :parentOf ],
+      [ pe:var "q"; pe:value :childOf ];
+    pe:uses { :parentOf :invOf :childOf . }.
+
+  { :parentOf :invOf :childOf . }
+    pe:by [ pe:fact "derived-backward-rule.n3"; pe:line 8 ].
+}.
+
+{ :bob :hasParent :alice . } pe:why {
+  { :bob :hasParent :alice . }
+    pe:by [ pe:rule "derived-backward-rule.n3"; pe:line 27 ];
+    pe:binding
+      [ pe:var "x"; pe:value :bob ],
+      [ pe:var "y"; pe:value :alice ];
+    pe:uses { :bob :childOf :alice . }.
+
+  { :bob :childOf :alice . }
+    pe:by [ pe:rule "derived-backward-rule.n3"; pe:line 16 ];
+    pe:binding
+      [ pe:var "x"; pe:value :bob ],
+      [ pe:var "y"; pe:value :alice ];
+    pe:uses { :alice :parentOf :bob . }.
+
+  { :alice :parentOf :bob . }
+    pe:by [ pe:fact "derived-backward-rule.n3"; pe:line 10 ].
+}.

package/examples/proof/derived-rule.n3

@@ -0,0 +1,43 @@
+@prefix : <https://eyereasoner.github.io/ns#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+
+{
+    ?y a :Dog .
+} => {
+    :test :is true .
+} .
+:test :is true .
+
+{
+    {
+        ?y a :Dog .
+    } => {
+        :test :is true .
+    } .
+} pe:why {
+  {
+    {
+        ?y a :Dog .
+    } => {
+        :test :is true .
+    } .
+}
+    pe:by [ pe:rule "derived-rule.n3"; pe:line 11 ];
+    pe:binding [ pe:var "x"; pe:value :Minka ];
+    pe:uses { :Minka a :Cat . }.
+
+  { :Minka a :Cat . }
+    pe:by [ pe:fact "derived-rule.n3"; pe:line 8 ].
+}.
+
+{ :test :is true . } pe:why {
+  { :test :is true . }
+    pe:by [ pe:rule "derived-rule.n3"; pe:line 11 ];
+    pe:binding [ pe:var "y"; pe:value :Charly ];
+    pe:uses { :Charly a :Dog . }.
+
+  { :Charly a :Dog . }
+    pe:by [ pe:fact "derived-rule.n3"; pe:line 9 ].
+}.

package/examples/proof/dog.n3

@@ -0,0 +1,41 @@
+@prefix : <https://eyereasoner.github.io/ns#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix math: <http://www.w3.org/2000/10/swap/math#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:alice :mustHave :dogLicense .
+
+{ :alice :mustHave :dogLicense . } pe:why {
+  { :alice :mustHave :dogLicense . }
+    pe:by [ pe:rule "dog.n3"; pe:line 13 ];
+    pe:binding
+      [ pe:var "Any"; pe:value :dog1 ],
+      [ pe:var "Count"; pe:value 5 ],
+      [ pe:var "List"; pe:value (1 1 1 1 1) ],
+      [ pe:var "Subject"; pe:value :alice ];
+    pe:uses
+      { :alice :hasDog :dog1 . },
+      {
+          (1 {
+              :alice :hasDog ?Dog .
+          } (1 1 1 1 1)) log:collectAllIn ?Scope .
+      },
+      { (1 1 1 1 1) math:sum 5 . },
+      { 5 math:greaterThan 4 . }.
+
+  { :alice :hasDog :dog1 . }
+    pe:by [ pe:fact "dog.n3"; pe:line 10 ].
+
+  {
+    (1 {
+        :alice :hasDog ?Dog .
+    } (1 1 1 1 1)) log:collectAllIn ?Scope .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+
+  { (1 1 1 1 1) math:sum 5 . }
+    pe:by [ pe:builtin math:sum ].
+
+  { 5 math:greaterThan 4 . }
+    pe:by [ pe:builtin math:greaterThan ].
+}.

package/examples/proof/equals.n3

@@ -0,0 +1,14 @@
+@prefix : <http://example.org/socrates#> .
+@prefix owl: <http://www.w3.org/2002/07/owl#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:test :is true .
+
+{ :test :is true . } pe:why {
+  { :test :is true . }
+    pe:by [ pe:rule "equals.n3"; pe:line 11 ];
+    pe:uses { :X = :Y . }.
+
+  { :X = :Y . }
+    pe:by [ pe:fact "equals.n3"; pe:line 9 ].
+}.

package/examples/proof/existential-rule.n3

@@ -0,0 +1,26 @@
+@prefix : <http://example.org/socrates#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+
+:Socrates :is _:sk_0 .
+:Plato :is _:sk_1 .
+
+{ :Socrates :is _:sk_0 . } pe:why {
+  { :Socrates :is _:sk_0 . }
+    pe:by [ pe:rule "existential-rule.n3"; pe:line 13 ];
+    pe:binding [ pe:var "S"; pe:value :Socrates ];
+    pe:uses { :Socrates a :Human . }.
+
+  { :Socrates a :Human . }
+    pe:by [ pe:fact "existential-rule.n3"; pe:line 9 ].
+}.
+
+{ :Plato :is _:sk_1 . } pe:why {
+  { :Plato :is _:sk_1 . }
+    pe:by [ pe:rule "existential-rule.n3"; pe:line 13 ];
+    pe:binding [ pe:var "S"; pe:value :Plato ];
+    pe:uses { :Plato a :Human . }.
+
+  { :Plato a :Human . }
+    pe:by [ pe:fact "existential-rule.n3"; pe:line 10 ].
+}.

package/examples/proof/greatest-lower-bound-uniqueness.n3

@@ -0,0 +1,168 @@
+@prefix : <http://example.org/#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:result :sameGreatestLowerBound (:a :b :g1 :g2) .
+:result :sameGreatestLowerBound (:a :b :g2 :g1) .
+
+{ :result :sameGreatestLowerBound (:a :b :g1 :g2) . } pe:why {
+  { :result :sameGreatestLowerBound (:a :b :g1 :g2) . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 195 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "m"; pe:value :g1 ],
+      [ pe:var "n"; pe:value :g2 ];
+    pe:uses
+      { (:a :b :g1 :g2) :sameGlb true . },
+      { :g1 log:notEqualTo :g2 . }.
+
+  { (:a :b :g1 :g2) :sameGlb true . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 161 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "m"; pe:value :g1 ],
+      [ pe:var "n"; pe:value :g2 ];
+    pe:uses
+      { :g1 :glbOf (:a :b) . },
+      { :g2 :glbOf (:a :b) . },
+      { (:g1 :g2) :sameTerm true . }.
+
+  { :g1 :glbOf (:a :b) . }
+    pe:by [ pe:fact "greatest-lower-bound-uniqueness.n3"; pe:line 185 ].
+
+  { :g2 :glbOf (:a :b) . }
+    pe:by [ pe:fact "greatest-lower-bound-uniqueness.n3"; pe:line 186 ].
+
+  { (:g1 :g2) :sameTerm true . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 85 ];
+    pe:binding
+      [ pe:var "x"; pe:value :g1 ],
+      [ pe:var "y"; pe:value :g2 ];
+    pe:uses
+      { :g1 :leq :g2 . },
+      { :g2 :leq :g1 . }.
+
+  { :g1 :leq :g2 . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 126 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "l"; pe:value :g1 ],
+      [ pe:var "m"; pe:value :g2 ];
+    pe:uses
+      { :g2 :glbOf (:a :b) . },
+      { :g1 :lowerBoundOf (:a :b) . }.
+
+  { :g1 :lowerBoundOf (:a :b) . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 112 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "m"; pe:value :g1 ];
+    pe:uses { :g1 :glbOf (:a :b) . }.
+
+  { :g2 :leq :g1 . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 126 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "l"; pe:value :g2 ],
+      [ pe:var "m"; pe:value :g1 ];
+    pe:uses
+      { :g1 :glbOf (:a :b) . },
+      { :g2 :lowerBoundOf (:a :b) . }.
+
+  { :g2 :lowerBoundOf (:a :b) . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 112 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "m"; pe:value :g2 ];
+    pe:uses { :g2 :glbOf (:a :b) . }.
+
+  { :g1 log:notEqualTo :g2 . }
+    pe:by [ pe:builtin log:notEqualTo ].
+}.
+
+{ :result :sameGreatestLowerBound (:a :b :g2 :g1) . } pe:why {
+  { :result :sameGreatestLowerBound (:a :b :g2 :g1) . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 195 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "m"; pe:value :g2 ],
+      [ pe:var "n"; pe:value :g1 ];
+    pe:uses
+      { (:a :b :g2 :g1) :sameGlb true . },
+      { :g2 log:notEqualTo :g1 . }.
+
+  { (:a :b :g2 :g1) :sameGlb true . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 161 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "m"; pe:value :g2 ],
+      [ pe:var "n"; pe:value :g1 ];
+    pe:uses
+      { :g2 :glbOf (:a :b) . },
+      { :g1 :glbOf (:a :b) . },
+      { (:g2 :g1) :sameTerm true . }.
+
+  { :g2 :glbOf (:a :b) . }
+    pe:by [ pe:fact "greatest-lower-bound-uniqueness.n3"; pe:line 186 ].
+
+  { :g1 :glbOf (:a :b) . }
+    pe:by [ pe:fact "greatest-lower-bound-uniqueness.n3"; pe:line 185 ].
+
+  { (:g2 :g1) :sameTerm true . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 85 ];
+    pe:binding
+      [ pe:var "x"; pe:value :g2 ],
+      [ pe:var "y"; pe:value :g1 ];
+    pe:uses
+      { :g2 :leq :g1 . },
+      { :g1 :leq :g2 . }.
+
+  { :g2 :leq :g1 . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 126 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "l"; pe:value :g2 ],
+      [ pe:var "m"; pe:value :g1 ];
+    pe:uses
+      { :g1 :glbOf (:a :b) . },
+      { :g2 :lowerBoundOf (:a :b) . }.
+
+  { :g2 :lowerBoundOf (:a :b) . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 112 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "m"; pe:value :g2 ];
+    pe:uses { :g2 :glbOf (:a :b) . }.
+
+  { :g1 :leq :g2 . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 126 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "l"; pe:value :g1 ],
+      [ pe:var "m"; pe:value :g2 ];
+    pe:uses
+      { :g2 :glbOf (:a :b) . },
+      { :g1 :lowerBoundOf (:a :b) . }.
+
+  { :g1 :lowerBoundOf (:a :b) . }
+    pe:by [ pe:rule "greatest-lower-bound-uniqueness.n3"; pe:line 112 ];
+    pe:binding
+      [ pe:var "a"; pe:value :a ],
+      [ pe:var "b"; pe:value :b ],
+      [ pe:var "m"; pe:value :g1 ];
+    pe:uses { :g1 :glbOf (:a :b) . }.
+
+  { :g2 log:notEqualTo :g1 . }
+    pe:by [ pe:builtin log:notEqualTo ].
+}.