npm - eyeling - Versions diffs - 1.6.13 → 1.6.14 - Mend

eyeling 1.6.13 → 1.6.14

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (75) hide show

package/examples/output/age.n3 +0 -17
package/examples/output/alignment-demo.n3 +0 -572
package/examples/output/backward.n3 +0 -15
package/examples/output/basic-monadic.n3 +0 -105
package/examples/output/brussels-brew-club.n3 +0 -476
package/examples/output/cat-koko.n3 +0 -108
package/examples/output/cobalt-kepler-kitchen.n3 +0 -7064
package/examples/output/complex.n3 +0 -46
package/examples/output/control-system.n3 +0 -75
package/examples/output/cranberry-calculus.n3 +0 -1313
package/examples/output/crypto-builtins-tests.n3 +0 -60
package/examples/output/deep-taxonomy-10.n3 +0 -602
package/examples/output/deep-taxonomy-100.n3 +1 -5733
package/examples/output/deep-taxonomy-1000.n3 +1 -57033
package/examples/output/deep-taxonomy-10000.n3 +1 -570033
package/examples/output/derived-backward-rule-2.n3 +0 -58
package/examples/output/derived-backward-rule.n3 +0 -44
package/examples/output/derived-rule.n3 +0 -42
package/examples/output/dijkstra.n3 +0 -297
package/examples/output/dog.n3 +0 -30
package/examples/output/drone-corridor-planner.n3 +0 -799
package/examples/output/easter.n3 +0 -3570
package/examples/output/equals.n3 +0 -15
package/examples/output/ev-roundtrip-planner.n3 +0 -392
package/examples/output/existential-rule.n3 +0 -34
package/examples/output/expression-eval.n3 +0 -20
package/examples/output/family-cousins.n3 +0 -636
package/examples/output/fibonacci.n3 +0 -36
package/examples/output/french-cities.n3 +0 -484
package/examples/output/good-cobbler.n3 +0 -22
package/examples/output/gps.n3 +0 -62
package/examples/output/gray-code-counter.n3 +0 -17
package/examples/output/hanoi.n3 +0 -17
package/examples/output/jade-eigen-loom.n3 +0 -4690
package/examples/output/json-pointer.n3 +0 -529
package/examples/output/json-reconcile-vat.n3 +0 -12882
package/examples/output/light-eaters.n3 +0 -311
package/examples/output/list-builtins-tests.n3 +0 -167
package/examples/output/list-iterate.n3 +0 -124
package/examples/output/lldm.n3 +0 -960
package/examples/output/log-collect-all-in.n3 +0 -117
package/examples/output/log-for-all-in.n3 +0 -27
package/examples/output/log-not-includes.n3 +0 -59
package/examples/output/log-skolem.n3 +0 -17
package/examples/output/log-uri.n3 +0 -42
package/examples/output/math-builtins-tests.n3 +0 -4434
package/examples/output/minimal-skos-alignment.n3 +0 -39
package/examples/output/monkey.n3 +0 -36
package/examples/output/odrl-trust.n3 +0 -46
package/examples/output/oslo-steps-library-scholarly.n3 +0 -1260
package/examples/output/oslo-steps-workflow-composition.n3 +0 -180
package/examples/output/peano.n3 +0 -23
package/examples/output/pi.n3 +0 -17
package/examples/output/pillar.n3 +0 -32
package/examples/output/polygon.n3 +0 -17
package/examples/output/rdf-list.n3 +0 -28
package/examples/output/reordering.n3 +0 -26
package/examples/output/ruby-runge-workshop.n3 +0 -613
package/examples/output/rule-matching.n3 +0 -26
package/examples/output/saffron-slopeworks.n3 +0 -1447
package/examples/output/self-referential.n3 +0 -81
package/examples/output/similar.n3 +0 -15
package/examples/output/snaf.n3 +0 -23
package/examples/output/socrates.n3 +0 -21
package/examples/output/spectral-week.n3 +0 -350
package/examples/output/string-builtins-tests.n3 +0 -240
package/examples/output/topaz-markov-mill.n3 +0 -4178
package/examples/output/traffic-skos-aggregate.n3 +0 -3151
package/examples/output/turing.n3 +0 -36
package/examples/output/ultramarine-simpson-forge.n3 +0 -3873
package/examples/output/witch.n3 +0 -107
package/examples/output/zebra.n3 +0 -111
package/eyeling.js +97 -18
package/package.json +1 -1
package/test/examples.test.js +1 -1

