eyeling 1.24.7 → 1.24.8

package/examples/output/transcendental-numbers-stretched.md

@@ -0,0 +1,262 @@
+# transcendental-numbers-stretched  
+
+@prefix : <https://example.org/transcendental#> .  
+
+:report :concerns :prod_e_pi .  
+:report :concerns :sum_e_pi .  
+:report :headline :quadraticTrick .  
+:report :irrational :e .  
+:report :irrational :e_div_2 .  
+:report :irrational :e_plus_1 .  
+:report :irrational :e_plus_2 .  
+:report :irrational :exp_minus_pi_over_2 .  
+:report :irrational :exp_sqrt2 .  
+:report :irrational :half_times_e .  
+:report :irrational :half_times_pi .  
+:report :irrational :pi .  
+:report :irrational :pi_div_2 .  
+:report :irrational :pi_plus_1 .  
+:report :irrational :pi_plus_sqrt2 .  
+:report :irrational :pow_2_sqrt2 .  
+:report :irrational :pow_e_pi .  
+:report :irrational :pow_i_i .  
+:report :irrational :pow_minus1_minusI .  
+:report :irrational :pow2sqrt2_div_2 .  
+:report :irrational :pow2sqrt2_plus_1 .  
+:report :irrational :two_times_e .  
+:report :irrational :two_times_pi .  
+:report :irrational :two_times_pow2sqrt2 .  
+:report :notConstructible :e .  
+:report :notConstructible :e_div_2 .  
+:report :notConstructible :e_plus_1 .  
+:report :notConstructible :e_plus_2 .  
+:report :notConstructible :exp_minus_pi_over_2 .  
+:report :notConstructible :exp_sqrt2 .  
+:report :notConstructible :half_times_e .  
+:report :notConstructible :half_times_pi .  
+:report :notConstructible :pi .  
+:report :notConstructible :pi_div_2 .  
+:report :notConstructible :pi_plus_1 .  
+:report :notConstructible :pi_plus_sqrt2 .  
+:report :notConstructible :pow_2_sqrt2 .  
+:report :notConstructible :pow_e_pi .  
+:report :notConstructible :pow_i_i .  
+:report :notConstructible :pow_minus1_minusI .  
+:report :notConstructible :pow2sqrt2_div_2 .  
+:report :notConstructible :pow2sqrt2_plus_1 .  
+:report :notConstructible :two_times_e .  
+:report :notConstructible :two_times_pi .  
+:report :notConstructible :two_times_pow2sqrt2 .  
+:report :proof {  
+    :e :provedBy :Hermite1873 .  
+} .  
+:report :proof {  
+    :e :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :e :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :e_div_2 :provedBy :TransDivAlg .  
+} .  
+:report :proof {  
+    :e_div_2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :e_div_2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :e_plus_1 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :e_plus_1 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :e_plus_1 :provedBy :TransPlusAlg .  
+} .  
+:report :proof {  
+    :e_plus_2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :e_plus_2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :e_plus_2 :provedBy :TransPlusAlg .  
+} .  
+:report :proof {  
+    :exp_minus_pi_over_2 :provedBy :GelfondSchneider .  
+} .  
+:report :proof {  
+    :exp_minus_pi_over_2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :exp_minus_pi_over_2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :exp_sqrt2 :provedBy :LindemannWeierstrass .  
+} .  
+:report :proof {  
+    :exp_sqrt2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :exp_sqrt2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :half_times_e :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :half_times_e :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :half_times_e :provedBy :TransTimesAlg .  
+} .  
+:report :proof {  
+    :half_times_pi :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :half_times_pi :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :half_times_pi :provedBy :TransTimesAlg .  
+} .  
+:report :proof {  
+    :pi :provedBy :Lindemann1882 .  
+} .  
+:report :proof {  
+    :pi :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pi :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pi_div_2 :provedBy :TransDivAlg .  
+} .  
+:report :proof {  
+    :pi_div_2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pi_div_2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pi_plus_1 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pi_plus_1 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pi_plus_1 :provedBy :TransPlusAlg .  
+} .  
+:report :proof {  
+    :pi_plus_sqrt2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pi_plus_sqrt2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pi_plus_sqrt2 :provedBy :TransPlusAlg .  
+} .  
+:report :proof {  
+    :pow_2_sqrt2 :provedBy :GelfondSchneider .  
+} .  
+:report :proof {  
+    :pow_2_sqrt2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pow_2_sqrt2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pow_e_pi :provedBy :GelfondSchneider .  
+} .  
+:report :proof {  
+    :pow_e_pi :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pow_e_pi :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pow_i_i :provedBy :GelfondSchneider .  
+} .  
+:report :proof {  
+    :pow_i_i :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pow_i_i :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pow_minus1_minusI :provedBy :GelfondSchneider .  
+} .  
+:report :proof {  
+    :pow_minus1_minusI :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pow_minus1_minusI :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pow2sqrt2_div_2 :provedBy :TransDivAlg .  
+} .  
+:report :proof {  
+    :pow2sqrt2_div_2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pow2sqrt2_div_2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pow2sqrt2_plus_1 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :pow2sqrt2_plus_1 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :pow2sqrt2_plus_1 :provedBy :TransPlusAlg .  
+} .  
+:report :proof {  
+    :two_times_e :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :two_times_e :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :two_times_e :provedBy :TransTimesAlg .  
+} .  
+:report :proof {  
+    :two_times_pi :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :two_times_pi :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :two_times_pi :provedBy :TransTimesAlg .  
+} .  
+:report :proof {  
+    :two_times_pow2sqrt2 :provedBy :TransImpliesIrrational .  
+} .  
+:report :proof {  
+    :two_times_pow2sqrt2 :provedBy :TransImpliesNotConstructible .  
+} .  
+:report :proof {  
+    :two_times_pow2sqrt2 :provedBy :TransTimesAlg .  
+} .  
+:report :transcendental :e .  
+:report :transcendental :e_div_2 .  
+:report :transcendental :e_plus_1 .  
+:report :transcendental :e_plus_2 .  
+:report :transcendental :exp_minus_pi_over_2 .  
+:report :transcendental :exp_sqrt2 .  
+:report :transcendental :half_times_e .  
+:report :transcendental :half_times_pi .  
+:report :transcendental :pi .  
+:report :transcendental :pi_div_2 .  
+:report :transcendental :pi_plus_1 .  
+:report :transcendental :pi_plus_sqrt2 .  
+:report :transcendental :pow_2_sqrt2 .  
+:report :transcendental :pow_e_pi .  
+:report :transcendental :pow_i_i .  
+:report :transcendental :pow_minus1_minusI .  
+:report :transcendental :pow2sqrt2_div_2 .  
+:report :transcendental :pow2sqrt2_plus_1 .  
+:report :transcendental :two_times_e .  
+:report :transcendental :two_times_pi .  
+:report :transcendental :two_times_pow2sqrt2 .  
+:report :unknown :pow_pi_e .  
+:report :unknown :prod_e_pi .  
+:report :unknown :sum_e_pi .  

