eyeling 1.26.4 → 1.26.5

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

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/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/package.json

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

package/test/examples.test.js

@@ -52,20 +52,53 @@ function normalizeMarkdownForCompare(text) {
 // Normalize N3 output for comparison.
 // Eyeling (and other N3 tools) may emit the same closure with different
 // triple ordering. Examples tests should verify content, not presentation.
-function normalizeN3ForCompare(n3Text) {
-  return stripTrailingWhitespace(n3Text)
+function normalizeN3ForCompare(n3Text, sourceText = '', expectedPath = '') {
+  let value = stripTrailingWhitespace(n3Text);
+
+  // get-uuid.n3 intentionally uses log:skolem and relative IRIs, so its
+  // output depends on the checkout path and generated skolem seed. Compare the
+  // shape of the generated triples rather than those environment-specific bits.
+  if (/\blog:skolem\b/.test(sourceText) || path.basename(expectedPath) === 'get-uuid.n3') {
+    value = value
+      .replace(/<urn:uuid:[^>]+>/g, '<urn:uuid:__UUID__>')
+      .replace(/<file:\/\/[^>\s]*\/examples\/([^/>]+)>/g, '<file://__EXAMPLES__/$1>');
+  }
+
+  return value
     .split('\n')
     .filter((l) => l.length > 0)
     .sort((a, b) => a.localeCompare(b))
     .join('\n');
 }
 
-function normalizeForCompare(text, expectedPath) {
+function normalizeForCompare(text, expectedPath, sourceText = '') {
   const ext = path.extname(expectedPath);
   const value = text;
   if (ext === '.md') return normalizeMarkdownForCompare(value);
   if (ext === '.txt') return normalizeTextForCompare(value);
-  return normalizeN3ForCompare(value);
+  return normalizeN3ForCompare(value, sourceText, expectedPath);
+}
+
+function normalizeProofForCompare(text, expectedPath, sourceText) {
+  let value = normalizeForCompare(text, expectedPath, sourceText);
+
+  // Some proof goldens intentionally cover volatile builtins such as
+  // time:localTime. Keep those examples useful by comparing proof structure
+  // while masking only the volatile literal values.
+  if (/\btime:localTime\b/.test(sourceText)) {
+    value = value
+      .replace(/"[^"\n]*"\^\^xsd:dateTime/g, '"__DATETIME__"^^xsd:dateTime')
+      .replace(/"PT[0-9]+(?:\.[0-9]+)?S"\^\^xsd:duration/g, '"__DURATION__"^^xsd:duration');
+  }
+
+  return value;
+}
+
+function compareGeneratedOutput({ expectedPath, generatedPath, sourceText, proof }) {
+  const expectedText = fs.readFileSync(expectedPath, 'utf8');
+  const generatedText = fs.readFileSync(generatedPath, 'utf8');
+  const normalize = proof ? normalizeProofForCompare : normalizeForCompare;
+  return normalize(expectedText, expectedPath, sourceText) === normalize(generatedText, expectedPath, sourceText);
 }
 
 // Expectation logic (robust, long-term):
@@ -141,6 +174,42 @@ function resolveExampleBuiltinPath(root, inputFile) {
   return { abs, rel };
 }
 
+function runExampleToFile({ root, examplesDir, eyelingJsPath, nodePath, file, generatedPath, proof = false }) {
+  const builtin = resolveExampleBuiltinPath(root, file);
+  const trigInput = resolveExampleTrigInput(root, file);
+  const rdfMode = !!trigInput;
+  const modeFlag = proof ? '-p' : '-d';
+  const outFd = fs.openSync(generatedPath, 'w');
+
+  try {
+    if (builtin) {
+      const args = [eyelingJsPath, modeFlag];
+      if (rdfMode) args.push('-r');
+      args.push('--builtin', builtin.rel, path.join('examples', file));
+      if (trigInput) args.push(path.join('examples', trigInput.rel));
+      return cp.spawnSync(nodePath, args, {
+        cwd: root,
+        stdio: ['ignore', outFd, 'pipe'], // stdout -> file, stderr captured
+        maxBuffer: 200 * 1024 * 1024,
+        encoding: 'utf8',
+      });
+    }
+
+    const args = [eyelingJsPath, modeFlag];
+    if (rdfMode) args.push('-r');
+    args.push(file);
+    if (trigInput) args.push(trigInput.rel);
+    return cp.spawnSync(nodePath, args, {
+      cwd: examplesDir,
+      stdio: ['ignore', outFd, 'pipe'], // stdout -> file, stderr captured
+      maxBuffer: 200 * 1024 * 1024,
+      encoding: 'utf8',
+    });
+  } finally {
+    fs.closeSync(outFd);
+  }
+}
+
 function main() {
   const suiteStart = Date.now();
 
@@ -148,6 +217,7 @@ function main() {
   const root = path.resolve(__dirname, '..');
   const examplesDir = path.join(root, 'examples');
   const outputDir = path.join(examplesDir, 'output');
+  const proofDir = path.join(examplesDir, 'proof');
   const eyelingJsPath = path.join(root, 'eyeling.js');
   const nodePath = process.execPath;
 
@@ -164,8 +234,15 @@ function main() {
     .readdirSync(examplesDir)
     .filter((f) => f.endsWith('.n3'))
     .sort((a, b) => a.localeCompare(b));
-
-  info(`Running ${files.length} examples tests`);
+  const proofFiles = fs.existsSync(proofDir)
+    ? fs
+        .readdirSync(proofDir)
+        .filter((f) => f.endsWith('.n3') && fs.existsSync(path.join(examplesDir, f)))
+        .sort((a, b) => a.localeCompare(b))
+    : [];
+  const totalTests = files.length + proofFiles.length;
+
+  info(`Running ${files.length} examples tests and ${proofFiles.length} proof golden tests`);
   console.log(`${C.dim}${getEyelingVersion(nodePath, eyelingJsPath, root)}; node ${process.version}${C.n}`);
 
   if (files.length === 0) {
@@ -178,6 +255,7 @@ function main() {
 
   // Pretty, stable numbering (e.g., 001..100 when running 100 tests)
   const idxWidth = String(files.length).length;
+  const proofIdxWidth = String(Math.max(proofFiles.length, 1)).length;
 
   for (let i = 0; i < files.length; i++) {
     const idx = String(i + 1).padStart(idxWidth, '0');
@@ -221,38 +299,7 @@ function main() {
     //   node eyeling.js --builtin examples/builtin/foo.js examples/foo.n3
     // A matching examples/input/<stem>.trig sidecar is external RDF/TriG
     // evidence for this example, so include it and run in -r mode automatically.
-    const builtin = resolveExampleBuiltinPath(root, file);
-    const trigInput = resolveExampleTrigInput(root, file);
-    const rdfMode = !!trigInput;
-    const outFd = fs.openSync(generatedPath, 'w');
-    let r;
-    try {
-      if (builtin) {
-        const args = [eyelingJsPath, '-d'];
-        if (rdfMode) args.push('-r');
-        args.push('--builtin', builtin.rel, path.join('examples', file));
-        if (trigInput) args.push(path.join('examples', trigInput.rel));
-        r = cp.spawnSync(nodePath, args, {
-          cwd: root,
-          stdio: ['ignore', outFd, 'pipe'], // stdout -> file, stderr captured
-          maxBuffer: 200 * 1024 * 1024,
-          encoding: 'utf8',
-        });
-      } else {
-        const args = [eyelingJsPath, '-d'];
-        if (rdfMode) args.push('-r');
-        args.push(file);
-        if (trigInput) args.push(trigInput.rel);
-        r = cp.spawnSync(nodePath, args, {
-          cwd: examplesDir,
-          stdio: ['ignore', outFd, 'pipe'], // stdout -> file, stderr captured
-          maxBuffer: 200 * 1024 * 1024,
-          encoding: 'utf8',
-        });
-      }
-    } finally {
-      fs.closeSync(outFd);
-    }
+    const r = runExampleToFile({ root, examplesDir, eyelingJsPath, nodePath, file, generatedPath });
 
     const rc = r.status == null ? 1 : r.status;
 
@@ -261,12 +308,7 @@ function main() {
     // Compare output. N3 outputs are order-insensitive; Markdown outputs are order-sensitive.
     let diffOk = false;
     try {
-      const expectedText = fs.readFileSync(expectedPath, 'utf8');
-      const generatedText = fs.readFileSync(generatedPath, 'utf8');
-      if (expectedText == null) throw new Error('missing expected output');
-      diffOk =
-        normalizeForCompare(expectedText, expectedPath) ===
-        normalizeForCompare(generatedText, expectedPath);
+      diffOk = compareGeneratedOutput({ expectedPath, generatedPath, sourceText: n3Text, proof: false });
     } catch {
       diffOk = false;
     }
@@ -302,15 +344,76 @@ function main() {
     if (tmpDir) rmrf(tmpDir);
   }
 
+
+  for (let i = 0; i < proofFiles.length; i++) {
+    const idx = String(i + 1).padStart(proofIdxWidth, '0');
+    const file = proofFiles[i];
+    const start = Date.now();
+    const filePath = path.join(examplesDir, file);
+    const expectedPath = path.join(proofDir, file);
+
+    let n3Text;
+    try {
+      n3Text = fs.readFileSync(filePath, 'utf8');
+    } catch (e) {
+      const ms = Date.now() - start;
+      fail(`proof ${idx} ${file} ${msTag(ms)}`);
+      fail(`Cannot read proof input: ${e.message}`);
+      failed++;
+      continue;
+    }
+
+    const expectedRc = expectedExitCode(n3Text);
+    const tmpDir = mkTmpDir();
+    const generatedPath = path.join(tmpDir, 'generated.n3');
+    const r = runExampleToFile({ root, examplesDir, eyelingJsPath, nodePath, file, generatedPath, proof: true });
+    const rc = r.status == null ? 1 : r.status;
+    const ms = Date.now() - start;
+
+    let diffOk = false;
+    try {
+      diffOk = compareGeneratedOutput({ expectedPath, generatedPath, sourceText: n3Text, proof: true });
+    } catch {
+      diffOk = false;
+    }
+
+    const rcOk = rc === expectedRc;
+
+    if (diffOk && rcOk) {
+      if (expectedRc === 0) {
+        ok(`proof ${idx} ${file} ${msTag(ms)}`);
+      } else {
+        ok(`proof ${idx} ${file} (expected exit ${expectedRc}) ${msTag(ms)}`);
+      }
+      passed++;
+    } else {
+      fail(`proof ${idx} ${file} ${msTag(ms)}`);
+      if (!rcOk) {
+        fail(`Exit code ${rc}, expected ${expectedRc}`);
+      }
+      if (!diffOk) {
+        fail('Proof output differs');
+      }
+      showDiff({
+        examplesDir,
+        expectedPath,
+        generatedPath,
+      });
+      failed++;
+    }
+
+    if (tmpDir) rmrf(tmpDir);
+  }
+
   console.log('');
   const suiteMs = Date.now() - suiteStart;
   info(`Total elapsed: ${suiteMs} ms (${(suiteMs / 1000).toFixed(2)} s)`);
 
   if (failed === 0) {
-    ok(`All examples tests passed (${passed}/${files.length})`);
+    ok(`All examples tests passed (${passed}/${totalTests})`);
     process.exit(0);
   } else {
-    fail(`Some examples tests failed (${passed}/${files.length})`);
+    fail(`Some examples tests failed (${passed}/${totalTests})`);
     // keep exit code 2 (matches historical behavior of examples/test)
     process.exit(2);
   }