eyeling 1.26.4 → 1.26.6

package/examples/proof/group-inverse-uniqueness.n3

@@ -0,0 +1,180 @@
+@prefix : <http://example.org/#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+
+:result :sameInverse (:x :i :j) .
+:result :sameInverse (:x :j :i) .
+
+{ :result :sameInverse (:x :i :j) . } pe:why {
+  { :result :sameInverse (:x :i :j) . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 167 ];
+    pe:binding
+      [ pe:var "x"; pe:value :x ],
+      [ pe:var "y"; pe:value :i ],
+      [ pe:var "z"; pe:value :j ];
+    pe:uses
+      { (:x :i :j) :sameInverse true . },
+      { :i log:notEqualTo :j . }.
+
+  { (:x :i :j) :sameInverse true . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 138 ];
+    pe:binding
+      [ pe:var "x"; pe:value :x ],
+      [ pe:var "y"; pe:value :i ],
+      [ pe:var "z"; pe:value :j ];
+    pe:uses
+      { :i :inverseOf :x . },
+      { :j :inverseOf :x . },
+      { (:i :j) :sameTerm true . }.
+
+  { :i :inverseOf :x . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 158 ].
+
+  { :j :inverseOf :x . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 159 ].
+
+  { (:i :j) :sameTerm true . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 54 ];
+    pe:binding
+      [ pe:var "a"; pe:value :j ],
+      [ pe:var "ab"; pe:value :e ],
+      [ pe:var "b"; pe:value :x ],
+      [ pe:var "bc"; pe:value :e ],
+      [ pe:var "c"; pe:value :i ],
+      [ pe:var "left"; pe:value :i ],
+      [ pe:var "right"; pe:value :j ];
+    pe:uses
+      { (:j :x) :mul :e . },
+      { (:e :i) :mul :i . },
+      { (:x :i) :mul :e . },
+      { (:j :e) :mul :j . }.
+
+  { (:j :x) :mul :e . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 102 ];
+    pe:binding
+      [ pe:var "x"; pe:value :x ],
+      [ pe:var "y"; pe:value :j ];
+    pe:uses
+      { :x :inG true . },
+      { :j :inG true . },
+      { :j :inverseOf :x . }.
+
+  { :x :inG true . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 153 ].
+
+  { :j :inG true . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 155 ].
+
+  { (:e :i) :mul :i . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 78 ];
+    pe:binding [ pe:var "a"; pe:value :i ];
+    pe:uses { :i :inG true . }.
+
+  { :i :inG true . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 154 ].
+
+  { (:x :i) :mul :e . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 102 ];
+    pe:binding
+      [ pe:var "x"; pe:value :x ],
+      [ pe:var "y"; pe:value :i ];
+    pe:uses
+      { :x :inG true . },
+      { :i :inG true . },
+      { :i :inverseOf :x . }.
+
+  { (:j :e) :mul :j . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 89 ];
+    pe:binding [ pe:var "a"; pe:value :j ];
+    pe:uses { :j :inG true . }.
+
+  { :i log:notEqualTo :j . }
+    pe:by [ pe:builtin log:notEqualTo ].
+}.
+
+{ :result :sameInverse (:x :j :i) . } pe:why {
+  { :result :sameInverse (:x :j :i) . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 167 ];
+    pe:binding
+      [ pe:var "x"; pe:value :x ],
+      [ pe:var "y"; pe:value :j ],
+      [ pe:var "z"; pe:value :i ];
+    pe:uses
+      { (:x :j :i) :sameInverse true . },
+      { :j log:notEqualTo :i . }.
+
+  { (:x :j :i) :sameInverse true . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 138 ];
+    pe:binding
+      [ pe:var "x"; pe:value :x ],
+      [ pe:var "y"; pe:value :j ],
+      [ pe:var "z"; pe:value :i ];
+    pe:uses
+      { :j :inverseOf :x . },
+      { :i :inverseOf :x . },
+      { (:j :i) :sameTerm true . }.
+
+  { :j :inverseOf :x . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 159 ].
+
+  { :i :inverseOf :x . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 158 ].
+
+  { (:j :i) :sameTerm true . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 54 ];
+    pe:binding
+      [ pe:var "a"; pe:value :i ],
+      [ pe:var "ab"; pe:value :e ],
+      [ pe:var "b"; pe:value :x ],
+      [ pe:var "bc"; pe:value :e ],
+      [ pe:var "c"; pe:value :j ],
+      [ pe:var "left"; pe:value :j ],
+      [ pe:var "right"; pe:value :i ];
+    pe:uses
+      { (:i :x) :mul :e . },
+      { (:e :j) :mul :j . },
+      { (:x :j) :mul :e . },
+      { (:i :e) :mul :i . }.
+
+  { (:i :x) :mul :e . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 102 ];
+    pe:binding
+      [ pe:var "x"; pe:value :x ],
+      [ pe:var "y"; pe:value :i ];
+    pe:uses
+      { :x :inG true . },
+      { :i :inG true . },
+      { :i :inverseOf :x . }.
+
+  { :x :inG true . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 153 ].
+
+  { :i :inG true . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 154 ].
+
+  { (:e :j) :mul :j . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 78 ];
+    pe:binding [ pe:var "a"; pe:value :j ];
+    pe:uses { :j :inG true . }.
+
+  { :j :inG true . }
+    pe:by [ pe:fact "group-inverse-uniqueness.n3"; pe:line 155 ].
+
+  { (:x :j) :mul :e . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 102 ];
+    pe:binding
+      [ pe:var "x"; pe:value :x ],
+      [ pe:var "y"; pe:value :j ];
+    pe:uses
+      { :x :inG true . },
+      { :j :inG true . },
+      { :j :inverseOf :x . }.
+
+  { (:i :e) :mul :i . }
+    pe:by [ pe:rule "group-inverse-uniqueness.n3"; pe:line 89 ];
+    pe:binding [ pe:var "a"; pe:value :i ];
+    pe:uses { :i :inG true . }.
+
+  { :j log:notEqualTo :i . }
+    pe:by [ pe:builtin log:notEqualTo ].
+}.

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-collect-all-in.n3