package/examples/output/ruby-runge-workshop.n3 CHANGED Viewed

@@ -1,629 +1,16 @@
 @prefix : <http://example.org/ruby-runge#> .
 @prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :yAtX0 "-0.27999999999999986"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :points (_:b1 _:b2 _:b3 _:b4 _:b5) .
-#   :Interp1 :x0 0.6 .
-#   (?term {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pi .
-#       ?pi :x ?xi .
-#       ?pi :y ?yi .
-#       (?f {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pj .
-#       ?pj :x ?xj .
-#       ?xj math:notEqualTo ?xi .
-#       (0.6 ?xj) math:difference ?num .
-#       (?xi ?xj) math:difference ?den .
-#       (?num ?den) math:quotient ?f .
-#   } ?factors) log:collectAllIn ?_b1 .
-#       ?factors math:product ?basis .
-#       (?yi ?basis) math:product ?term .
-#   } ("-0.2912"^^xsd:decimal "0.5824"^^xsd:decimal "-0.5823999999999999"^^xsd:decimal "-0.14559999999999998"^^xsd:decimal "0.1568"^^xsd:decimal)) log:collectAllIn ?_b2 .
-#   ("-0.2912"^^xsd:decimal "0.5824"^^xsd:decimal "-0.5823999999999999"^^xsd:decimal "-0.14559999999999998"^^xsd:decimal "0.1568"^^xsd:decimal) math:sum "-0.27999999999999986"^^xsd:decimal .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :points ?pts .
-#     :Interp1 :x0 ?x0 .
-#     (?term {
-#         ?pts list:member ?pi .
-#         ?pi :x ?xi .
-#         ?pi :y ?yi .
-#         (?f {
-#         ?pts list:member ?pj .
-#         ?pj :x ?xj .
-#         ?xj math:notEqualTo ?xi .
-#         (?x0 ?xj) math:difference ?num .
-#         (?xi ?xj) math:difference ?den .
-#         (?num ?den) math:quotient ?f .
-#     } ?factors) log:collectAllIn ?_b1 .
-#         ?factors math:product ?basis .
-#         (?yi ?basis) math:product ?term .
-#     } ?terms) log:collectAllIn ?_b2 .
-#     ?terms math:sum ?y0 .
-#   } => {
-#     :Interp1 :yAtX0 ?y0 .
-#   } .
-# with substitution (on rule variables):
-#   ?pts = (_:b1 _:b2 _:b3 _:b4 _:b5)
-#   ?terms = ("-0.2912"^^xsd:decimal "0.5824"^^xsd:decimal "-0.5823999999999999"^^xsd:decimal "-0.14559999999999998"^^xsd:decimal "0.1568"^^xsd:decimal)
-#   ?x0 = 0.6
-#   ?y0 = "-0.27999999999999986"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :yAtX0 "-0.27999999999999986"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :yAtXPlus "-0.2775980000000001"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :points (_:b1 _:b2 _:b3 _:b4 _:b5) .
-#   :Interp1 :x0 0.6 .
-#   :Interp1 :h 0.001 .
-#   (0.6 0.001) math:sum "0.601"^^xsd:decimal .
-#   (?term {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pi .
-#       ?pi :x ?xi .
-#       ?pi :y ?yi .
-#       (?f {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pj .
-#       ?pj :x ?xj .
-#       ?xj math:notEqualTo ?xi .
-#       ("0.601"^^xsd:decimal ?xj) math:difference ?num .
-#       (?xi ?xj) math:difference ?den .
-#       (?num ?den) math:quotient ?f .
-#   } ?factors) log:collectAllIn ?_b1 .
-#       ?factors math:product ?basis .
-#       (?yi ?basis) math:product ?term .
-#   } ("-0.291249943716375"^^xsd:decimal "0.5835426727665"^^xsd:decimal "-0.58111529060025"^^xsd:decimal "-0.1454300602335"^^xsd:decimal "0.15665462178362502"^^xsd:decimal)) log:collectAllIn ?_b2 .
-#   ("-0.291249943716375"^^xsd:decimal "0.5835426727665"^^xsd:decimal "-0.58111529060025"^^xsd:decimal "-0.1454300602335"^^xsd:decimal "0.15665462178362502"^^xsd:decimal) math:sum "-0.2775980000000001"^^xsd:decimal .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :points ?pts .
-#     :Interp1 :x0 ?x0 .
-#     :Interp1 :h ?h .
-#     (?x0 ?h) math:sum ?xPlus .
-#     (?term {
-#         ?pts list:member ?pi .
-#         ?pi :x ?xi .
-#         ?pi :y ?yi .
-#         (?f {
-#         ?pts list:member ?pj .
-#         ?pj :x ?xj .
-#         ?xj math:notEqualTo ?xi .
-#         (?xPlus ?xj) math:difference ?num .
-#         (?xi ?xj) math:difference ?den .
-#         (?num ?den) math:quotient ?f .
-#     } ?factors) log:collectAllIn ?_b1 .
-#         ?factors math:product ?basis .
-#         (?yi ?basis) math:product ?term .
-#     } ?terms) log:collectAllIn ?_b2 .
-#     ?terms math:sum ?yPlus .
-#   } => {
-#     :Interp1 :yAtXPlus ?yPlus .
-#     :Interp1 :xPlus ?xPlus .
-#   } .
-# with substitution (on rule variables):
-#   ?h = 0.001
-#   ?pts = (_:b1 _:b2 _:b3 _:b4 _:b5)
-#   ?terms = ("-0.291249943716375"^^xsd:decimal "0.5835426727665"^^xsd:decimal "-0.58111529060025"^^xsd:decimal "-0.1454300602335"^^xsd:decimal "0.15665462178362502"^^xsd:decimal)
-#   ?x0 = 0.6
-#   ?xPlus = "0.601"^^xsd:decimal
-#   ?yPlus = "-0.2775980000000001"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :yAtXPlus "-0.2775980000000001"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :xPlus "0.601"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :points (_:b1 _:b2 _:b3 _:b4 _:b5) .
-#   :Interp1 :x0 0.6 .
-#   :Interp1 :h 0.001 .
-#   (0.6 0.001) math:sum "0.601"^^xsd:decimal .
-#   (?term {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pi .
-#       ?pi :x ?xi .
-#       ?pi :y ?yi .
-#       (?f {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pj .
-#       ?pj :x ?xj .
-#       ?xj math:notEqualTo ?xi .
-#       ("0.601"^^xsd:decimal ?xj) math:difference ?num .
-#       (?xi ?xj) math:difference ?den .
-#       (?num ?den) math:quotient ?f .
-#   } ?factors) log:collectAllIn ?_b1 .
-#       ?factors math:product ?basis .
-#       (?yi ?basis) math:product ?term .
-#   } ("-0.291249943716375"^^xsd:decimal "0.5835426727665"^^xsd:decimal "-0.58111529060025"^^xsd:decimal "-0.1454300602335"^^xsd:decimal "0.15665462178362502"^^xsd:decimal)) log:collectAllIn ?_b2 .
-#   ("-0.291249943716375"^^xsd:decimal "0.5835426727665"^^xsd:decimal "-0.58111529060025"^^xsd:decimal "-0.1454300602335"^^xsd:decimal "0.15665462178362502"^^xsd:decimal) math:sum "-0.2775980000000001"^^xsd:decimal .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :points ?pts .
-#     :Interp1 :x0 ?x0 .
-#     :Interp1 :h ?h .
-#     (?x0 ?h) math:sum ?xPlus .
-#     (?term {
-#         ?pts list:member ?pi .
-#         ?pi :x ?xi .
-#         ?pi :y ?yi .
-#         (?f {
-#         ?pts list:member ?pj .
-#         ?pj :x ?xj .
-#         ?xj math:notEqualTo ?xi .
-#         (?xPlus ?xj) math:difference ?num .
-#         (?xi ?xj) math:difference ?den .
-#         (?num ?den) math:quotient ?f .
-#     } ?factors) log:collectAllIn ?_b1 .
-#         ?factors math:product ?basis .
-#         (?yi ?basis) math:product ?term .
-#     } ?terms) log:collectAllIn ?_b2 .
-#     ?terms math:sum ?yPlus .
-#   } => {
-#     :Interp1 :yAtXPlus ?yPlus .
-#     :Interp1 :xPlus ?xPlus .
-#   } .
-# with substitution (on rule variables):
-#   ?h = 0.001
-#   ?pts = (_:b1 _:b2 _:b3 _:b4 _:b5)
-#   ?terms = ("-0.291249943716375"^^xsd:decimal "0.5835426727665"^^xsd:decimal "-0.58111529060025"^^xsd:decimal "-0.1454300602335"^^xsd:decimal "0.15665462178362502"^^xsd:decimal)
-#   ?x0 = 0.6
-#   ?xPlus = "0.601"^^xsd:decimal
-#   ?yPlus = "-0.2775980000000001"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :xPlus "0.601"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :yAtXMinus "-0.28239800000000004"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :points (_:b1 _:b2 _:b3 _:b4 _:b5) .
-#   :Interp1 :x0 0.6 .
-#   :Interp1 :h 0.001 .
-#   (0.6 0.001) math:difference "0.599"^^xsd:decimal .
-#   (?term {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pi .
-#       ?pi :x ?xi .
-#       ?pi :y ?yi .
-#       (?f {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pj .
-#       ?pj :x ?xj .
-#       ?xj math:notEqualTo ?xi .
-#       ("0.599"^^xsd:decimal ?xj) math:difference ?num .
-#       (?xi ?xj) math:difference ?den .
-#       (?num ?den) math:quotient ?f .
-#   } ?factors) log:collectAllIn ?_b1 .
-#       ?factors math:product ?basis .
-#       (?yi ?basis) math:product ?term .
-#   } ("-0.291147279616375"^^xsd:decimal "0.5812573405665"^^xsd:decimal "-0.58368328940025"^^xsd:decimal "-0.1457687264335"^^xsd:decimal "0.156943954883625"^^xsd:decimal)) log:collectAllIn ?_b2 .
-#   ("-0.291147279616375"^^xsd:decimal "0.5812573405665"^^xsd:decimal "-0.58368328940025"^^xsd:decimal "-0.1457687264335"^^xsd:decimal "0.156943954883625"^^xsd:decimal) math:sum "-0.28239800000000004"^^xsd:decimal .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :points ?pts .
-#     :Interp1 :x0 ?x0 .
-#     :Interp1 :h ?h .
-#     (?x0 ?h) math:difference ?xMinus .
-#     (?term {
-#         ?pts list:member ?pi .
-#         ?pi :x ?xi .
-#         ?pi :y ?yi .
-#         (?f {
-#         ?pts list:member ?pj .
-#         ?pj :x ?xj .
-#         ?xj math:notEqualTo ?xi .
-#         (?xMinus ?xj) math:difference ?num .
-#         (?xi ?xj) math:difference ?den .
-#         (?num ?den) math:quotient ?f .
-#     } ?factors) log:collectAllIn ?_b1 .
-#         ?factors math:product ?basis .
-#         (?yi ?basis) math:product ?term .
-#     } ?terms) log:collectAllIn ?_b2 .
-#     ?terms math:sum ?yMinus .
-#   } => {
-#     :Interp1 :yAtXMinus ?yMinus .
-#     :Interp1 :xMinus ?xMinus .
-#   } .
-# with substitution (on rule variables):
-#   ?h = 0.001
-#   ?pts = (_:b1 _:b2 _:b3 _:b4 _:b5)
-#   ?terms = ("-0.291147279616375"^^xsd:decimal "0.5812573405665"^^xsd:decimal "-0.58368328940025"^^xsd:decimal "-0.1457687264335"^^xsd:decimal "0.156943954883625"^^xsd:decimal)
-#   ?x0 = 0.6
-#   ?xMinus = "0.599"^^xsd:decimal
-#   ?yMinus = "-0.28239800000000004"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :yAtXMinus "-0.28239800000000004"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :xMinus "0.599"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :points (_:b1 _:b2 _:b3 _:b4 _:b5) .
-#   :Interp1 :x0 0.6 .
-#   :Interp1 :h 0.001 .
-#   (0.6 0.001) math:difference "0.599"^^xsd:decimal .
-#   (?term {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pi .
-#       ?pi :x ?xi .
-#       ?pi :y ?yi .
-#       (?f {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pj .
-#       ?pj :x ?xj .
-#       ?xj math:notEqualTo ?xi .
-#       ("0.599"^^xsd:decimal ?xj) math:difference ?num .
-#       (?xi ?xj) math:difference ?den .
-#       (?num ?den) math:quotient ?f .
-#   } ?factors) log:collectAllIn ?_b1 .
-#       ?factors math:product ?basis .
-#       (?yi ?basis) math:product ?term .
-#   } ("-0.291147279616375"^^xsd:decimal "0.5812573405665"^^xsd:decimal "-0.58368328940025"^^xsd:decimal "-0.1457687264335"^^xsd:decimal "0.156943954883625"^^xsd:decimal)) log:collectAllIn ?_b2 .
-#   ("-0.291147279616375"^^xsd:decimal "0.5812573405665"^^xsd:decimal "-0.58368328940025"^^xsd:decimal "-0.1457687264335"^^xsd:decimal "0.156943954883625"^^xsd:decimal) math:sum "-0.28239800000000004"^^xsd:decimal .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :points ?pts .
-#     :Interp1 :x0 ?x0 .
-#     :Interp1 :h ?h .
-#     (?x0 ?h) math:difference ?xMinus .
-#     (?term {
-#         ?pts list:member ?pi .
-#         ?pi :x ?xi .
-#         ?pi :y ?yi .
-#         (?f {
-#         ?pts list:member ?pj .
-#         ?pj :x ?xj .
-#         ?xj math:notEqualTo ?xi .
-#         (?xMinus ?xj) math:difference ?num .
-#         (?xi ?xj) math:difference ?den .
-#         (?num ?den) math:quotient ?f .
-#     } ?factors) log:collectAllIn ?_b1 .
-#         ?factors math:product ?basis .
-#         (?yi ?basis) math:product ?term .
-#     } ?terms) log:collectAllIn ?_b2 .
-#     ?terms math:sum ?yMinus .
-#   } => {
-#     :Interp1 :yAtXMinus ?yMinus .
-#     :Interp1 :xMinus ?xMinus .
-#   } .
-# with substitution (on rule variables):
-#   ?h = 0.001
-#   ?pts = (_:b1 _:b2 _:b3 _:b4 _:b5)
-#   ?terms = ("-0.291147279616375"^^xsd:decimal "0.5812573405665"^^xsd:decimal "-0.58368328940025"^^xsd:decimal "-0.1457687264335"^^xsd:decimal "0.156943954883625"^^xsd:decimal)
-#   ?x0 = 0.6
-#   ?xMinus = "0.599"^^xsd:decimal
-#   ?yMinus = "-0.28239800000000004"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :xMinus "0.599"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :derivativeAtX0 "2.3999999999999577"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :yAtXPlus "-0.2775980000000001"^^xsd:decimal .
-#   :Interp1 :yAtXMinus "-0.28239800000000004"^^xsd:decimal .
-#   :Interp1 :h 0.001 .
-#   ("-0.2775980000000001"^^xsd:decimal "-0.28239800000000004"^^xsd:decimal) math:difference "0.0047999999999999154"^^xsd:decimal .
-#   (2.0 0.001) math:product "0.002"^^xsd:decimal .
-#   ("0.0047999999999999154"^^xsd:decimal "0.002"^^xsd:decimal) math:quotient "2.3999999999999577"^^xsd:decimal .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :yAtXPlus ?yP .
-#     :Interp1 :yAtXMinus ?yM .
-#     :Interp1 :h ?h .
-#     (?yP ?yM) math:difference ?dy .
-#     (2.0 ?h) math:product ?twoH .
-#     (?dy ?twoH) math:quotient ?dydx .
-#   } => {
-#     :Interp1 :derivativeAtX0 ?dydx .
-#   } .
-# with substitution (on rule variables):
-#   ?dy = "0.0047999999999999154"^^xsd:decimal
-#   ?dydx = "2.3999999999999577"^^xsd:decimal
-#   ?h = 0.001
-#   ?twoH = "0.002"^^xsd:decimal
-#   ?yM = "-0.28239800000000004"^^xsd:decimal
-#   ?yP = "-0.2775980000000001"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :derivativeAtX0 "2.3999999999999577"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :yAtBracketA "-1"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :points (_:b1 _:b2 _:b3 _:b4 _:b5) .
-#   :Interp1 :bracketA 0.0 .
-#   (?term {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pi .
-#       ?pi :x ?xi .
-#       ?pi :y ?yi .
-#       (?f {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pj .
-#       ?pj :x ?xj .
-#       ?xj math:notEqualTo ?xi .
-#       (0.0 ?xj) math:difference ?num .
-#       (?xi ?xj) math:difference ?den .
-#       (?num ?den) math:quotient ?f .
-#   } ?factors) log:collectAllIn ?_b1 .
-#       ?factors math:product ?basis .
-#       (?yi ?basis) math:product ?term .
-#   } ("0"^^xsd:decimal "0"^^xsd:decimal "-1"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal)) log:collectAllIn ?_b2 .
-#   ("0"^^xsd:decimal "0"^^xsd:decimal "-1"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal) math:sum "-1"^^xsd:decimal .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :points ?pts .
-#     :Interp1 :bracketA ?xa .
-#     (?term {
-#         ?pts list:member ?pi .
-#         ?pi :x ?xi .
-#         ?pi :y ?yi .
-#         (?f {
-#         ?pts list:member ?pj .
-#         ?pj :x ?xj .
-#         ?xj math:notEqualTo ?xi .
-#         (?xa ?xj) math:difference ?num .
-#         (?xi ?xj) math:difference ?den .
-#         (?num ?den) math:quotient ?f .
-#     } ?factors) log:collectAllIn ?_b1 .
-#         ?factors math:product ?basis .
-#         (?yi ?basis) math:product ?term .
-#     } ?terms) log:collectAllIn ?_b2 .
-#     ?terms math:sum ?ya .
-#   } => {
-#     :Interp1 :yAtBracketA ?ya .
-#   } .
-# with substitution (on rule variables):
-#   ?pts = (_:b1 _:b2 _:b3 _:b4 _:b5)
-#   ?terms = ("0"^^xsd:decimal "0"^^xsd:decimal "-1"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal)
-#   ?xa = 0.0
-#   ?ya = "-1"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :yAtBracketA "-1"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :yAtBracketB "1"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :points (_:b1 _:b2 _:b3 _:b4 _:b5) .
-#   :Interp1 :bracketB 1.0 .
-#   (?term {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pi .
-#       ?pi :x ?xi .
-#       ?pi :y ?yi .
-#       (?f {
-#       (_:b1 _:b2 _:b3 _:b4 _:b5) list:member ?pj .
-#       ?pj :x ?xj .
-#       ?xj math:notEqualTo ?xi .
-#       (1.0 ?xj) math:difference ?num .
-#       (?xi ?xj) math:difference ?den .
-#       (?num ?den) math:quotient ?f .
-#   } ?factors) log:collectAllIn ?_b1 .
-#       ?factors math:product ?basis .
-#       (?yi ?basis) math:product ?term .
-#   } ("0"^^xsd:decimal "1"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal)) log:collectAllIn ?_b2 .
-#   ("0"^^xsd:decimal "1"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal) math:sum "1"^^xsd:decimal .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :points ?pts .
-#     :Interp1 :bracketB ?xb .
-#     (?term {
-#         ?pts list:member ?pi .
-#         ?pi :x ?xi .
-#         ?pi :y ?yi .
-#         (?f {
-#         ?pts list:member ?pj .
-#         ?pj :x ?xj .
-#         ?xj math:notEqualTo ?xi .
-#         (?xb ?xj) math:difference ?num .
-#         (?xi ?xj) math:difference ?den .
-#         (?num ?den) math:quotient ?f .
-#     } ?factors) log:collectAllIn ?_b1 .
-#         ?factors math:product ?basis .
-#         (?yi ?basis) math:product ?term .
-#     } ?terms) log:collectAllIn ?_b2 .
-#     ?terms math:sum ?yb .
-#   } => {
-#     :Interp1 :yAtBracketB ?yb .
-#   } .
-# with substitution (on rule variables):
-#   ?pts = (_:b1 _:b2 _:b3 _:b4 _:b5)
-#   ?terms = ("0"^^xsd:decimal "1"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal "0"^^xsd:decimal)
-#   ?xb = 1.0
-#   ?yb = "1"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :yAtBracketB "1"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   _:sk_0 :a 0.0 .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :bracketA 0.0 .
-#   :Interp1 :bracketB 1.0 .
-#   :Interp1 :yAtBracketA "-1"^^xsd:decimal .
-#   :Interp1 :yAtBracketB "1"^^xsd:decimal .
-#   ("-1"^^xsd:decimal "1"^^xsd:decimal) math:product "-1"^^xsd:decimal .
-#   "-1"^^xsd:decimal math:lessThan 0.0 .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :bracketA ?xa .
-#     :Interp1 :bracketB ?xb .
-#     :Interp1 :yAtBracketA ?ya .
-#     :Interp1 :yAtBracketB ?yb .
-#     (?ya ?yb) math:product ?prod .
-#     ?prod math:lessThan 0.0 .
-#   } => {
-#     _:b6 :a ?xa .
-#     _:b6 :b ?xb .
-#     _:b6 :ya ?ya .
-#     _:b6 :yb ?yb .
-#     :Interp1 :rootBracket _:b6 .
-#   } .
-# with substitution (on rule variables):
-#   ?prod = "-1"^^xsd:decimal
-#   ?xa = 0.0
-#   ?xb = 1.0
-#   ?ya = "-1"^^xsd:decimal
-#   ?yb = "1"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 _:sk_0 :a 0.0 .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   _:sk_0 :b 1.0 .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :bracketA 0.0 .
-#   :Interp1 :bracketB 1.0 .
-#   :Interp1 :yAtBracketA "-1"^^xsd:decimal .
-#   :Interp1 :yAtBracketB "1"^^xsd:decimal .
-#   ("-1"^^xsd:decimal "1"^^xsd:decimal) math:product "-1"^^xsd:decimal .
-#   "-1"^^xsd:decimal math:lessThan 0.0 .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :bracketA ?xa .
-#     :Interp1 :bracketB ?xb .
-#     :Interp1 :yAtBracketA ?ya .
-#     :Interp1 :yAtBracketB ?yb .
-#     (?ya ?yb) math:product ?prod .
-#     ?prod math:lessThan 0.0 .
-#   } => {
-#     _:b6 :a ?xa .
-#     _:b6 :b ?xb .
-#     _:b6 :ya ?ya .
-#     _:b6 :yb ?yb .
-#     :Interp1 :rootBracket _:b6 .
-#   } .
-# with substitution (on rule variables):
-#   ?prod = "-1"^^xsd:decimal
-#   ?xa = 0.0
-#   ?xb = 1.0
-#   ?ya = "-1"^^xsd:decimal
-#   ?yb = "1"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 _:sk_0 :b 1.0 .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   _:sk_0 :ya "-1"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :bracketA 0.0 .
-#   :Interp1 :bracketB 1.0 .
-#   :Interp1 :yAtBracketA "-1"^^xsd:decimal .
-#   :Interp1 :yAtBracketB "1"^^xsd:decimal .
-#   ("-1"^^xsd:decimal "1"^^xsd:decimal) math:product "-1"^^xsd:decimal .
-#   "-1"^^xsd:decimal math:lessThan 0.0 .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :bracketA ?xa .
-#     :Interp1 :bracketB ?xb .
-#     :Interp1 :yAtBracketA ?ya .
-#     :Interp1 :yAtBracketB ?yb .
-#     (?ya ?yb) math:product ?prod .
-#     ?prod math:lessThan 0.0 .
-#   } => {
-#     _:b6 :a ?xa .
-#     _:b6 :b ?xb .
-#     _:b6 :ya ?ya .
-#     _:b6 :yb ?yb .
-#     :Interp1 :rootBracket _:b6 .
-#   } .
-# with substitution (on rule variables):
-#   ?prod = "-1"^^xsd:decimal
-#   ?xa = 0.0
-#   ?xb = 1.0
-#   ?ya = "-1"^^xsd:decimal
-#   ?yb = "1"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 _:sk_0 :ya "-1"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   _:sk_0 :yb "1"^^xsd:decimal .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :bracketA 0.0 .
-#   :Interp1 :bracketB 1.0 .
-#   :Interp1 :yAtBracketA "-1"^^xsd:decimal .
-#   :Interp1 :yAtBracketB "1"^^xsd:decimal .
-#   ("-1"^^xsd:decimal "1"^^xsd:decimal) math:product "-1"^^xsd:decimal .
-#   "-1"^^xsd:decimal math:lessThan 0.0 .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :bracketA ?xa .
-#     :Interp1 :bracketB ?xb .
-#     :Interp1 :yAtBracketA ?ya .
-#     :Interp1 :yAtBracketB ?yb .
-#     (?ya ?yb) math:product ?prod .
-#     ?prod math:lessThan 0.0 .
-#   } => {
-#     _:b6 :a ?xa .
-#     _:b6 :b ?xb .
-#     _:b6 :ya ?ya .
-#     _:b6 :yb ?yb .
-#     :Interp1 :rootBracket _:b6 .
-#   } .
-# with substitution (on rule variables):
-#   ?prod = "-1"^^xsd:decimal
-#   ?xa = 0.0
-#   ?xb = 1.0
-#   ?ya = "-1"^^xsd:decimal
-#   ?yb = "1"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 _:sk_0 :yb "1"^^xsd:decimal .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :Interp1 :rootBracket _:sk_0 .
-# It holds because the following instance of the rule body is provable:
-#   :Interp1 :bracketA 0.0 .
-#   :Interp1 :bracketB 1.0 .
-#   :Interp1 :yAtBracketA "-1"^^xsd:decimal .
-#   :Interp1 :yAtBracketB "1"^^xsd:decimal .
-#   ("-1"^^xsd:decimal "1"^^xsd:decimal) math:product "-1"^^xsd:decimal .
-#   "-1"^^xsd:decimal math:lessThan 0.0 .
-# via the schematic forward rule:
-#   {
-#     :Interp1 :bracketA ?xa .
-#     :Interp1 :bracketB ?xb .
-#     :Interp1 :yAtBracketA ?ya .
-#     :Interp1 :yAtBracketB ?yb .
-#     (?ya ?yb) math:product ?prod .
-#     ?prod math:lessThan 0.0 .
-#   } => {
-#     _:b6 :a ?xa .
-#     _:b6 :b ?xb .
-#     _:b6 :ya ?ya .
-#     _:b6 :yb ?yb .
-#     :Interp1 :rootBracket _:b6 .
-#   } .
-# with substitution (on rule variables):
-#   ?prod = "-1"^^xsd:decimal
-#   ?xa = 0.0
-#   ?xb = 1.0
-#   ?ya = "-1"^^xsd:decimal
-#   ?yb = "1"^^xsd:decimal
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :Interp1 :rootBracket _:sk_0 .

package/examples/output/rule-matching.n3 CHANGED Viewed

@@ -1,29 +1,3 @@
 @prefix : <https://eyereasoner.github.io/ns#> .
-# ----------------------------------------------------------------------
-# Proof for derived triple:
-#   :result :is true .
-# It holds because the following instance of the rule body is provable:
-#   {
-#       ?A__0 => ?B__1 .
-#   } => {
-#       :result :is true .
-#   } .
-# via the schematic forward rule:
-#   {
-#     ?A => ?B .
-#   } => {
-#     :result :is true .
-#   } .
-# with substitution (on rule variables):
-#   ?A = {
-#     ?A__0 => ?B__1 .
-#   }
-#   ?B = {
-#     :result :is true .
-#   }
-# Therefore the derived triple above is entailed by the rules and facts.
-# ----------------------------------------------------------------------
 :result :is true .