eyeling 1.24.4 → 1.24.6

package/see/examples/output/family_cousins.md

@@ -1,187 +0,0 @@
-# Family cousins  
-
-## Entailment  
-The derivation produced 25 new fact(s) from 15 stated fact(s).  
-Main entailment: **:Judy :cousin :Ivan.**  
-
-Selected entailments:  
-- :Judy :cousin :Ivan .  
-- :Judy :cousin :Heidi .  
-- :Ivan :cousin :Judy .  
-- :Heidi :cousin :Judy .  
-- :Judy :generation 3 .  
-- :Ivan :generation 3 .  
-
-## Explanation  
-Starts with 15 source fact(s), applies 4 rule(s), and reaches a fixpoint.  
-
-Derivation steps:  
-- Rule 1: true => :Adam :generation 0 derives :Adam :generation 0 .  
-  - Uses: no graph premises; built-ins/constants satisfied the rule.  
-- Rule 2 (3 premise pattern(s) => 1 conclusion pattern(s)) derives :Bob :generation 1 ., :Carol :generation 1 ., :Dave :generation 2 ., :Eve :generation 2 ., … +5 more  
-  - Uses: :Adam :parentOf :Bob . _(source)_; :Adam :generation 0 . _(derived)_; :Adam :parentOf :Carol . _(source)_; :Bob :parentOf :Dave . _(source)_; … +11 more premise fact(s)  
-- Rule 3: ?P :parentOf ?C; ?P :branch ?B => ?C :branch ?B derives :Heidi :branch :b ., :Ivan :branch :b ., :Judy :branch :c .  
-  - Uses: :Dave :parentOf :Heidi . _(source)_; :Dave :branch :b . _(source)_; :Eve :parentOf :Ivan . _(source)_; :Eve :branch :b . _(source)_; … +2 more premise fact(s)  
-- Rule 4 (5 premise pattern(s) => 1 conclusion pattern(s)) derives :Dave :cousin :Frank ., :Dave :cousin :Grace ., :Eve :cousin :Frank ., :Eve :cousin :Grace ., … +8 more  
-  - Uses: :Dave :generation 2 . _(derived)_; :Frank :generation 2 . _(derived)_; :Dave :branch :b . _(source)_; :Frank :branch :c . _(source)_; … +12 more premise fact(s)  
-
-Selected explanation support:  
-  - :Judy :cousin :Ivan . _(derived by Rule 4)_  
-    - :Judy :generation 3 . _(derived by Rule 2)_  
-      - :Frank :parentOf :Judy . _(source)_  
-      - :Frank :generation 2 . _(derived by Rule 2)_  
-        - :Carol :parentOf :Frank . _(source)_  
-        - :Carol :generation 1 . _(derived by Rule 2)_  
-          - :Adam :parentOf :Carol . _(source)_  
-          - :Adam :generation 0 . _(derived by Rule 1)_  
-    - :Ivan :generation 3 . _(derived by Rule 2)_  
-      - :Eve :parentOf :Ivan . _(source)_  
-      - :Eve :generation 2 . _(derived by Rule 2)_  
-        - :Bob :parentOf :Eve . _(source)_  
-        - :Bob :generation 1 . _(derived by Rule 2)_  
-          - :Adam :parentOf :Bob . _(source)_  
-          - :Adam :generation 0 . _(derived by Rule 1)_  
-    - :Judy :branch :c . _(derived by Rule 3)_  
-      - :Frank :parentOf :Judy . _(source)_  
-      - :Frank :branch :c . _(source)_  
-    - :Ivan :branch :b . _(derived by Rule 3)_  
-      - :Eve :parentOf :Ivan . _(source)_  
-      - :Eve :branch :b . _(source)_  
-    - ... 1 more premise fact(s)  
-  - :Judy :cousin :Heidi . _(derived by Rule 4)_  
-    - :Judy :generation 3 . _(derived by Rule 2)_  
-      - :Frank :parentOf :Judy . _(source)_  
-      - :Frank :generation 2 . _(derived by Rule 2)_  
-        - :Carol :parentOf :Frank . _(source)_  
-        - :Carol :generation 1 . _(derived by Rule 2)_  
-          - :Adam :parentOf :Carol . _(source)_  
-          - :Adam :generation 0 . _(derived by Rule 1)_  
-    - :Heidi :generation 3 . _(derived by Rule 2)_  
-      - :Dave :parentOf :Heidi . _(source)_  
-      - :Dave :generation 2 . _(derived by Rule 2)_  
-        - :Bob :parentOf :Dave . _(source)_  
-        - :Bob :generation 1 . _(derived by Rule 2)_  
-          - :Adam :parentOf :Bob . _(source)_  
-          - :Adam :generation 0 . _(derived by Rule 1)_  
-    - :Judy :branch :c . _(derived by Rule 3)_  
-      - :Frank :parentOf :Judy . _(source)_  
-      - :Frank :branch :c . _(source)_  
-    - :Heidi :branch :b . _(derived by Rule 3)_  
-      - :Dave :parentOf :Heidi . _(source)_  
-      - :Dave :branch :b . _(source)_  
-    - ... 1 more premise fact(s)  
-  - :Ivan :cousin :Judy . _(derived by Rule 4)_  
-    - :Ivan :generation 3 . _(derived by Rule 2)_  
-      - :Eve :parentOf :Ivan . _(source)_  
-      - :Eve :generation 2 . _(derived by Rule 2)_  
-        - :Bob :parentOf :Eve . _(source)_  
-        - :Bob :generation 1 . _(derived by Rule 2)_  
-          - :Adam :parentOf :Bob . _(source)_  
-          - :Adam :generation 0 . _(derived by Rule 1)_  
-    - :Judy :generation 3 . _(derived by Rule 2)_  
-      - :Frank :parentOf :Judy . _(source)_  
-      - :Frank :generation 2 . _(derived by Rule 2)_  
-        - :Carol :parentOf :Frank . _(source)_  
-        - :Carol :generation 1 . _(derived by Rule 2)_  
-          - :Adam :parentOf :Carol . _(source)_  
-          - :Adam :generation 0 . _(derived by Rule 1)_  
-    - :Ivan :branch :b . _(derived by Rule 3)_  
-      - :Eve :parentOf :Ivan . _(source)_  
-      - :Eve :branch :b . _(source)_  
-    - :Judy :branch :c . _(derived by Rule 3)_  
-      - :Frank :parentOf :Judy . _(source)_  
-      - :Frank :branch :c . _(source)_  
-    - ... 1 more premise fact(s)  
-  - :Heidi :cousin :Judy . _(derived by Rule 4)_  
-    - :Heidi :generation 3 . _(derived by Rule 2)_  
-      - :Dave :parentOf :Heidi . _(source)_  
-      - :Dave :generation 2 . _(derived by Rule 2)_  
-        - :Bob :parentOf :Dave . _(source)_  
-        - :Bob :generation 1 . _(derived by Rule 2)_  
-          - :Adam :parentOf :Bob . _(source)_  
-          - :Adam :generation 0 . _(derived by Rule 1)_  
-    - :Judy :generation 3 . _(derived by Rule 2)_  
-      - :Frank :parentOf :Judy . _(source)_  
-      - :Frank :generation 2 . _(derived by Rule 2)_  
-        - :Carol :parentOf :Frank . _(source)_  
-        - :Carol :generation 1 . _(derived by Rule 2)_  
-          - :Adam :parentOf :Carol . _(source)_  
-          - :Adam :generation 0 . _(derived by Rule 1)_  
-    - :Heidi :branch :b . _(derived by Rule 3)_  
-      - :Dave :parentOf :Heidi . _(source)_  
-      - :Dave :branch :b . _(source)_  
-    - :Judy :branch :c . _(derived by Rule 3)_  
-      - :Frank :parentOf :Judy . _(source)_  
-      - :Frank :branch :c . _(source)_  
-    - ... 1 more premise fact(s)  
-  - :Judy :generation 3 . _(derived by Rule 2)_  
-    - :Frank :parentOf :Judy . _(source)_  
-    - :Frank :generation 2 . _(derived by Rule 2)_  
-      - :Carol :parentOf :Frank . _(source)_  
-      - :Carol :generation 1 . _(derived by Rule 2)_  
-        - :Adam :parentOf :Carol . _(source)_  
-        - :Adam :generation 0 . _(derived by Rule 1)_  
-          - no graph premises; built-ins/constants satisfied the rule.  
-  - :Ivan :generation 3 . _(derived by Rule 2)_  
-    - :Eve :parentOf :Ivan . _(source)_  
-    - :Eve :generation 2 . _(derived by Rule 2)_  
-      - :Bob :parentOf :Eve . _(source)_  
-      - :Bob :generation 1 . _(derived by Rule 2)_  
-        - :Adam :parentOf :Bob . _(source)_  
-        - :Adam :generation 0 . _(derived by Rule 1)_  
-          - no graph premises; built-ins/constants satisfied the rule.  
-
-The selected facts are serialized in the Formal TriG Output section.  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <http://example.org/family#> .  
-@prefix math: <http://www.w3.org/2000/10/swap/math#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:Adam :generation 0 .  
-:Bob :generation 1 .  
-:Carol :generation 1 .  
-:Heidi :branch :b .  
-:Ivan :branch :b .  
-:Judy :branch :c .  
-:Dave :generation 2 .  
-:Eve :generation 2 .  
-:Frank :generation 2 .  
-:Grace :generation 2 .  
-:Dave :cousin :Frank .  
-:Dave :cousin :Grace .  
-:Eve :cousin :Frank .  
-:Eve :cousin :Grace .  
-:Frank :cousin :Dave .  
-:Frank :cousin :Eve .  
-:Grace :cousin :Dave .  
-:Grace :cousin :Eve .  
-:Heidi :generation 3 .  
-:Ivan :generation 3 .  
-:Judy :generation 3 .  
-:Heidi :cousin :Judy .  
-:Ivan :cousin :Judy .  
-:Judy :cousin :Heidi .  
-:Judy :cousin :Ivan .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "family_cousins" .  
-  in:run see:title "Family cousins" .  
-  in:run see:sourceFile "examples/n3/family_cousins.n3" .  
-  in:run see:sourceSHA256 "5254e987fd72e71aafad53c8e3e9eb91d034cfd06878fcd02f611539200ab3e4" .  
-  in:run see:description "" .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 15 .  
-  in:run see:compiledRules 4 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 0 .  
-}  
-```  
-

package/see/examples/output/fastpow.md

@@ -1,36 +0,0 @@
-# Fast exponentiation demo  
-
-## Entailment  
-The derivation produced 0 new fact(s) from 0 stated fact(s).  
-
-## Explanation  
-Starts with 0 source fact(s), applies 8 rule(s), and reaches a fixpoint.  
-
-The selected facts are serialized in the Formal TriG Output section.  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/see/examples/fastpow#> .  
-@prefix math: <http://www.w3.org/2000/10/swap/math#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "fastpow" .  
-  in:run see:title "Fast exponentiation demo" .  
-  in:run see:sourceFile "examples/n3/fastpow.n3" .  
-  in:run see:sourceSHA256 "be6ae46e774f3887cf89f2302ba55a826a08d3c846b77dd3c78a90e32d0ebc14" .  
-  in:run see:description "" .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 0 .  
-  in:run see:compiledRules 1 .  
-  in:run see:compiledBackwardRules 7 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 0 .  
-}  
-```  
-

package/see/examples/output/fibonacci.md

@@ -1,53 +0,0 @@
-# Fibonacci Example (Big)  
-
-## Entailment  
-The Fibonacci number for index 10000 is:  
-33644764876431783266621612005107543310302148460680063906564769974680081442166662368155595513633734025582065332680836159373734790483865268263040892463056431887354544369559827491606602099884183933864652731300088830269235673613135117579297437854413752130520504347701602264758318906527890855154366159582987279682987510631200575428783453215515103870818298969791613127856265033195487140214287532698187962046936097879900350962302291026368131493195275630227837628441540360584402572114334961180023091208287046088923962328835461505776583271252546093591128203925285393434620904245248929403901706233888991085841065183173360437470737908552631764325733993712871937587746897479926305837065742830161637408969178426378624212835258112820516370298089332099905707920064367426202389783111470054074998459250360633560933883831923386783056136435351892133279732908133732642652633989763922723407882928177953580570993691049175470808931841056146322338217465637321248226383092103297701648054726243842374862411453093812206564914032751086643394517512161526545361333111314042436854805106765843493523836959653428071768775328348234345557366719731392746273629108210679280784718035329131176778924659089938635459327894523777674406192240337638674004021330343297496902028328145933418826817683893072003634795623117103101291953169794607632737589253530772552375943788434504067715555779056450443016640119462580972216729758615026968443146952034614932291105970676243268515992834709891284706740862008587135016260312071903172086094081298321581077282076353186624611278245537208532365305775956430072517744315051539600905168603220349163222640885248852433158051534849622434848299380905070483482449327453732624567755879089187190803662058009594743150052402532709746995318770724376825907419939632265984147498193609285223945039707165443156421328157688908058783183404917434556270520223564846495196112460268313970975069382648706613264507665074611512677522748621598642530711298441182622661057163515069260029861704945425047491378115154139941550671256271197133252763631939606902895650288268608362241082050562430701794976171121233066073310059947366875  
-
-## Explanation  
-The Fibonacci sequence is defined by F(0)=0, F(1)=1, and F(n)=F(n-1)+F(n-2) for n>=2. The N3 source records the target, base cases, recurrence rule, and sample facts for representative indices. The compiled SEE example carries the exact 2090-digit result as a compiled report while preserving the original JSON data input.  
-
-**Generated derivation support**  
-
-Compiled support: 27 source fact(s), 1 rule(s), fixpoint reached before rendering.  
-
-Derivation steps:  
-- Rule 1 (12 premise pattern(s) => 2 conclusion pattern(s)) derives :fibonacciExample log:outputString "[authored report]" ., :fibonacciExample :certifies :Sample10000 .  
-  - Uses: :Run :target 10000 . _(source)_; :Run :sampleIndex 0 . _(source)_; :Run :sampleIndex 1 . _(source)_; :Run :sampleIndex 2 . _(source)_; … +7 more premise fact(s)  
-
-Selected explanation support:  
-  - :fibonacciExample :certifies :Sample10000 . _(derived by Rule 1)_  
-    - :Run :target 10000 . _(source)_  
-    - :Run :sampleIndex 0 . _(source)_  
-    - :Run :sampleIndex 1 . _(source)_  
-    - :Run :sampleIndex 2 . _(source)_  
-    - ... 7 more premise fact(s)  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/see/examples/fibonacci#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix string: <http://www.w3.org/2000/10/swap/string#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:fibonacciExample :certifies :Sample10000 .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "fibonacci" .  
-  in:run see:title "Fibonacci Example (Big)" .  
-  in:run see:sourceFile "examples/n3/fibonacci.n3" .  
-  in:run see:sourceSHA256 "25d93f4de352e797e1afb277f9f5805b1cdaface366f199b1195cc601555a172" .  
-  in:run see:description "N3-compiled version of the exact Fibonacci example. The target and sample indices are represented as formal TriG input\nevidence when this source is compiled." .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 27 .  
-  in:run see:compiledRules 1 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 1 .  
-}  
-```  
-

package/see/examples/output/french_cities.md

@@ -1,70 +0,0 @@
-# French cities — graph path traversal.  
-
-## Entailment  
-The compiled query selected 1 fact(s) after the rule closure was computed.  
-Main entailment: **:paris :path :nantes.**  
-
-Selected entailments:  
-- :paris :path :nantes .  
-
-## Explanation  
-Starts with 12 source fact(s), applies 2 rule(s), and reaches a fixpoint.  
-The log:query projection then keeps only the matching fact(s) shown above.  
-
-Derivation steps:  
-- Rule 1: ?P rdfs:subPropertyOf ?R; ?S ?P ?O => ?S ?R ?O derives :paris :path :orleans ., :paris :path :chartres ., :paris :path :amiens ., :orleans :path :blois ., … +6 more  
-  - Uses: :oneway rdfs:subPropertyOf :path . _(source)_; :paris :oneway :orleans . _(source)_; :paris :oneway :chartres . _(source)_; :paris :oneway :amiens . _(source)_; … +7 more premise fact(s)  
-- Rule 2 (3 premise pattern(s) => 1 conclusion pattern(s)) derives :paris :path :blois ., :paris :path :bourges ., :orleans :path :tours ., :paris :path :lemans ., … +7 more  
-  - Uses: :path rdf:type owl:TransitiveProperty . _(source)_; :orleans :path :blois . _(derived)_; :paris :path :orleans . _(derived)_; :orleans :path :bourges . _(derived)_; … +10 more premise fact(s)  
-
-Selected explanation support:  
-  - :paris :path :nantes . _(derived by Rule 2)_  
-    - :path rdf:type owl:TransitiveProperty . _(source)_  
-    - :lemans :path :nantes . _(derived by Rule 2)_  
-      - :path rdf:type owl:TransitiveProperty . _(source)_  
-      - :angers :path :nantes . _(derived by Rule 1)_  
-        - :oneway rdfs:subPropertyOf :path . _(source)_  
-        - :angers :oneway :nantes . _(source)_  
-      - :lemans :path :angers . _(derived by Rule 1)_  
-        - :oneway rdfs:subPropertyOf :path . _(source)_  
-        - :lemans :oneway :angers . _(source)_  
-    - :paris :path :lemans . _(derived by Rule 2)_  
-      - :path rdf:type owl:TransitiveProperty . _(source)_  
-      - :chartres :path :lemans . _(derived by Rule 1)_  
-        - :oneway rdfs:subPropertyOf :path . _(source)_  
-        - :chartres :oneway :lemans . _(source)_  
-      - :paris :path :chartres . _(derived by Rule 1)_  
-        - :oneway rdfs:subPropertyOf :path . _(source)_  
-        - :paris :oneway :chartres . _(source)_  
-
-The query-selected facts are serialized in the Formal TriG Output section.  
-
-## Formal TriG Output  
-
-```trig  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .  
-@prefix owl: <http://www.w3.org/2002/07/owl#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix : <https://eyereasoner.github.io/see/examples/french-cities#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-
-:paris :path :nantes .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "french_cities" .  
-  in:run see:title "French cities — graph path traversal." .  
-  in:run see:sourceFile "examples/n3/french_cities.n3" .  
-  in:run see:sourceSHA256 "7e3672e6ab314845d44cdd16e7a91484c205de77ff8c9a06971f857612692be4" .  
-  in:run see:description "Based on the EYE reasoning/graph example: graph.axiom.n3 plus graph.filter.n3.\nIt asks whether Paris can reach Nantes by following one-way links, using a\nsubproperty rule and a transitive-property rule." .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 12 .  
-  in:run see:compiledRules 2 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 1 .  
-}  
-```  
-

package/see/examples/output/fundamental_theorem_arithmetic.md

@@ -1,101 +0,0 @@
-# Fundamental Theorem Arithmetic  
-
-## Entailment  
-Primary N3 case: n = 202692987 has prime factors 3 * 3 * 7 * 829 * 3881.  
-primary prime-power form : 3^2 * 7 * 829 * 3881  
-sample count : 6  
-largest sample : 600851475143  
-total prime factors counted with multiplicity : 31  
-distinct primes seen across samples : 17  
-
-Sample factorizations:  
-  360360 = 2^3 * 3^2 * 5 * 7 * 11 * 13  
-  202692987 = 3^2 * 7 * 829 * 3881  
-  4294967295 = 3 * 5 * 17 * 257 * 65537  
-  600851475143 = 71 * 839 * 1471 * 6857  
-  9876543210 = 2 * 3^2 * 5 * 17^2 * 379721  
-  9999999967 = 9999999967  
-
-## Explanation  
-Existence comes from repeated smallest-divisor decomposition. At each step, the first divisor found is prime because no smaller positive divisor can divide the current number.  
-
-Smallest-divisor trace for the N3 source number:  
-  202692987 = 3 * 67564329  
-  67564329 = 3 * 22521443  
-  22521443 = 7 * 3217349  
-  3217349 = 829 * 3881  
-  3881 is prime  
-
-Uniqueness up to order is validated by reversing each traversal and sorting both factor lists. Matching sorted lists describe the same multiset of prime factors, even when the factors were discovered in the opposite order.  
-  source smallest-first factors : 3 * 3 * 7 * 829 * 3881  
-  source largest-first factors : 3881 * 829 * 7 * 3 * 3  
-  source sorted comparison : 3 * 3 * 7 * 829 * 3881  
-
-The additional samples cover repeated small factors, special products, large composites, and a larger prime that has no smaller divisor.  
-
-**Generated derivation support**  
-
-Compiled support: 16 source fact(s), 4 rule(s), fixpoint reached before rendering.  
-
-Derivation steps:  
-- Rule 1 (4 premise pattern(s) => 1 conclusion pattern(s)) derives :Case :reconstructsProduct true .  
-  - Uses: :Case :n 202692987 . _(source)_; :Case :factors (3 3 7 829 3881) . _(source)_  
-- Rule 2 (5 premise pattern(s) => 1 conclusion pattern(s)) derives :Case :uniqueUpToOrder true .  
-  - Uses: :Case :factors (3 3 7 829 3881) . _(source)_  
-- Rule 3 (4 premise pattern(s) => 1 conclusion pattern(s)) derives :Case :allDistinctFactorsPrime true .  
-  - Uses: 3 :primeWitness true . _(source)_; 7 :primeWitness true . _(source)_; 829 :primeWitness true . _(source)_; 3881 :primeWitness true . _(source)_  
-- Rule 7 (15 premise pattern(s) => 4 conclusion pattern(s)) derives :fundamentalTheoremArithmetic log:outputString "[authored report]" ., :fundamentalTheoremArithmetic :demonstrates :Existence ., :fundamentalTheoremArithmetic :demonstrates :UniquenessUpToOrder ., :fundamentalTheoremArithmetic :demonstrates :PrimeWitnesses .  
-  - Uses: :Case :n 202692987 . _(source)_; :Case :flatFactorString "3 * 3 * 7 * 829 * 3881" . _(source)_; :Case :primePowerString "3^2 * 7 * 829 * 3881" . _(source)_; :Case :largestFlatFactorString "3881 * 829 * 7 * 3 * 3" . _(source)_; … +10 more premise fact(s)  
-
-Selected explanation support:  
-  - :fundamentalTheoremArithmetic :demonstrates :PrimeWitnesses . _(derived by Rule 7)_  
-    - :Case :n 202692987 . _(source)_  
-    - :Case :flatFactorString "3 * 3 * 7 * 829 * 3881" . _(source)_  
-    - :Case :primePowerString "3^2 * 7 * 829 * 3881" . _(source)_  
-    - :Case :largestFlatFactorString "3881 * 829 * 7 * 3 * 3" . _(source)_  
-    - ... 10 more premise fact(s)  
-  - :fundamentalTheoremArithmetic :demonstrates :UniquenessUpToOrder . _(derived by Rule 7)_  
-    - :Case :n 202692987 . _(source)_  
-    - :Case :flatFactorString "3 * 3 * 7 * 829 * 3881" . _(source)_  
-    - :Case :primePowerString "3^2 * 7 * 829 * 3881" . _(source)_  
-    - :Case :largestFlatFactorString "3881 * 829 * 7 * 3 * 3" . _(source)_  
-    - ... 10 more premise fact(s)  
-  - :fundamentalTheoremArithmetic :demonstrates :Existence . _(derived by Rule 7)_  
-    - :Case :n 202692987 . _(source)_  
-    - :Case :flatFactorString "3 * 3 * 7 * 829 * 3881" . _(source)_  
-    - :Case :primePowerString "3^2 * 7 * 829 * 3881" . _(source)_  
-    - :Case :largestFlatFactorString "3881 * 829 * 7 * 3 * 3" . _(source)_  
-    - ... 10 more premise fact(s)  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/see/examples/fundamental-theorem-arithmetic#> .  
-@prefix math: <http://www.w3.org/2000/10/swap/math#> .  
-@prefix list: <http://www.w3.org/2000/10/swap/list#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix string: <http://www.w3.org/2000/10/swap/string#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:fundamentalTheoremArithmetic :demonstrates :Existence .  
-:fundamentalTheoremArithmetic :demonstrates :UniquenessUpToOrder .  
-:fundamentalTheoremArithmetic :demonstrates :PrimeWitnesses .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "fundamental_theorem_arithmetic" .  
-  in:run see:title "Fundamental Theorem Arithmetic" .  
-  in:run see:sourceFile "examples/n3/fundamental_theorem_arithmetic.n3" .  
-  in:run see:sourceSHA256 "d88eca366c590d49544e49453cbe69ba38938f8bc23919278bfaadd0bed0cd2d" .  
-  in:run see:description "N3-compiled version of the hand-written SEE example. The primary case mirrors\nEyeling's fundamental-theorem-arithmetic.n3: n = 202692987 is validated against\nthe factorization 3^2 * 7 * 829 * 3881. Extra sample summaries are kept as\ndata so the SEE report still documents the larger regression set." .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 16 .  
-  in:run see:compiledRules 4 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 3 .  
-  in:run see:compiledQueries 1 .  
-}  
-```  
-

package/see/examples/output/genetic_knapsack_selection.md

@@ -1,66 +0,0 @@
-# Genetic Knapsack Selection  
-
-## Entailment  
-final genome : 101000000101  
-selected items : item01, item03, item10, item12  
-weight : 50 / 50  
-value : 101  
-fitness : 999899  
-generations evaluated : 5  
-exhaustive optimum value : 104 at genome 001000011111  
-
-## Explanation  
-Each genome bit says whether the corresponding item is selected for the knapsack. Feasible candidates get fitness 1000000 minus value, so higher value means lower fitness; overweight candidates are penalized above every feasible candidate. The N3 source records the deterministic local-search result and validates that the final genome respects capacity and has no strictly better one-bit neighbor. For transparency, an exhaustive enumeration also records the global best feasible value, showing this is a local mutation search rather than a global-optimality claim.  
-
-**Generated derivation support**  
-
-Compiled support: 14 source fact(s), 2 rule(s), fixpoint reached before rendering.  
-
-Derivation steps:  
-- Rule 1 (7 premise pattern(s) => 1 conclusion pattern(s)) derives :Run :localSearchStopsAt :FinalLocal .  
-  - Uses: :Run :capacity 50 . _(source)_; :FinalLocal :weight 50 . _(source)_; :FinalLocal :value 101 . _(source)_; :NeighborSummary :bestNeighborValue 101 . _(source)_; … +1 more premise fact(s)  
-- Rule 2 (11 premise pattern(s) => 2 conclusion pattern(s)) derives :geneticKnapsackSelection log:outputString "[authored report]" ., :geneticKnapsackSelection :selects :FinalLocal .  
-  - Uses: :Run :capacity 50 . _(source)_; :Run :localSearchStopsAt :FinalLocal . _(derived)_; :FinalLocal :genome "101000000101" . _(source)_; :FinalLocal :selectedItems "item01, item03, item10, item12" . _(source)_; … +6 more premise fact(s)  
-
-Selected explanation support:  
-  - :geneticKnapsackSelection :selects :FinalLocal . _(derived by Rule 2)_  
-    - :Run :capacity 50 . _(source)_  
-    - :Run :localSearchStopsAt :FinalLocal . _(derived by Rule 1)_  
-      - :Run :capacity 50 . _(source)_  
-      - :FinalLocal :weight 50 . _(source)_  
-      - :FinalLocal :value 101 . _(source)_  
-      - :NeighborSummary :bestNeighborValue 101 . _(source)_  
-      - ... 1 more premise fact(s)  
-    - :FinalLocal :genome "101000000101" . _(source)_  
-    - :FinalLocal :selectedItems "item01, item03, item10, item12" . _(source)_  
-    - ... 6 more premise fact(s)  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/see/examples/genetic-knapsack-selection#> .  
-@prefix math: <http://www.w3.org/2000/10/swap/math#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix string: <http://www.w3.org/2000/10/swap/string#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:geneticKnapsackSelection :selects :FinalLocal .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "genetic_knapsack_selection" .  
-  in:run see:title "Genetic Knapsack Selection" .  
-  in:run see:sourceFile "examples/n3/genetic_knapsack_selection.n3" .  
-  in:run see:sourceSHA256 "c8fb351156e7656f2e3600f0d1eaf8a624742a91f688425564822cea78530855" .  
-  in:run see:description "N3-compiled version of the deterministic one-bit mutation knapsack example.\nThe original item list JSON is preserved as the data-input sidecar." .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 14 .  
-  in:run see:compiledRules 2 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 1 .  
-}  
-```  
-

package/see/examples/output/goldbach_1000.md

@@ -1,58 +0,0 @@
-# Goldbach 1000  
-
-## Entailment  
-All 499 even integers from 4 through 1000 have a Goldbach witness.  
-sample witnesses : 4=2+2; 28=5+23; 100=3+97; 998=7+991; 1000=3+997  
-
-## Explanation  
-The bounded run caches primes up to the configured bound and then searches each even number E for a prime P not greater than E/2 where E-P is also prime. No counterexample is found in the bounded range, so the bounded Goldbach condition succeeds for this dataset.  
-
-**Generated derivation support**  
-
-Compiled support: 28 source fact(s), 3 rule(s), fixpoint reached before rendering.  
-
-Derivation steps:  
-- Rule 1 (6 premise pattern(s) => 1 conclusion pattern(s)) derives :w4 :verifiedGoldbachWitness true ., :w28 :verifiedGoldbachWitness true ., :w100 :verifiedGoldbachWitness true ., :w998 :verifiedGoldbachWitness true ., … +1 more  
-  - Uses: :w4 :even 4 . _(source)_; :w4 :p 2 . _(source)_; :w4 :q 2 . _(source)_; 2 :prime true . _(source)_; … +19 more premise fact(s)  
-- Rule 2 (6 premise pattern(s) => 1 conclusion pattern(s)) derives :BoundedRun :boundedGoldbachCondition true .  
-  - Uses: :w4 :verifiedGoldbachWitness true . _(derived)_; :w28 :verifiedGoldbachWitness true . _(derived)_; :w100 :verifiedGoldbachWitness true . _(derived)_; :w998 :verifiedGoldbachWitness true . _(derived)_; … +2 more premise fact(s)  
-- Rule 4 (6 premise pattern(s) => 2 conclusion pattern(s)) derives :goldbach1000 log:outputString "[authored report]" ., :goldbach1000 :demonstrates :BoundedGoldbachEvidence .  
-  - Uses: :BoundedRun :minEven 4 . _(source)_; :BoundedRun :maxEven 1000 . _(source)_; :BoundedRun :evenCount 499 . _(source)_; :BoundedRun :sampleWitnesses "4=2+2; 28=5+23; 100=3+97; 998=7+991; 1000=3+997" . _(source)_; … +1 more premise fact(s)  
-
-Selected explanation support:  
-  - :goldbach1000 :demonstrates :BoundedGoldbachEvidence . _(derived by Rule 4)_  
-    - :BoundedRun :minEven 4 . _(source)_  
-    - :BoundedRun :maxEven 1000 . _(source)_  
-    - :BoundedRun :evenCount 499 . _(source)_  
-    - :BoundedRun :sampleWitnesses "4=2+2; 28=5+23; 100=3+97; 998=7+991; 1000=3+997" . _(source)_  
-    - ... 1 more premise fact(s)  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/see/examples/goldbach-1000#> .  
-@prefix math: <http://www.w3.org/2000/10/swap/math#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix string: <http://www.w3.org/2000/10/swap/string#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-
-:goldbach1000 :demonstrates :BoundedGoldbachEvidence .  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "goldbach_1000" .  
-  in:run see:title "Goldbach 1000" .  
-  in:run see:sourceFile "examples/n3/goldbach_1000.n3" .  
-  in:run see:sourceSHA256 "f40ec2cb172140ebdb5632a0abf0f0498be1183564755aaf76748545a2b49158" .  
-  in:run see:description "N3-compiled version of the bounded Goldbach SEE example. It keeps the bounded\nresult as committed data and uses rules to verify the representative witness\nequations that are shown in the report." .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 28 .  
-  in:run see:compiledRules 3 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 1 .  
-  in:run see:compiledQueries 1 .  
-}  
-```  
-

package/see/examples/output/good_cobbler.md

@@ -1,54 +0,0 @@
-# Good cobbler  
-
-## Entailment  
-The derivation produced 1 formula-valued entailment(s).  
-Main entailment: **:test is { :joe :is (:good :Cobbler) }.**  
-
-Selected entailments:  
-- :test :is { :joe :is (:good :Cobbler) } .  
-
-## Explanation  
-Starts with 1 source fact(s), applies 1 rule(s), and reaches a fixpoint.  
-
-Derivation steps:  
-- Rule 1: ?X :is (:good ?Y) => :test :is { ?X :is (:good ?Y) } derives :test :is { :joe :is (:good :Cobbler) } .  
-  - Uses: :joe :is (:good :Cobbler) . _(source)_  
-
-Selected explanation support:  
-  - :test :is { :joe :is (:good :Cobbler) } . _(derived by Rule 1)_  
-    - :joe :is (:good :Cobbler) . _(source)_  
-
-The formula-valued facts are serialized in the Formal TriG Output section.  
-
-## Formal TriG Output  
-
-```trig  
-@prefix : <https://eyereasoner.github.io/see/examples/good-cobbler#> .  
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .  
-@prefix see: <https://example.org/see#> .  
-@prefix in: <https://example.org/see/input#> .  
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .  
-@prefix out: <https://example.org/see/output#> .  
-
-:test :is out:formula1 .  
-
-out:formula1 {  
-  :joe :is (:good :Cobbler) .  
-}  
-
-in:metadata {  
-  in:run a see:InputDataset .  
-  in:run see:name "good_cobbler" .  
-  in:run see:title "Good cobbler" .  
-  in:run see:sourceFile "examples/n3/good_cobbler.n3" .  
-  in:run see:sourceSHA256 "7aeddb38a902b2684ba8824e3ec909e24716520433e9fbd31f6a0238cc1bd686" .  
-  in:run see:description "Example from https://shs.hal.science/halshs-04148373/document\nUsing term logic http://intrologic.stanford.edu/chapters/chapter_11.html" .  
-  in:run see:compiler "see.js N3-to-JS compiler" .  
-  in:run see:inputFacts 1 .  
-  in:run see:compiledRules 1 .  
-  in:run see:compiledBackwardRules 0 .  
-  in:run see:compiledFuses 0 .  
-  in:run see:compiledQueries 0 .  
-}  
-```  
-