@@ -0,0 +1,152 @@
+@prefix : <http://example.org/#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix pe: <https://eyereasoner.github.io/pe#> .
+@prefix string: <http://www.w3.org/2000/10/swap/string#> .
+
+:result1 :is ("Huey" "Dewey" "Louie") .
+:result2 :is (("Huey") ("Dewey") ("Louie")) .
+:result3 :is ("Huey" "Dewey") .
+
+{ :result1 :is ("Huey" "Dewey" "Louie") . } pe:why {
+  { :result1 :is ("Huey" "Dewey" "Louie") . }
+    pe:by [ pe:rule "log-collect-all-in.n3"; pe:line 13 ];
+    pe:binding
+      [ pe:var "allParams"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "filteredParams"; pe:value ("Huey" "Dewey") ],
+      [ pe:var "nestedParams"; pe:value (("Huey") ("Dewey") ("Louie")) ];
+    pe:uses
+      {
+          (?param {
+              :Let :param ?param .
+          } ("Huey" "Dewey" "Louie")) log:collectAllIn ?_b1 .
+      },
+      {
+          ((?param) {
+              :Let :param ?param .
+          } (("Huey") ("Dewey") ("Louie"))) log:collectAllIn ?_b1 .
+      },
+      {
+          (?param {
+              :Let :param ?param .
+              ?param string:lessThan "Louie" .
+          } ("Huey" "Dewey")) log:collectAllIn ?_b1 .
+      }.
+
+  {
+    (?param {
+        :Let :param ?param .
+    } ("Huey" "Dewey" "Louie")) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+
+  {
+    ((?param) {
+        :Let :param ?param .
+    } (("Huey") ("Dewey") ("Louie"))) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+
+  {
+    (?param {
+        :Let :param ?param .
+        ?param string:lessThan "Louie" .
+    } ("Huey" "Dewey")) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+}.
+
+{ :result2 :is (("Huey") ("Dewey") ("Louie")) . } pe:why {
+  { :result2 :is (("Huey") ("Dewey") ("Louie")) . }
+    pe:by [ pe:rule "log-collect-all-in.n3"; pe:line 13 ];
+    pe:binding
+      [ pe:var "allParams"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "filteredParams"; pe:value ("Huey" "Dewey") ],
+      [ pe:var "nestedParams"; pe:value (("Huey") ("Dewey") ("Louie")) ];
+    pe:uses
+      {
+          (?param {
+              :Let :param ?param .
+          } ("Huey" "Dewey" "Louie")) log:collectAllIn ?_b1 .
+      },
+      {
+          ((?param) {
+              :Let :param ?param .
+          } (("Huey") ("Dewey") ("Louie"))) log:collectAllIn ?_b1 .
+      },
+      {
+          (?param {
+              :Let :param ?param .
+              ?param string:lessThan "Louie" .
+          } ("Huey" "Dewey")) log:collectAllIn ?_b1 .
+      }.
+
+  {
+    (?param {
+        :Let :param ?param .
+    } ("Huey" "Dewey" "Louie")) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+
+  {
+    ((?param) {
+        :Let :param ?param .
+    } (("Huey") ("Dewey") ("Louie"))) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+
+  {
+    (?param {
+        :Let :param ?param .
+        ?param string:lessThan "Louie" .
+    } ("Huey" "Dewey")) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+}.
+
+{ :result3 :is ("Huey" "Dewey") . } pe:why {
+  { :result3 :is ("Huey" "Dewey") . }
+    pe:by [ pe:rule "log-collect-all-in.n3"; pe:line 13 ];
+    pe:binding
+      [ pe:var "allParams"; pe:value ("Huey" "Dewey" "Louie") ],
+      [ pe:var "filteredParams"; pe:value ("Huey" "Dewey") ],
+      [ pe:var "nestedParams"; pe:value (("Huey") ("Dewey") ("Louie")) ];
+    pe:uses
+      {
+          (?param {
+              :Let :param ?param .
+          } ("Huey" "Dewey" "Louie")) log:collectAllIn ?_b1 .
+      },
+      {
+          ((?param) {
+              :Let :param ?param .
+          } (("Huey") ("Dewey") ("Louie"))) log:collectAllIn ?_b1 .
+      },
+      {
+          (?param {
+              :Let :param ?param .
+              ?param string:lessThan "Louie" .
+          } ("Huey" "Dewey")) log:collectAllIn ?_b1 .
+      }.
+
+  {
+    (?param {
+        :Let :param ?param .
+    } ("Huey" "Dewey" "Louie")) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+
+  {
+    ((?param) {
+        :Let :param ?param .
+    } (("Huey") ("Dewey") ("Louie"))) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+
+  {
+    (?param {
+        :Let :param ?param .
+        ?param string:lessThan "Louie" .
+    } ("Huey" "Dewey")) log:collectAllIn ?_b1 .
+}
+    pe:by [ pe:builtin log:collectAllIn ].
+}.

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 ].
+}.