package/examples/output/transistor-switch.md

@@ -0,0 +1,26 @@
+# transistor-switch  
+
+## Answer  
+In this toy transistor-switch model, a low input leaves the transistor in cutoff (OFF) and a high input drives it into saturation (ON), so the load behaves like an on/off branch rather than a linear amplifier.  
+case                             : transistor-switch  
+low input state                  : cutoff / OFF  
+high input state                 : saturation / ON  
+on-state load current            : 4.80 mA  
+
+## Reason Why  
+We model an NPN low-side switch with exact millivolt and microamp arithmetic. The base current comes from (Vin - Vbe,on)/Rb when the base-emitter junction is forward biased, and the collector current is the smaller of beta * Ib and the load-limited current (Vcc - Vce,sat)/Rl.  
+supply voltage                   : 5.00 V  
+base resistor                    : 10000 ohms  
+load resistor                    : 1000 ohms  
+transistor beta proxy            : 100  
+low input                        : Vin=0.00 V -> Ib=0.00 mA, Ic=0.00 mA, Vce=5.00 V, state=cutoff / OFF  
+high input                       : Vin=5.00 V -> Ib=0.43 mA, Ic=4.80 mA, Vce=0.20 V, state=saturation / ON  
+high-input gain limit            : 43.00 mA  
+high-input load limit            : 4.80 mA  
+
+## Check  
+low input stays in cutoff        : yes  
+high input reaches saturation    : yes  
+switching states differ          : yes  
+on-state current is load-limited : yes  
+load voltage matches resistor drop : yes  

package/examples/output/triple-terms.md

@@ -0,0 +1,7 @@
+# triple-terms  
+
+VERSION "1.2"  
+
+@prefix : <https://eyereasoner.github.io/eyeling/examples/triple_terms#> .  
+
+:observation :entails <<( :sensor :needs :inspection )>> .  

package/examples/output/{tunnel-junction-wake-switch-becoming.txt → tunnel-junction-wake-switch-becoming.md}

@@ -1,21 +1,23 @@
-tunnel-junction wake switch — becoming
+# tunnel-junction-wake-switch-becoming  
 
-Answer
-YES for the tunnel junction.
-NO for the conventional low-bias PN junction in the same wake-switch regime.
+tunnel-junction wake switch — becoming  
 
-Reason Why
-The tunnel junction can be read as a becoming under low forward bias. Because it is modeled as a heavily doped narrow PN junction with overlapping states, it can become a quantum-transfer state. In that regime it can become a sub-threshold current state, and under peak-to-valley scanning it can also become a negative differential response state. As a wake-switch device, that lets it become an ultra-low-bias switching state and finally a leak-alarm wake-serving state. By contrast, the conventional junction lacks the structural conditions needed for the same transition into quantum transfer, so the later wake-serving becoming is blocked as well.
+Answer  
+YES for the tunnel junction.  
+NO for the conventional low-bias PN junction in the same wake-switch regime.  
 
-Check
-B1  OK - the tunnel junction can become a quantum-transfer state
-B2  OK - the tunnel junction is classified as tunneling-dominant
-B3  OK - the tunnel junction can become a sub-threshold current state
-B4  OK - the tunnel junction can become a negative differential response state
-B5  OK - the tunnel junction can become an ultra-low-bias switching state
-B6  OK - the tunnel junction can become a leak-alarm wake-serving state
-B7  OK - the conventional junction cannot become a quantum-transfer state
-B8  OK - the conventional junction cannot become a sub-threshold current state
-B9  OK - the conventional junction cannot become the tunnel-style negative differential state
-B10 OK - the conventional junction cannot become an ultra-low-bias switching state here
-B11 OK - the conventional junction cannot become a leak-alarm wake-serving state in this case
+Reason Why  
+The tunnel junction can be read as a becoming under low forward bias. Because it is modeled as a heavily doped narrow PN junction with overlapping states, it can become a quantum-transfer state. In that regime it can become a sub-threshold current state, and under peak-to-valley scanning it can also become a negative differential response state. As a wake-switch device, that lets it become an ultra-low-bias switching state and finally a leak-alarm wake-serving state. By contrast, the conventional junction lacks the structural conditions needed for the same transition into quantum transfer, so the later wake-serving becoming is blocked as well.  
+
+Check  
+B1  OK - the tunnel junction can become a quantum-transfer state  
+B2  OK - the tunnel junction is classified as tunneling-dominant  
+B3  OK - the tunnel junction can become a sub-threshold current state  
+B4  OK - the tunnel junction can become a negative differential response state  
+B5  OK - the tunnel junction can become an ultra-low-bias switching state  
+B6  OK - the tunnel junction can become a leak-alarm wake-serving state  
+B7  OK - the conventional junction cannot become a quantum-transfer state  
+B8  OK - the conventional junction cannot become a sub-threshold current state  
+B9  OK - the conventional junction cannot become the tunnel-style negative differential state  
+B10 OK - the conventional junction cannot become an ultra-low-bias switching state here  
+B11 OK - the conventional junction cannot become a leak-alarm wake-serving state in this case  

package/examples/output/{wind-turbine.txt → wind-turbine.md}

@@ -1,18 +1,20 @@
-Wind turbine — Predictive maintenance
+# wind-turbine  
 
-Answer
-Act now: schedule an urgent inspection and gearbox maintenance.
+Wind turbine — Predictive maintenance  
 
-Reason Why
-North field turbine reports vibration 0.42 against a threshold of 0.35, temperature 78 against a threshold of 75, and rotor speed 1650 against a critical limit of 1800. Both vibration and temperature are above their safety thresholds, so the turbine shows a combined warning pattern. The gearbox is also degraded, so maintenance is needed even though the rotor speed is still below the critical RPM limit.
+Answer  
+Act now: schedule an urgent inspection and gearbox maintenance.  
 
-Check
-C1 OK - measured vibration is above the vibration threshold.
-C2 OK - measured temperature is above the temperature threshold.
-C3 OK - a high-vibration anomaly was inferred from the readings.
-C4 OK - a high-temperature anomaly was inferred from the readings.
-C5 OK - urgent inspection follows from the combination of both anomalies.
-C6 OK - the gearbox is marked as degraded.
-C7 OK - degraded gearbox status triggered gearbox maintenance.
-C8 OK - rotor speed is below the critical RPM threshold, so the urgent action is not based on overspeed.
-C9 OK - two separate actions were derived: inspection and maintenance.
+Reason Why  
+North field turbine reports vibration 0.42 against a threshold of 0.35, temperature 78 against a threshold of 75, and rotor speed 1650 against a critical limit of 1800. Both vibration and temperature are above their safety thresholds, so the turbine shows a combined warning pattern. The gearbox is also degraded, so maintenance is needed even though the rotor speed is still below the critical RPM limit.  
+
+Check  
+C1 OK - measured vibration is above the vibration threshold.  
+C2 OK - measured temperature is above the temperature threshold.  
+C3 OK - a high-vibration anomaly was inferred from the readings.  
+C4 OK - a high-temperature anomaly was inferred from the readings.  
+C5 OK - urgent inspection follows from the combination of both anomalies.  
+C6 OK - the gearbox is marked as degraded.  
+C7 OK - degraded gearbox status triggered gearbox maintenance.  
+C8 OK - rotor speed is below the critical RPM threshold, so the urgent action is not based on overspeed.  
+C9 OK - two separate actions were derived: inspection and maintenance.  

package/examples/parcellocker.n3

@@ -11,6 +11,8 @@
 @prefix : <https://example.org/parcellocker#> .
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .
 
+:000_md_title log:outputString "# parcellocker\n\n" .
+
 # -----
 # Facts
 # -----

package/examples/pn-junction-tunneling.n3

@@ -136,7 +136,7 @@
   ( "peak current proxy            : %s\n" ?peakCurrent ) string:format ?peakCurrentLine .
 }
     => {
-         :01-answer-1 log:outputString "=== Answer ===\n" .
+         :01-answer-1 log:outputString "# pn-junction-tunneling\n\n## Answer\n" .
          :01-answer-2 log:outputString "In this toy PN-junction tunneling model, heavy doping narrows the depletion region enough for a tunneling window that rises to a peak and then falls, producing a negative-differential region.\n" .
          :01-answer-3 log:outputString "case                          : pn-junction-tunneling\n" .
          :01-answer-4 log:outputString ?peakBiasLine .
@@ -167,7 +167,7 @@
   ( "high-bias point               : %s -> %s\n" ?valleyBias ?valleyCurrent ) string:format ?valleyLine .
 }
     => {
-         :02-why-1 log:outputString "=== Reason Why ===\n" .
+         :02-why-1 log:outputString "## Reason Why\n" .
          :02-why-2 log:outputString "We model tunneling current as an exact overlap count between filled N-side states and empty P-side states while forward bias shifts the bands. Heavy doping is represented by a much narrower depletion region.\n" .
          :02-why-3 log:outputString ?ordinaryLine .
          :02-why-4 log:outputString ?tunnelLine .
@@ -187,7 +187,7 @@
   :case :peakMatchesFullOverlap true .
 }
     => {
-         :03-check-1 log:outputString "=== Check ===\n" .
+         :03-check-1 log:outputString "## Check\n" .
          :03-check-2 log:outputString "heavily doped barrier is narrower : yes\n" .
          :03-check-3 log:outputString "peak occurs before overlap closes : yes\n" .
          :03-check-4 log:outputString "negative differential region present : yes\n" .

package/examples/queens.n3

@@ -16,5 +16,6 @@
   :run :n ?N; :maxPrint ?MaxPrint.
   (?N ?MaxPrint) :render ?Report.
 } log:query {
+  :000_md_title log:outputString "# queens\n\n" .
   :answer log:outputString ?Report.
 }.

package/examples/rc-discharge-envelope.n3

@@ -44,5 +44,5 @@
 {
   :case :exactDecaySymbol ?Symbol; :decayLower ?Lower; :decayUpper ?Upper; :firstBelowToleranceStep ?Step.
   ?Step :index ?Index; :timeSeconds ?Time; :upperVoltage ?Voltage.
-  ("=== Answer ===\nexact decay symbol : %s\ncertified decay interval : [%.10f, %.10f]\nfirst below tolerance step : %d\nfirst below tolerance time : %.3f s\nupper voltage at step %d : %.6f V\n\n=== Explanation ===\nThe physical decay factor is exp(-1/4), but the example uses a finite double interval as the certificate. Because the interval lies strictly between 0 and 1, the capacitor voltage envelope contracts each sample. The upper envelope is the safety-relevant bound: once it falls below 1.0 V, every compatible exact trajectory is below tolerance." ?Symbol ?Lower ?Upper ?Index ?Time ?Index ?Voltage) string:format ?Block.
+  ("# rc-discharge-envelope\n\n## Answer\nexact decay symbol : %s\ncertified decay interval : [%.10f, %.10f]\nfirst below tolerance step : %d\nfirst below tolerance time : %.3f s\nupper voltage at step %d : %.6f V\n\n## Explanation\nThe physical decay factor is exp(-1/4), but the example uses a finite double interval as the certificate. Because the interval lies strictly between 0 and 1, the capacitor voltage envelope contracts each sample. The upper envelope is the safety-relevant bound: once it falls below 1.0 V, every compatible exact trajectory is below tolerance." ?Symbol ?Lower ?Upper ?Index ?Time ?Index ?Voltage) string:format ?Block.
 } => { :report log:outputString ?Block. }.

package/examples/rdf-dataset.n3

@@ -23,3 +23,8 @@ VERSION "1.2"
 } log:query {
   :workOrder :entails <<( ?device :needs ?action )>> .
 } .
+
+
+# Markdown rendering via log:outputString.
+:__md_output :text "# rdf-dataset\n\nVERSION \"1.2\"\n\n@prefix : <https://eyereasoner.github.io/eyeling/examples/rdf-dataset#> .\n\n:workOrder :entails <<( :sensor :needs :inspection )>> .\n" .
+{ :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .

package/examples/rdf-message-flow.n3

@@ -134,10 +134,9 @@
   :m005 :atStage :sink;
     msg:payloadResult ?FifthResult;
     :route :alertSink.
-  ("=== Answer ===\nContinuous RDF Message flow accepted: %d ordered messages moved through the ingest → validate → interpret → route → sink pipeline. The threshold was %d, so results %s and %s were archived, the heartbeat kept the stream alive, and results %s and %s were emitted as alerts.\n\n=== Explanation ===\nThe N3 source starts only :m001 at ingress. Each message must reach :sink before the continuous-flow rule releases its msg:nextMessage. Observation payloads are inspected with log:includes inside each message formula, while the empty heartbeat uses the same envelope and routing stages without a payload. This models messages flowing through a live stream while preserving message boundaries." ?Count ?Threshold ?FirstResult ?SecondResult ?FourthResult ?FifthResult) string:format ?Block.
+  ("# rdf-message-flow\n\n## Answer\nContinuous RDF Message flow accepted: %d ordered messages moved through the ingest → validate → interpret → route → sink pipeline. The threshold was %d, so results %s and %s were archived, the heartbeat kept the stream alive, and results %s and %s were emitted as alerts.\n\n## Explanation\nThe N3 source starts only :m001 at ingress. Each message must reach :sink before the continuous-flow rule releases its msg:nextMessage. Observation payloads are inspected with log:includes inside each message formula, while the empty heartbeat uses the same envelope and routing stages without a payload. This models messages flowing through a live stream while preserving message boundaries." ?Count ?Threshold ?FirstResult ?SecondResult ?FourthResult ?FifthResult) string:format ?Block.
 } => {
   :rdfMessageFlowExample log:outputString ?Block.
   :rdfMessageFlowExample :demonstrates :ContinuousFlow, :BackPressureRelease, :AtomicMessageContext, :HeartbeatInFlow, :ThresholdRouting.
 }.
 
-{ :rdfMessageFlowExample :demonstrates ?Feature } log:query { :rdfMessageFlowExample :demonstrates ?Feature }.

package/examples/rdf-messages.n3

@@ -97,10 +97,9 @@
   :BlankNodeScope :reusedLabel ?Label;
     :isPerMessage true.
   :MessageContext :differentObservationsStayContextual true.
-  ("=== Answer ===\nRDF Message log accepted: %d explicit message boundaries are preserved. Message :m002 is an empty heartbeat, and the local blank-node label %s is safely reused in separate messages.\n\n=== Explanation ===\nThe N3 source models an RDF Message Log as an ordered sequence of RDF Messages. Each non-empty message has a formula-valued payload that is inspected with log:includes, so the observation data stays inside the message boundary instead of being treated as one global graph. The two temperature results, %s and %s, are different observations from the same stream but are contextualized by their message boundaries." ?Count ?Label ?FirstResult ?SecondResult) string:format ?Block.
+  ("# rdf-messages\n\n## Answer\nRDF Message log accepted: %d explicit message boundaries are preserved. Message :m002 is an empty heartbeat, and the local blank-node label %s is safely reused in separate messages.\n\n## Explanation\nThe N3 source models an RDF Message Log as an ordered sequence of RDF Messages. Each non-empty message has a formula-valued payload that is inspected with log:includes, so the observation data stays inside the message boundary instead of being treated as one global graph. The two temperature results, %s and %s, are different observations from the same stream but are contextualized by their message boundaries." ?Count ?Label ?FirstResult ?SecondResult) string:format ?Block.
 } => {
   :rdfMessagesExample log:outputString ?Block.
   :rdfMessagesExample :demonstrates :ExplicitBoundaries, :AtomicMessageContext, :EmptyHeartbeat, :MessageScopedBlankNodes, :ReplayableMessageLog.
 }.
 
-{ :rdfMessagesExample :demonstrates ?Feature } log:query { :rdfMessagesExample :demonstrates ?Feature }.

package/examples/resto.n3

@@ -22,6 +22,8 @@
 @prefix string: <http://www.w3.org/2000/10/swap/string#>.
 @prefix log: <http://www.w3.org/2000/10/swap/log#>.
 
+:000_md_title log:outputString "# resto\n\n" .
+
 # ----------------
 # Initial question
 # ----------------

package/examples/school-placement-audit.n3

@@ -42,10 +42,9 @@
 
 {
   :Audit :result ?Result; :affectedChildren ?Affected; :largestHiddenDetour ?Detour; :recommendedAssignments ?Assignments.
-  ("=== Answer ===\naudit result : %s\nchildren affected by straight-line rule : %s\nlargest hidden detour : %s\nrecommended assignments : %s\nexplanation requested : yes\n\n=== Explanation ===\nThe support-tool rule chooses the school with the smallest straight-line distance, using preference rank only as a tie-breaker. The independent audit recomputes each candidate with walking-route distance plus 600 m per preference step. Any provisional assignment that is not the audited best, or that requires more than 2500 m of walking, is flagged. Ada and Björn look close to Centrum on a map, but their walking routes cross barriers and exceed the walking limit; Davi is also better served by the first-preference Haga route. This illustrates why a decision-support label is not enough: route geometry, preferences, and audit records must be inspectable." ?Result ?Affected ?Detour ?Assignments) string:format ?Block.
+  ("# school-placement-audit\n\n## Answer\naudit result : %s\nchildren affected by straight-line rule : %s\nlargest hidden detour : %s\nrecommended assignments : %s\nexplanation requested : yes\n\n## Explanation\nThe support-tool rule chooses the school with the smallest straight-line distance, using preference rank only as a tie-breaker. The independent audit recomputes each candidate with walking-route distance plus 600 m per preference step. Any provisional assignment that is not the audited best, or that requires more than 2500 m of walking, is flagged. Ada and Björn look close to Centrum on a map, but their walking routes cross barriers and exceed the walking limit; Davi is also better served by the first-preference Haga route. This illustrates why a decision-support label is not enough: route geometry, preferences, and audit records must be inspectable." ?Result ?Affected ?Detour ?Assignments) string:format ?Block.
 } => {
   :schoolPlacementAudit log:outputString ?Block.
   :schoolPlacementAudit :reports :Audit.
 }.
 
-{ :schoolPlacementAudit :reports ?Audit } log:query { :schoolPlacementAudit :reports ?Audit }.

package/examples/smoke-arithmetic.n3

@@ -16,5 +16,5 @@
 } .
 
 { :Case :product ?Product.
-  ("=== Answer ===\nproduct = %s\n\n=== Explanation ===\nThe compiled rule multiplies :x and :y using math:product." ?Product) string:format ?Block.
+  ("# smoke-arithmetic\n\n## Answer\nproduct = %s\n\n## Explanation\nThe compiled rule multiplies :x and :y using math:product." ?Product) string:format ?Block.
 } => { :out01 log:outputString ?Block. } .

package/examples/sqrt2-cauchy.n3

@@ -13,6 +13,8 @@
 @prefix log:   <http://www.w3.org/2000/10/swap/log#>.
 @prefix string:<http://www.w3.org/2000/10/swap/string#>.
 
+:000_md_title log:outputString "# sqrt2-cauchy\n\n" .
+
 :sqrt2Real a :Real;
   :representedBy :sqrt2Seq.
 

package/examples/sqrt2-dedekind.n3

@@ -9,6 +9,8 @@
 @prefix log:    <http://www.w3.org/2000/10/swap/log#>.
 @prefix string: <http://www.w3.org/2000/10/swap/string#>.
 
+:000_md_title log:outputString "# sqrt2-dedekind\n\n" .
+
 # -----------------------------------------------------------------
 # Data: a finite sample of rationals (decimal tokens are rationals)
 # -----------------------------------------------------------------

package/examples/sudoku.n3

@@ -112,7 +112,7 @@
     ?givens ?blanks ?forced ?guessed ?nodes ?backtracks ?moveSummary ) string:format ?reasonText .
 }
     => {
-         :01-answer log:outputString "=== Answer ===\n" ;
+         :01-answer log:outputString "# sudoku\n\n## Answer\n" ;
                     log:outputString ?answerText .
          :01a-answer log:outputString "case              : sudoku\n" ;
                      log:outputString "default puzzle    : classic\n\n" ;
@@ -122,7 +122,7 @@
                      log:outputString "Completed grid\n" ;
                      log:outputString ?solutionText .
          :01b-answer log:outputString "\n" .
-         :02-reason log:outputString "=== Reason Why ===\n" ;
+         :02-reason log:outputString "## Reason Why\n" ;
                     log:outputString ?reasonText ;
                     log:outputString "\n\n" .
        } .
@@ -144,7 +144,7 @@
     ?givens ?blanks ?forced ?guessed ?nodes ?backtracks ?moveSummary ) string:format ?reasonText .
 }
     => {
-         :01-answer log:outputString "=== Answer ===\n" ;
+         :01-answer log:outputString "# sudoku\n\n## Answer\n" ;
                     log:outputString ?answerText .
          :01a-answer log:outputString "case              : sudoku\n" ;
                      log:outputString "default puzzle    : classic\n\n" ;
@@ -154,7 +154,7 @@
                      log:outputString "Completed grid\n" ;
                      log:outputString ?solutionText ;
                      log:outputString "\n" .
-         :02-reason log:outputString "=== Reason Why ===\n" ;
+         :02-reason log:outputString "## Reason Why\n" ;
                     log:outputString ?reasonText ;
                     log:outputString "\n\n" .
        } .
@@ -164,10 +164,10 @@
   :case :error ?error .
 }
     => {
-         :01-answer log:outputString "=== Answer ===\n" ;
+         :01-answer log:outputString "# sudoku\n\n## Answer\n" ;
                     log:outputString "The supplied puzzle is not well formed and cannot be parsed as a 9×9 Sudoku.\n" ;
                     log:outputString "case              : sudoku\n\n" .
-         :02-reason log:outputString "=== Reason Why ===\n" ;
+         :02-reason log:outputString "## Reason Why\n" ;
                     log:outputString ?error ;
                     log:outputString "\n\n" .
        } .
@@ -178,13 +178,13 @@
         :error ?error .
 }
     => {
-         :01-answer log:outputString "=== Answer ===\n" ;
+         :01-answer log:outputString "# sudoku\n\n## Answer\n" ;
                     log:outputString "The puzzle is invalid and cannot be solved as a standard Sudoku.\n" ;
                     log:outputString "case              : sudoku\n\n" ;
                     log:outputString "Puzzle\n" ;
                     log:outputString ?puzzleText ;
                     log:outputString "\n" .
-         :02-reason log:outputString "=== Reason Why ===\n" ;
+         :02-reason log:outputString "## Reason Why\n" ;
                     log:outputString ?error ;
                     log:outputString "\n\n" .
        } .
@@ -200,14 +200,14 @@
     ?nodes ?backtracks ) string:format ?reasonText .
 }
     => {
-         :01-answer log:outputString "=== Answer ===\n" ;
+         :01-answer log:outputString "# sudoku\n\n## Answer\n" ;
                     log:outputString "No valid Sudoku solution exists for the supplied puzzle.\n" ;
                     log:outputString "case                         : sudoku\n" ;
                     log:outputString "default puzzle               : classic\n" ;
                     log:outputString "\nPuzzle\n" ;
                     log:outputString ?puzzleText ;
                     log:outputString "\n" .
-         :02-reason log:outputString "=== Reason Why ===\n" ;
+         :02-reason log:outputString "## Reason Why\n" ;
                     log:outputString ?reasonText ;
                     log:outputString "\n\n" .
        } .
@@ -233,7 +233,7 @@
   ( "C7 %s - the search statistics and the successful proof path are internally consistent.\n" ?c7 ) string:format ?l7 .
 }
     => {
-         :03-check log:outputString "=== Check ===\n" ;
+         :03-check log:outputString "## Check\n" ;
                    log:outputString ?l1 ;
                    log:outputString ?l2 ;
                    log:outputString ?l3 ;
@@ -254,10 +254,10 @@
     => { :03a-check log:outputString "C8 INFO - a second search found another solution, so the puzzle is not unique.\n" . } .
 
 { :case :status "illegal-clues" . }
-    => { :03-check log:outputString "=== Check ===\nC1 failed - the given clues already violate Sudoku rules.\n" . } .
+    => { :03-check log:outputString "## Check\nC1 failed - the given clues already violate Sudoku rules.\n" . } .
 
 { :case :status "invalid-input" . }
-    => { :03-check log:outputString "=== Check ===\nC1 failed - the supplied text does not normalize to exactly 81 legal Sudoku cells.\n" . } .
+    => { :03-check log:outputString "## Check\nC1 failed - the supplied text does not normalize to exactly 81 legal Sudoku cells.\n" . } .
 
 { :case :status "unsatisfiable" . }
-    => { :03-check log:outputString "=== Check ===\nC1 OK - the given clues are internally consistent.\nC2 OK - every explored assignment respected row, column, and box legality.\nC3 failed - exhaustive search found no complete legal grid.\n" . } .
+    => { :03-check log:outputString "## Check\nC1 OK - the given clues are internally consistent.\nC2 OK - every explored assignment respected row, column, and box legality.\nC3 failed - exhaustive search found no complete legal grid.\n" . } .