eyeling 1.26.5 → 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/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/list-iterate.n3

@@ -0,0 +1,142 @@
+@prefix : <urn:example:> .
+@prefix list: <http://www.w3.org/2000/10/swap/list#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+("Huey" "Dewey" "Louie") :iterate (0 "Huey") .
+"Dewey" :hasIndex 1 .
+("Huey" "Dewey" "Louie") :iterate (1 "Dewey") .
+("Huey" "Dewey" "Louie") :iterate (2 "Louie") .
+:test :is true .
+
+{ ("Huey" "Dewey" "Louie") :iterate (0 "Huey") . } pe:why {
+  { ("Huey" "Dewey" "Louie") :iterate (0 "Huey") . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+}.
+
+{ "Dewey" :hasIndex 1 . } pe:why {
+  { "Dewey" :hasIndex 1 . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+}.
+
+{ ("Huey" "Dewey" "Louie") :iterate (1 "Dewey") . } pe:why {
+  { ("Huey" "Dewey" "Louie") :iterate (1 "Dewey") . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (1 "Dewey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+}.
+
+{ ("Huey" "Dewey" "Louie") :iterate (2 "Louie") . } pe:why {
+  { ("Huey" "Dewey" "Louie") :iterate (2 "Louie") . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (2 "Louie") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (2 "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (2 "Louie") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+}.
+
+{ :test :is true . } pe:why {
+  { :test :is true . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 31 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ];
+    pe:uses
+      { ("Huey" "Dewey" "Louie") :iterate (0 "Huey") . },
+      { "Dewey" :hasIndex 1 . }.
+
+  { ("Huey" "Dewey" "Louie") :iterate (0 "Huey") . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+
+  { :Let :param ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:fact "list-iterate.n3"; pe:line 9 ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }
+    pe:by [ pe:builtin list:iterate ].
+
+  { "Dewey" :hasIndex 1 . }
+    pe:by [ pe:rule "list-iterate.n3"; pe:line 11 ];
+    pe:binding
+      [ pe:var "X"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "Y"; pe:value (0 "Huey") ],
+      [ pe:var "Z"; pe:value 1 ];
+    pe:uses
+      { :Let :param ("Huey" "Dewey" "Louie") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (0 "Huey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . },
+      { ("Huey" "Dewey" "Louie") list:iterate (1 "Dewey") . }.
+}.

package/examples/proof/list-map.n3

@@ -0,0 +1,44 @@
+@prefix : <http://example.org/#> .
+@prefix list: <http://www.w3.org/2000/10/swap/list#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:test1 :is true .
+:test2 :is true .
+:test3 :is true .
+:test4 :is true .
+
+{ :test1 :is true . } pe:why {
+  { :test1 :is true . }
+    pe:by [ pe:rule "list-map.n3"; pe:line 14 ];
+    pe:uses { ((:s1 :s2) :p1) list:map (:o1 :o2) . }.
+
+  { ((:s1 :s2) :p1) list:map (:o1 :o2) . }
+    pe:by [ pe:builtin list:map ].
+}.
+
+{ :test2 :is true . } pe:why {
+  { :test2 :is true . }
+    pe:by [ pe:rule "list-map.n3"; pe:line 15 ];
+    pe:uses { ((:s1 :s2 :s3) :p1) list:map (:o1 :o2 :o3 :o4) . }.
+
+  { ((:s1 :s2 :s3) :p1) list:map (:o1 :o2 :o3 :o4) . }
+    pe:by [ pe:builtin list:map ].
+}.
+
+{ :test3 :is true . } pe:why {
+  { :test3 :is true . }
+    pe:by [ pe:rule "list-map.n3"; pe:line 16 ];
+    pe:uses { ((:s4) :p1) list:map () . }.
+
+  { ((:s4) :p1) list:map () . }
+    pe:by [ pe:builtin list:map ].
+}.
+
+{ :test4 :is true . } pe:why {
+  { :test4 :is true . }
+    pe:by [ pe:rule "list-map.n3"; pe:line 17 ];
+    pe:uses { ((:s1) :p2) list:map () . }.
+
+  { ((:s1) :p2) list:map () . }
+    pe:by [ pe:builtin list:map ].
+}.

package/examples/proof/log-conclusion.n3

@@ -0,0 +1,118 @@
+@prefix : <http://example.org/> .
+@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#> .
+
+:result :is {
+    :Felix a :Cat .
+    {
+        ?X a :Cat .
+    } => {
+        ?X :says "Meow" .
+    } .
+    :Felix :says "Meow" .
+} .
+
+{
+    :result :is {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+        :Felix :says "Meow" .
+    } .
+} pe:why {
+  {
+    :result :is {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+        :Felix :says "Meow" .
+    } .
+}
+    pe:by [ pe:rule "log-conclusion.n3"; pe:line 13 ];
+    pe:binding
+      [ pe:var "conclusion"; pe:value {
+          :Felix a :Cat .
+          {
+              ?X a :Cat .
+          } => {
+              ?X :says "Meow" .
+          } .
+          :Felix :says "Meow" .
+      } ],
+      [ pe:var "param"; pe:value {
+          :Felix a :Cat .
+          {
+              ?X a :Cat .
+          } => {
+              ?X :says "Meow" .
+          } .
+      } ];
+    pe:uses
+      {
+          :let :param {
+              :Felix a :Cat .
+              {
+                  ?X a :Cat .
+              } => {
+                  ?X :says "Meow" .
+              } .
+          } .
+      },
+      {
+          {
+              :Felix a :Cat .
+              {
+                  ?X a :Cat .
+              } => {
+                  ?X :says "Meow" .
+              } .
+          } log:conclusion {
+              :Felix a :Cat .
+              {
+                  ?X a :Cat .
+              } => {
+                  ?X :says "Meow" .
+              } .
+              :Felix :says "Meow" .
+          } .
+      }.
+
+  {
+    :let :param {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+    } .
+}
+    pe:by [ pe:fact "log-conclusion.n3"; pe:line 8 ].
+
+  {
+    {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+    } log:conclusion {
+        :Felix a :Cat .
+        {
+            ?X a :Cat .
+        } => {
+            ?X :says "Meow" .
+        } .
+        :Felix :says "Meow" .
+    } .
+}
+    pe:by [ pe:builtin log:conclusion ].
+}.

package/examples/proof/log-for-all-in.n3

@@ -0,0 +1,33 @@
+@prefix : <http://example.org/#> .
+@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#> .
+
+:result :is true .
+
+{ :result :is true . } pe:why {
+  { :result :is true . }
+    pe:by [ pe:rule "log-for-all-in.n3"; pe:line 14 ];
+    pe:binding [ pe:var "c"; pe:value :c ];
+    pe:uses
+      { :c a :CompositeTask . },
+      {
+          ({
+              :c :subTask ?s .
+          } {
+              ?s :state :Completed .
+          }) log:forAllIn ?_b1 .
+      }.
+
+  { :c a :CompositeTask . }
+    pe:by [ pe:fact "log-for-all-in.n3"; pe:line 8 ].
+
+  {
+    ({
+        :c :subTask ?s .
+    } {
+        ?s :state :Completed .
+    }) log:forAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:forAllIn ].
+}.

package/examples/proof/log-not-includes.n3

@@ -0,0 +1,55 @@
+@prefix : <http://example.org/#> .
+@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#> .
+
+:x :y 1 .
+{
+    :x :y 1 .
+} => {
+    :a :b :c .
+} .
+:a :b :c .
+
+{ :x :y 1 . } pe:why {
+  { :x :y 1 . }
+    pe:by [ pe:rule "log-not-includes.n3"; pe:line 10 ];
+    pe:uses { 1 math:equalTo 1 . }.
+
+  { 1 math:equalTo 1 . }
+    pe:by [ pe:builtin math:equalTo ].
+}.
+
+{
+    {
+        :x :y 1 .
+    } => {
+        :a :b :c .
+    } .
+} pe:why {
+  {
+    {
+        :x :y 1 .
+    } => {
+        :a :b :c .
+    } .
+}
+    pe:by [ pe:rule "log-not-includes.n3"; pe:line 10 ];
+    pe:uses { 1 math:equalTo 1 . }.
+
+  { 1 math:equalTo 1 . }
+    pe:by [ pe:builtin math:equalTo ].
+}.
+
+{ :a :b :c . } pe:why {
+  { :a :b :c . }
+    pe:by [ pe:rule "log-not-includes.n3"; pe:line 10 ];
+    pe:uses { :x :y 1 . }.
+
+  { :x :y 1 . }
+    pe:by [ pe:rule "log-not-includes.n3"; pe:line 10 ];
+    pe:uses { 1 math:equalTo 1 . }.
+
+  { 1 math:equalTo 1 . }
+    pe:by [ pe:builtin math:equalTo ].
+}.

package/examples/proof/log-uri.n3

@@ -0,0 +1,34 @@
+@prefix : <http://example.org/#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:uriString :is "https://www.w3.org" .
+:uriResource :is <https://www.w3.org> .
+
+{ :uriString :is "https://www.w3.org" . } pe:why {
+  { :uriString :is "https://www.w3.org" . }
+    pe:by [ pe:rule "log-uri.n3"; pe:line 8 ];
+    pe:binding
+      [ pe:var "r"; pe:value <https://www.w3.org> ],
+      [ pe:var "s"; pe:value "https://www.w3.org" ];
+    pe:uses
+      { <https://www.w3.org> log:uri "https://www.w3.org" . },
+      { <https://www.w3.org> log:uri "https://www.w3.org" . }.
+
+  { <https://www.w3.org> log:uri "https://www.w3.org" . }
+    pe:by [ pe:builtin log:uri ].
+}.
+
+{ :uriResource :is <https://www.w3.org> . } pe:why {
+  { :uriResource :is <https://www.w3.org> . }
+    pe:by [ pe:rule "log-uri.n3"; pe:line 8 ];
+    pe:binding
+      [ pe:var "r"; pe:value <https://www.w3.org> ],
+      [ pe:var "s"; pe:value "https://www.w3.org" ];
+    pe:uses
+      { <https://www.w3.org> log:uri "https://www.w3.org" . },
+      { <https://www.w3.org> log:uri "https://www.w3.org" . }.
+
+  { <https://www.w3.org> log:uri "https://www.w3.org" . }
+    pe:by [ pe:builtin log:uri ].
+}.

package/examples/proof/rule-matching.n3

@@ -0,0 +1,34 @@
+@prefix : <https://eyereasoner.github.io/ns#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:result :is true .
+
+{ :result :is true . } pe:why {
+  { :result :is true . }
+    pe:by [ pe:rule "rule-matching.n3"; pe:line 8 ];
+    pe:binding
+      [ pe:var "A"; pe:value {
+          ?A__0 => ?B__1 .
+      } ],
+      [ pe:var "B"; pe:value {
+          :result :is true .
+      } ];
+    pe:uses
+      {
+          {
+              ?A__0 => ?B__1 .
+          } => {
+              :result :is true .
+          } .
+      }.
+
+  {
+    {
+        ?A__0 => ?B__1 .
+    } => {
+        :result :is true .
+    } .
+}
+    pe:by [ pe:builtin log:implies ].
+}.

package/eyeling.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/lib/engine.js

@@ -717,16 +717,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;
     }
   }
@@ -3240,7 +3240,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(
@@ -3257,7 +3257,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/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.26.5",
+  "version": "1.26.6",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [