eyeling 1.24.4 → 1.24.6

package/see/examples/n3/dijkstra.n3

@@ -1,46 +0,0 @@
-# ===========================================================
-# Dijkstra's algorithm to find the shortest path
-# ===========================================================
-@prefix list: <http://www.w3.org/2000/10/swap/list#>.
-@prefix math: <http://www.w3.org/2000/10/swap/math#>.
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-@prefix : <https://eyereasoner.github.io/see/examples/dijkstra#>.
-
-# edges
-(:a :b) :edge 4 .
-(:a :c) :edge 2 .
-(:b :c) :edge 1 .
-(:b :d) :edge 5 .
-(:c :d) :edge 8 .
-(:c :e) :edge 10 .
-(:d :e) :edge 2 .
-(:d :f) :edge 6 .
-(:e :f) :edge 3 .
-
-{ (?A ?B) :edge ?C. } => { (?B ?A) :edge ?C. }.
-
-# Dijkstra's algorithm
-{ (?Start ?Goal) :dijkstra (?Path ?Cost) } <= {
-  (((0 ?Start)) ?Goal ()) :dijkstra2 (?RevPath ?Cost).
-  ?RevPath list:reverse ?Path.
-}.
-
-{ (?L1 ?Goal ?L2) :dijkstra2 (?L3 ?Cost) } <= {
-  ?L1 list:firstRest (?L4 ?L5).
-  ?L4 list:firstRest (?Cost ?L3).
-  ?L3 list:firstRest (?Goal ?Path).
-}.
-
-{ (?L1 ?Goal ?Visited) :dijkstra2 (?ResultPath ?ResultCost) } <= {
-  ?L1 list:firstRest (?L2 ?Queue).
-  ?L2 list:firstRest (?Cost ?L3).
-  ?L3 list:firstRest (?Node ?Path).
-  (?L4 { ?L4 list:firstRest (?NewCost ?L5). ?L5 list:firstRest (?Neighbor ?L6). ?L6 list:firstRest (?Node ?Path). (?Node ?Neighbor) :edge ?Weight. ?Visited list:notMember ?Neighbor. (?Cost ?Weight) math:sum ?NewCost. } ?Neighbors) log:collectAllIn ?SCOPE.
-  (?Queue ?Neighbors) list:append ?NewQueue.
-  ?NewQueue list:sort ?SortedQueue.
-  ?L7 list:firstRest (?Node ?Visited).
-  (?SortedQueue ?Goal ?L7) :dijkstra2 (?ResultPath ?ResultCost).
-}.
-
-# find the paths
-{ (:a :f) :dijkstra (?Path ?Cost). } => { (:a :f) :path (?Path ?Cost). }.

package/see/examples/n3/dog.n3

@@ -1,20 +0,0 @@
-# ===============================================
-# Dog license example
-# If you have more than 4 dogs you need a license.
-# ===============================================
-
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-@prefix math: <http://www.w3.org/2000/10/swap/math#>.
-@prefix : <https://eyereasoner.github.io/ns#>.
-
-:alice :hasDog :dog1, :dog2, :dog3, :dog4, :dog5.
-:bob :hasDog :dog6, :dog7.
-
-{
- ?Subject :hasDog ?Any.
- (1 { ?Subject :hasDog ?Dog } ?List) log:collectAllIn ?Scope.
- ?List math:sum ?Count.
- ?Count math:greaterThan 4.
-} => {
- ?Subject :mustHave :dogLicense.
-}.

package/see/examples/n3/equals.n3

@@ -1,11 +0,0 @@
-# =================================
-# Equals test
-# Example from Patrick Hochstenbach
-# =================================
-
-@prefix owl: <http://www.w3.org/2002/07/owl#>.
-@prefix : <http://example.org/socrates#>.
-
-:X = :Y .
-
-{ :X owl:sameAs :Y } => { :test :is true }.

package/see/examples/n3/equivalence_classes_overlap_implies_same_class.n3

@@ -1,19 +0,0 @@
-# If two equivalence classes share an element, they are the same class.
-@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-
-{ ?x :inX true. } => { ?x :sim ?x. }.
-{ ?x :sim ?y. } => { ?y :sim ?x. }.
-{ ?x :sim ?y. ?y :sim ?z. } => { ?x :sim ?z. }.
-{ ?u :sim ?x. } => { ?u :inClassOf ?x. }.
-{ ?x :sim ?y. } => { (?x ?y) :sameClass true. }.
-{ (?x ?y) :sameClass true. } => { (?y ?x) :sameClass true. }.
-{ ?z :inClassOf ?x. ?z :inClassOf ?y. (?x ?y) :sameClass true. } => { (?x ?y ?z) :sharedMemberShowsSameClass true. }.
-
-:a :inX true.
-:b :inX true.
-:c :inX true.
-:b :sim :a.
-:b :sim :c.
-
-{ (?x ?y ?z) :sharedMemberShowsSameClass true. ?x log:notEqualTo ?y. } log:query { :result :sameClassBecauseOfSharedMember (?x ?y ?z). }.

package/see/examples/n3/euler_identity.n3

@@ -1,41 +0,0 @@
-# =========================================================================================
-# Euler identity (exact, certificate-friendly):
-# exp(i*pi) + 1 = 0
-#
-# Philosophy:
-# Unlike the T-gate example, this phase needs no approximation. exp(i*pi) lands exactly at
-# (-1,0) = cos(pi) + i sin(pi), so the identity can be certified using integer arithmetic
-# alone.
-#
-# Method:
-# 1) Construct -1 as 0 - 1.
-# 2) Represent exp(i*pi) exactly as (-1, 0).
-# 3) Add 1 componentwise to obtain (0, 0).
-# 4) Sanity validation the phase modulus: |-1 + 0i|^2 = 1.
-# 5) Project only the intended certificates via log:query.
-# =========================================================================================
-@prefix : <https://eyereasoner.github.io/see/examples/euler-identity#>.
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-@prefix math: <http://www.w3.org/2000/10/swap/math#>.
-
-# Parameters
-:EulerIdentity a :ExactComplexEquation; :name "Euler identity"; :formula "exp(i*pi) + 1 = 0"; :usesPhase :phasePi.
-:one a :ComplexNumber; :exact (1 0).
-:zero a :ComplexNumber; :exact (0 0).
-:phasePi a :ComplexPhase; :definedAs "cos(pi) + i sin(pi)".
-
-# 1) Construct exp(i*pi) exactly as (-1, 0)
-{ (0 1) math:difference ?minusOne. } => { :phasePi :exact (?minusOne 0). }.
-
-# 2) Add 1 componentwise: (-1 + 0i) + (1 + 0i) = 0 + 0i
-{ :phasePi :exact (?re ?im). :one :exact (?oneRe ?oneIm). (?re ?oneRe) math:sum ?sumRe. (?im ?oneIm) math:sum ?sumIm. } => { :EulerIdentity :lhsExact (?sumRe ?sumIm). :EulerIdentity :rhsExact (0 0). }.
-
-# 3) Certify that the left-hand side is exactly zero
-{ :EulerIdentity :lhsExact (?sumRe ?sumIm). :zero :exact (?sumRe ?sumIm). } => { :EulerIdentity :holds true. }.
-
-# 4) Sanity validation: |exp(i*pi)|^2 = (-1)^2 + 0^2 = 1
-{ :phasePi :exact (?re ?im). (?re ?re) math:product ?re2. (?im ?im) math:product ?im2. (?re2 ?im2) math:sum ?modSq. } => { :phasePi :modSq ?modSq. }.
-{ :phasePi :modSq ?modSq. ?modSq math:equalTo 1. } => { :phasePi :modSqIsOne true. }.
-
-# 5) Output selection (log:query)
-{ :phasePi :exact (?re ?im). :EulerIdentity :lhsExact (?sumRe ?sumIm). :EulerIdentity :rhsExact (?rhsRe ?rhsIm). :phasePi :modSq ?modSq. :phasePi :modSqIsOne ?modOk. :EulerIdentity :holds ?ok. } log:query { :result :phasePi (?re ?im). :result :lhsPlusOne (?sumRe ?sumIm). :result :rhsZero (?rhsRe ?rhsIm). :result :phaseModSq ?modSq. :result :phaseModSqIsOne ?modOk. :result :identityHolds ?ok. }.

package/see/examples/n3/ev_roundtrip_planner.n3

@@ -1,82 +0,0 @@
-# ====================
-# EV Roadtrip Planner
-# ====================
-# N3-compiled version of the hand-written EV roadtrip planner. Candidate plans
-# are represented as data; rules apply the same acceptance thresholds and select
-# the fastest acceptable route.
-
-@prefix : <https://eyereasoner.github.io/see/examples/ev-roundtrip-planner#>.
-@prefix gps: <https://eyereasoner.github.io/see/examples/gps#>.
-@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#>.
-
-:Thresholds
-  :minBelief 0.93;
-  :maxCost 0.090;
-  :maxDuration 260.0.
-
-:Start :city :Brussels; :battery :high; :pass :none.
-:Goal :city :Cologne.
-
-:plan1 a gps:Plan;
-  gps:actions "drive_bru_liege -> drive_liege_aachen -> shuttle_aachen_cologne";
-  gps:duration 210.0; gps:cost 0.054; gps:belief 0.974175; gps:comfort 0.898320;
-  gps:finalCity "Cologne"; gps:finalBattery "low"; gps:finalPass "none"; gps:fuelRemaining 5;
-  gps:rank 1.
-:plan2 a gps:Plan;
-  gps:actions "buy_pass_brussels -> drive_bru_liege -> drive_liege_aachen -> shuttle_aachen_cologne";
-  gps:duration 220.0; gps:cost 0.058; gps:belief 0.973201; gps:comfort 0.889337;
-  gps:finalCity "Cologne"; gps:finalBattery "low"; gps:finalPass "yes"; gps:fuelRemaining 4;
-  gps:rank 2.
-:plan3 a gps:Plan;
-  gps:actions "buy_pass_brussels -> drive_bru_liege -> drive_liege_aachen -> fast_charge_aachen_pass -> premium_corridor_aachen_cologne";
-  gps:duration 220.0; gps:cost 0.063; gps:belief 0.953737; gps:comfort 0.880398;
-  gps:finalCity "Cologne"; gps:finalBattery "low"; gps:finalPass "yes"; gps:fuelRemaining 3;
-  gps:rank 3.
-:plan4 a gps:Plan;
-  gps:actions "drive_bru_liege -> buy_pass_liege -> drive_liege_aachen -> shuttle_aachen_cologne";
-  gps:duration 225.0; gps:cost 0.057; gps:belief 0.969304; gps:comfort 0.880354;
-  gps:finalCity "Cologne"; gps:finalBattery "low"; gps:finalPass "yes"; gps:fuelRemaining 4;
-  gps:rank 4.
-:plan5 a gps:Plan;
-  gps:actions "drive_bru_liege -> buy_pass_liege -> drive_liege_aachen -> fast_charge_aachen_pass -> premium_corridor_aachen_cologne";
-  gps:duration 225.0; gps:cost 0.062; gps:belief 0.949918; gps:comfort 0.871505;
-  gps:finalCity "Cologne"; gps:finalBattery "low"; gps:finalPass "yes"; gps:fuelRemaining 3;
-  gps:rank 5.
-
-:PlanSet :acceptableCount 8; :fuelBudget 8.
-
-{
-  ?Plan a gps:Plan; gps:duration ?Dur; gps:cost ?Cost; gps:belief ?Bel.
-  :Thresholds :minBelief ?MinBel; :maxCost ?MaxCost; :maxDuration ?MaxDur.
-  ?Bel math:greaterThan ?MinBel.
-  ?Cost math:lessThan ?MaxCost.
-  ?Dur math:lessThan ?MaxDur.
-} => {
-  ?Plan gps:acceptable true.
-}.
-
-{
-  :plan1 gps:acceptable true; gps:rank 1.
-} => {
-  :PlanSet :selected :plan1.
-}.
-
-{ 1 log:notIncludes { :PlanSet :selected :plan1. }. } => false.
-
-{
-  :PlanSet :selected ?Plan; :acceptableCount ?Acceptable; :fuelBudget ?FuelBudget.
-  ?Plan gps:actions ?Actions; gps:duration ?Duration; gps:cost ?Cost; gps:belief ?Belief; gps:comfort ?Comfort;
-    gps:finalCity ?City; gps:finalBattery ?Battery; gps:finalPass ?Pass; gps:fuelRemaining ?FuelRemaining.
-  :plan2 gps:actions ?Actions2; gps:duration ?Duration2; gps:cost ?Cost2; gps:belief ?Belief2; gps:comfort ?Comfort2; gps:finalCity ?City2; gps:finalBattery ?Battery2; gps:finalPass ?Pass2.
-  :plan3 gps:actions ?Actions3; gps:duration ?Duration3; gps:cost ?Cost3; gps:belief ?Belief3; gps:comfort ?Comfort3; gps:finalCity ?City3; gps:finalBattery ?Battery3; gps:finalPass ?Pass3.
-  :plan4 gps:actions ?Actions4; gps:duration ?Duration4; gps:cost ?Cost4; gps:belief ?Belief4; gps:comfort ?Comfort4; gps:finalCity ?City4; gps:finalBattery ?Battery4; gps:finalPass ?Pass4.
-  :plan5 gps:actions ?Actions5; gps:duration ?Duration5; gps:cost ?Cost5; gps:belief ?Belief5; gps:comfort ?Comfort5; gps:finalCity ?City5; gps:finalBattery ?Battery5; gps:finalPass ?Pass5.
-  ("=== Answer ===\nSelect plan : %s.\nroute result : %s battery=%s pass=%s\nduration : %.1f minutes\ncost : %.3f\nbelief : %.6f\ncomfort : %.6f\nacceptable plans : %d\nfuel remaining : %d of %d\n\n=== Explanation ===\nThe planner starts with car1 at Brussels, battery=high, pass=none, then composes action descriptions until the goal city Cologne is reached. Duration and cost are summed across each candidate; belief and comfort are multiplied, matching the N3 planner pattern. The selected plan is the fastest acceptable candidate under belief > 0.93, cost < 0.090, and duration < 260.0. It uses the shuttle from Aachen to Cologne, avoiding an extra charge stop while keeping belief at 0.974175.\n\nTop acceptable plans:\n1. %s | duration=%.1f cost=%.3f belief=%.6f comfort=%.6f final=%s/%s/%s\n2. %s | duration=%.1f cost=%.3f belief=%.6f comfort=%.6f final=%s/%s/%s\n3. %s | duration=%.1f cost=%.3f belief=%.6f comfort=%.6f final=%s/%s/%s\n4. %s | duration=%.1f cost=%.3f belief=%.6f comfort=%.6f final=%s/%s/%s\n5. %s | duration=%.1f cost=%.3f belief=%.6f comfort=%.6f final=%s/%s/%s" ?Actions ?City ?Battery ?Pass ?Duration ?Cost ?Belief ?Comfort ?Acceptable ?FuelRemaining ?FuelBudget ?Actions ?Duration ?Cost ?Belief ?Comfort ?City ?Battery ?Pass ?Actions2 ?Duration2 ?Cost2 ?Belief2 ?Comfort2 ?City2 ?Battery2 ?Pass2 ?Actions3 ?Duration3 ?Cost3 ?Belief3 ?Comfort3 ?City3 ?Battery3 ?Pass3 ?Actions4 ?Duration4 ?Cost4 ?Belief4 ?Comfort4 ?City4 ?Battery4 ?Pass4 ?Actions5 ?Duration5 ?Cost5 ?Belief5 ?Comfort5 ?City5 ?Battery5 ?Pass5) string:format ?Block.
-} => {
-  :evRoadtripPlanner log:outputString ?Block.
-  :evRoadtripPlanner :selects :plan1.
-}.
-
-{ :evRoadtripPlanner :selects ?Plan } log:query { :evRoadtripPlanner :selects ?Plan }.

package/see/examples/n3/existential_rule.n3

@@ -1,10 +0,0 @@
-# ================
-# Existential rule
-# ================
-@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
-@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
-
-:Socrates a :Human.
-:Plato a :Human.
-
-{ ?S a :Human. } => { ?S :is _:B. }.

package/see/examples/n3/expression_eval.n3

@@ -1,21 +0,0 @@
-# ==============================================================================
-# A tiny expression evaluator in N3
-# ==============================================================================
-@prefix math: <http://www.w3.org/2000/10/swap/math#>.
-@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
-
-:n2 :n 2.
-:n3 :n 3.
-:n10 :n 10.
-:n4 :n 4.
-:eMul a :Expr; :op :mul; :left :n2; :right :n3.
-:eSub a :Expr; :op :sub; :left :n10; :right :n4.
-:eAdd a :Expr; :op :add; :left :eMul; :right :eSub.
-:Root :expr :eAdd.
-
-{ ?N :value ?V. } <= { ?N :n ?V. }.
-{ ?E :value ?V. } <= { ?E :op :add. ?E :left ?L. ?E :right ?R. ?L :value ?LV. ?R :value ?RV. (?LV ?RV) math:sum ?V. }.
-{ ?E :value ?V. } <= { ?E :op :sub. ?E :left ?L. ?E :right ?R. ?L :value ?LV. ?R :value ?RV. (?LV ?RV) math:difference ?V. }.
-{ ?E :value ?V. } <= { ?E :op :mul. ?E :left ?L. ?E :right ?R. ?L :value ?LV. ?R :value ?RV. (?LV ?RV) math:product ?V. }.
-
-{ :Root :expr ?E. ?E :value ?V. } => { :Root :result ?V. }.

package/see/examples/n3/family_cousins.n3

@@ -1,62 +0,0 @@
-# ==============
-# Family cousins
-# ==============
-
-@prefix : <http://example.org/family#>.
-@prefix math: <http://www.w3.org/2000/10/swap/math#>.
-
-# --------------------------
-# Data (a small family tree)
-# --------------------------
-
-:Adam :parentOf :Bob, :Carol .
-:Bob :parentOf :Dave, :Eve .
-:Carol :parentOf :Frank, :Grace .
-:Dave :parentOf :Heidi .
-:Eve :parentOf :Ivan .
-:Frank :parentOf :Judy .
-
-# Seed "branch" labels at generation 2 (so gen-1 siblings won't become cousins)
-:Dave :branch :b .
-:Eve :branch :b .
-:Frank :branch :c .
-:Grace :branch :c .
-
-# Declare branch difference (so we can avoid any inequality built-in)
-:b :differentFrom :c .
-:c :differentFrom :b .
-
-# -----------------------------------
-# Rules (generation, branch, cousins)
-# -----------------------------------
-
-# Root generation
-{ } => { :Adam :generation 0 } .
-
-# Generation propagation: child.gen = parent.gen + 1
-{
- ?P :parentOf ?C .
- ?P :generation ?G .
- (?G 1) math:sum ?G1 .
-} => {
- ?C :generation ?G1 .
-} .
-
-# Branch propagation: child.branch = parent.branch
-{
- ?P :parentOf ?C .
- ?P :branch ?B .
-} => {
- ?C :branch ?B .
-} .
-
-# Cousins: same generation, different branch
-{
- ?X :generation ?G .
- ?Y :generation ?G .
- ?X :branch ?BX .
- ?Y :branch ?BY .
- ?BX :differentFrom ?BY .
-} => {
- ?X :cousin ?Y .
-} .

package/see/examples/n3/fastpow.n3

@@ -1,56 +0,0 @@
-# ========================
-# Fast exponentiation demo
-# ========================
-@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#>.
-
-# Fast power via builtin
-{ (?B ?E) :pow ?R. } <= { (?B ?E) math:exponentiation ?R. }.
-
-# Slow power via repeated multiply
-{ (?B 0) :powSlow 1. } <= { 0 math:equalTo 0. }.
-{ (?B ?E) :powSlow ?R. } <= {
-  ?E math:greaterThan 0.
-  (?E 1) math:difference ?E1.
-  (?B ?E1) :powSlow ?Prev.
-  (?Prev ?B) math:product ?R.
-}.
-
-# Power tower using :pow
-{ (?B 0) :tower 1. } <= { 0 math:equalTo 0. }.
-{ (?B ?H) :tower ?R. } <= {
-  ?H math:greaterThan 0.
-  (?H 1) math:difference ?H1.
-  (?B ?H1) :tower ?Prev.
-  (?B ?Prev) math:exponentiation ?R.
-}.
-
-# Projection helpers to keep output small
-{ (?B ?E) :powMod1e6 ?M. } <= {
-  (?B ?E) :pow ?R.
-  (?R 1000000) math:remainder ?M.
-}.
-{ (?B ?H) :towerMod1e6 ?M. } <= {
-  (?B ?H) :tower ?R.
-  (?R 1000000) math:remainder ?M.
-}.
-
-# test
-{
-  (2 10) :pow ?P10.
-  (2 10) :powSlow ?S10.
-  (2 10000) :powMod1e6 ?M1.
-  (3 10000) :powMod1e6 ?M2.
-  (2 4) :tower ?T4.
-  (2 5) :towerMod1e6 ?TM5.
-} => {
-  :test :is {
-    (2 10) :pow ?P10.
-    (2 10) :powSlow ?S10.
-    (2 10000) :powMod1e6 ?M1.
-    (3 10000) :powMod1e6 ?M2.
-    (2 4) :tower ?T4.
-    (2 5) :towerMod1e6 ?TM5.
-  }.
-}.

package/see/examples/n3/fibonacci.n3

@@ -1,44 +0,0 @@
-# =======================
-# Fibonacci Example (Big)
-# =======================
-# N3-compiled version of the exact Fibonacci example. The target and sample indices are represented as formal TriG input
-# evidence when this source is compiled.
-
-@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#>.
-
-:Run
-  :target 10000;
-  :sampleIndex 0, 1, 2, 10, 100, 1000, 10000;
-  :method :bigIntegerRecurrence.
-
-:bigIntegerRecurrence
-  :baseCase "F(0)=0";
-  :baseCase "F(1)=1";
-  :stepRule "F(n)=F(n-1)+F(n-2)".
-
-:Sample0 :index 0; :value "0".
-:Sample1 :index 1; :value "1".
-:Sample2 :index 2; :value "1".
-:Sample10 :index 10; :value "55".
-:Sample100 :index 100; :value "354224848179261915075".
-:Sample1000 :index 1000; :digits 209.
-:Sample10000 :index 10000; :digits 2090; :value "33644764876431783266621612005107543310302148460680063906564769974680081442166662368155595513633734025582065332680836159373734790483865268263040892463056431887354544369559827491606602099884183933864652731300088830269235673613135117579297437854413752130520504347701602264758318906527890855154366159582987279682987510631200575428783453215515103870818298969791613127856265033195487140214287532698187962046936097879900350962302291026368131493195275630227837628441540360584402572114334961180023091208287046088923962328835461505776583271252546093591128203925285393434620904245248929403901706233888991085841065183173360437470737908552631764325733993712871937587746897479926305837065742830161637408969178426378624212835258112820516370298089332099905707920064367426202389783111470054074998459250360633560933883831923386783056136435351892133279732908133732642652633989763922723407882928177953580570993691049175470808931841056146322338217465637321248226383092103297701648054726243842374862411453093812206564914032751086643394517512161526545361333111314042436854805106765843493523836959653428071768775328348234345557366719731392746273629108210679280784718035329131176778924659089938635459327894523777674406192240337638674004021330343297496902028328145933418826817683893072003634795623117103101291953169794607632737589253530772552375943788434504067715555779056450443016640119462580972216729758615026968443146952034614932291105970676243268515992834709891284706740862008587135016260312071903172086094081298321581077282076353186624611278245537208532365305775956430072517744315051539600905168603220349163222640885248852433158051534849622434848299380905070483482449327453732624567755879089187190803662058009594743150052402532709746995318770724376825907419939632265984147498193609285223945039707165443156421328157688908058783183404917434556270520223564846495196112460268313970975069382648706613264507665074611512677522748621598642530711298441182622661057163515069260029861704945425047491378115154139941550671256271197133252763631939606902895650288268608362241082050562430701794976171121233066073310059947366875".
-
-{
-  :Run :target 10000; :sampleIndex 0, 1, 2, 10, 100, 1000, 10000; :method :bigIntegerRecurrence.
-  :Sample10000 :value ?Value; :digits 2090.
-  ("=== Answer ===
-The Fibonacci number for index 10000 is:
-%s
-
-=== 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.
-" ?Value) string:format ?Block.
-} => {
-  :fibonacciExample log:outputString ?Block.
-  :fibonacciExample :certifies :Sample10000.
-}.
-
-{ :fibonacciExample :certifies ?Sample } log:query { :fibonacciExample :certifies ?Sample }.

package/see/examples/n3/french_cities.n3

@@ -1,28 +0,0 @@
-# French cities — graph path traversal.
-# Based on the EYE reasoning/graph example: graph.axiom.n3 plus graph.filter.n3.
-# It asks whether Paris can reach Nantes by following one-way links, using a
-# subproperty rule and a transitive-property rule.
-@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#>.
-
-:paris :oneway :orleans.
-:paris :oneway :chartres.
-:paris :oneway :amiens.
-:orleans :oneway :blois.
-:orleans :oneway :bourges.
-:blois :oneway :tours.
-:chartres :oneway :lemans.
-:lemans :oneway :angers.
-:lemans :oneway :tours.
-:angers :oneway :nantes.
-
-:oneway rdfs:subPropertyOf :path.
-:path rdf:type owl:TransitiveProperty.
-
-{ ?P rdfs:subPropertyOf ?R. ?S ?P ?O. } => { ?S ?R ?O. }.
-{ ?P rdf:type owl:TransitiveProperty. ?X ?P ?O. ?S ?P ?X. } => { ?S ?P ?O. }.
-
-{ :paris :path :nantes. } log:query { :paris :path :nantes. }.

package/see/examples/n3/fundamental_theorem_arithmetic.n3

@@ -1,84 +0,0 @@
-# ============================================================================
-# Fundamental Theorem Arithmetic
-# ============================================================================
-# N3-compiled version of the hand-written SEE example. The primary case mirrors
-# Eyeling's fundamental-theorem-arithmetic.n3: n = 202692987 is validated against
-# the factorization 3^2 * 7 * 829 * 3881. Extra sample summaries are kept as
-# data so the SEE report still documents the larger regression set.
-
-@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#>.
-
-:Case
-  :n 202692987;
-  :factors (3 3 7 829 3881);
-  :flatFactorString "3 * 3 * 7 * 829 * 3881";
-  :primePowerString "3^2 * 7 * 829 * 3881";
-  :largestFlatFactorString "3881 * 829 * 7 * 3 * 3";
-  :sortedComparison "3 * 3 * 7 * 829 * 3881";
-  :smallestTrace "  202692987 = 3 * 67564329\n  67564329 = 3 * 22521443\n  22521443 = 7 * 3217349\n  3217349 = 829 * 3881\n  3881 is prime".
-
-:SampleSummary
-  :sampleCount 6;
-  :largestSample 600851475143;
-  :totalFactorsWithMultiplicity 31;
-  :distinctPrimesSeen 17;
-  :sampleBlock "  360360 = 2^3 * 3^2 * 5 * 7 * 11 * 13\n  202692987 = 3^2 * 7 * 829 * 3881\n  4294967295 = 3 * 5 * 17 * 257 * 65537\n  600851475143 = 71 * 839 * 1471 * 6857\n  9876543210 = 2 * 3^2 * 5 * 17^2 * 379721\n  9999999967 = 9999999967".
-
-# Product reconstruction and uniqueness-up-to-order are validated by rules.
-{
-  :Case :n ?N; :factors ?Factors.
-  ?Factors math:product ?Product.
-  ?Product math:equalTo ?N.
-} => {
-  :Case :reconstructsProduct true.
-}.
-
-{
-  :Case :factors ?Factors.
-  ?Factors list:reverse ?Reverse.
-  ?Factors list:sort ?SortedA.
-  ?Reverse list:sort ?SortedB.
-  ?SortedA log:equalTo ?SortedB.
-} => {
-  :Case :uniqueUpToOrder true.
-}.
-
-# Distinct factors are asserted and validated as prime witnesses for this concrete case.
-3 :primeWitness true.
-7 :primeWitness true.
-829 :primeWitness true.
-3881 :primeWitness true.
-
-{
-  3 :primeWitness true.
-  7 :primeWitness true.
-  829 :primeWitness true.
-  3881 :primeWitness true.
-} => {
-  :Case :allDistinctFactorsPrime true.
-}.
-
-# Fuses keep the authored report tied to the validated facts.
-{ 1 log:notIncludes { :Case :reconstructsProduct true. }. } => false.
-{ 1 log:notIncludes { :Case :uniqueUpToOrder true. }. } => false.
-{ 1 log:notIncludes { :Case :allDistinctFactorsPrime true. }. } => false.
-
-{
-  :Case :n ?N; :flatFactorString ?Flat; :primePowerString ?PrimePower;
-    :largestFlatFactorString ?LargestFlat; :sortedComparison ?Sorted;
-    :smallestTrace ?Trace.
-  :SampleSummary :sampleCount ?SampleCount; :largestSample ?LargestSample;
-    :totalFactorsWithMultiplicity ?TotalFactors; :distinctPrimesSeen ?Distinct;
-    :sampleBlock ?SampleBlock.
-  :Case :reconstructsProduct true; :uniqueUpToOrder true; :allDistinctFactorsPrime true.
-  ("=== Answer ===\nPrimary N3 case: n = %d has prime factors %s.\nprimary prime-power form : %s\nsample count : %d\nlargest sample : %d\ntotal prime factors counted with multiplicity : %d\ndistinct primes seen across samples : %d\n\nSample factorizations:\n%s\n\n=== Explanation ===\nExistence 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.\n\nSmallest-divisor trace for the N3 source number:\n%s\n\nUniqueness 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.\n  source smallest-first factors : %s\n  source largest-first factors : %s\n  source sorted comparison : %s\n\nThe additional samples cover repeated small factors, special products, large composites, and a larger prime that has no smaller divisor." ?N ?Flat ?PrimePower ?SampleCount ?LargestSample ?TotalFactors ?Distinct ?SampleBlock ?Trace ?Flat ?LargestFlat ?Sorted) string:format ?Block.
-} => {
-  :fundamentalTheoremArithmetic log:outputString ?Block.
-  :fundamentalTheoremArithmetic :demonstrates :Existence, :UniquenessUpToOrder, :PrimeWitnesses.
-}.
-
-{ :fundamentalTheoremArithmetic :demonstrates ?Feature } log:query { :fundamentalTheoremArithmetic :demonstrates ?Feature }.

package/see/examples/n3/goldbach_1000.n3

@@ -1,66 +0,0 @@
-# ==============
-# Goldbach 1000
-# ==============
-# N3-compiled version of the bounded Goldbach SEE example. It keeps the bounded
-# result as committed data and uses rules to verify the representative witness
-# equations that are shown in the report.
-
-@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#>.
-
-:BoundedRun
-  :minEven 4;
-  :maxEven 1000;
-  :evenCount 499;
-  :counterexamples 0;
-  :sampleWitnesses "4=2+2; 28=5+23; 100=3+97; 998=7+991; 1000=3+997".
-
-:w4 :even 4; :p 2; :q 2.
-:w28 :even 28; :p 5; :q 23.
-:w100 :even 100; :p 3; :q 97.
-:w998 :even 998; :p 7; :q 991.
-:w1000 :even 1000; :p 3; :q 997.
-
-2 :prime true.
-3 :prime true.
-5 :prime true.
-7 :prime true.
-23 :prime true.
-97 :prime true.
-991 :prime true.
-997 :prime true.
-
-{
-  ?Witness :even ?E; :p ?P; :q ?Q.
-  ?P :prime true.
-  ?Q :prime true.
-  (?P ?Q) math:sum ?E.
-} => {
-  ?Witness :verifiedGoldbachWitness true.
-}.
-
-{
-  :w4 :verifiedGoldbachWitness true.
-  :w28 :verifiedGoldbachWitness true.
-  :w100 :verifiedGoldbachWitness true.
-  :w998 :verifiedGoldbachWitness true.
-  :w1000 :verifiedGoldbachWitness true.
-  :BoundedRun :counterexamples 0.
-} => {
-  :BoundedRun :boundedGoldbachCondition true.
-}.
-
-{ 1 log:notIncludes { :BoundedRun :boundedGoldbachCondition true. }. } => false.
-
-{
-  :BoundedRun :minEven ?Min; :maxEven ?Max; :evenCount ?Count;
-    :sampleWitnesses ?Samples; :boundedGoldbachCondition true.
-  ("=== Answer ===\nAll %d even integers from %d through %d have a Goldbach witness.\nsample witnesses : %s\n\n=== Explanation ===\nThe 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." ?Count ?Min ?Max ?Samples) string:format ?Block.
-} => {
-  :goldbach1000 log:outputString ?Block.
-  :goldbach1000 :demonstrates :BoundedGoldbachEvidence.
-}.
-
-{ :goldbach1000 :demonstrates ?Feature } log:query { :goldbach1000 :demonstrates ?Feature }.

package/see/examples/n3/good_cobbler.n3

@@ -1,10 +0,0 @@
-# ========================================================================
-# Good cobbler
-# Example from https://shs.hal.science/halshs-04148373/document
-# Using term logic http://intrologic.stanford.edu/chapters/chapter_11.html
-# ========================================================================
-@prefix : <https://eyereasoner.github.io/see/examples/good-cobbler#>.
-# joe is a good cobbler
-:joe :is (:good :Cobbler).
-# is there some x which is good at some y
-{ ?X :is (:good ?Y). } => { :test :is { ?X :is (:good ?Y) }. }.