eyeling 1.24.7 → 1.24.9

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## Source files\n\n- [N3 rules](../sudoku.n3)\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## Source files\n\n- [N3 rules](../sudoku.n3)\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## Source files\n\n- [N3 rules](../sudoku.n3)\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## Source files\n\n- [N3 rules](../sudoku.n3)\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## Source files\n\n- [N3 rules](../sudoku.n3)\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" . } .

package/examples/transcendental-numbers-stretched.n3

@@ -303,3 +303,8 @@ log:query
   :report :concerns ?A.
   :report :concerns ?B.
 }.
+
+
+# Markdown rendering via log:outputString.
+:__md_output :text "# transcendental-numbers-stretched\n\n## Source files\n\n- [N3 rules](../transcendental-numbers-stretched.n3)\n\n@prefix : <https://example.org/transcendental#> .\n\n:report :concerns :prod_e_pi .\n:report :concerns :sum_e_pi .\n:report :headline :quadraticTrick .\n:report :irrational :e .\n:report :irrational :e_div_2 .\n:report :irrational :e_plus_1 .\n:report :irrational :e_plus_2 .\n:report :irrational :exp_minus_pi_over_2 .\n:report :irrational :exp_sqrt2 .\n:report :irrational :half_times_e .\n:report :irrational :half_times_pi .\n:report :irrational :pi .\n:report :irrational :pi_div_2 .\n:report :irrational :pi_plus_1 .\n:report :irrational :pi_plus_sqrt2 .\n:report :irrational :pow_2_sqrt2 .\n:report :irrational :pow_e_pi .\n:report :irrational :pow_i_i .\n:report :irrational :pow_minus1_minusI .\n:report :irrational :pow2sqrt2_div_2 .\n:report :irrational :pow2sqrt2_plus_1 .\n:report :irrational :two_times_e .\n:report :irrational :two_times_pi .\n:report :irrational :two_times_pow2sqrt2 .\n:report :notConstructible :e .\n:report :notConstructible :e_div_2 .\n:report :notConstructible :e_plus_1 .\n:report :notConstructible :e_plus_2 .\n:report :notConstructible :exp_minus_pi_over_2 .\n:report :notConstructible :exp_sqrt2 .\n:report :notConstructible :half_times_e .\n:report :notConstructible :half_times_pi .\n:report :notConstructible :pi .\n:report :notConstructible :pi_div_2 .\n:report :notConstructible :pi_plus_1 .\n:report :notConstructible :pi_plus_sqrt2 .\n:report :notConstructible :pow_2_sqrt2 .\n:report :notConstructible :pow_e_pi .\n:report :notConstructible :pow_i_i .\n:report :notConstructible :pow_minus1_minusI .\n:report :notConstructible :pow2sqrt2_div_2 .\n:report :notConstructible :pow2sqrt2_plus_1 .\n:report :notConstructible :two_times_e .\n:report :notConstructible :two_times_pi .\n:report :notConstructible :two_times_pow2sqrt2 .\n:report :proof {\n    :e :provedBy :Hermite1873 .\n} .\n:report :proof {\n    :e :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :e :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :e_div_2 :provedBy :TransDivAlg .\n} .\n:report :proof {\n    :e_div_2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :e_div_2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :e_plus_1 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :e_plus_1 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :e_plus_1 :provedBy :TransPlusAlg .\n} .\n:report :proof {\n    :e_plus_2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :e_plus_2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :e_plus_2 :provedBy :TransPlusAlg .\n} .\n:report :proof {\n    :exp_minus_pi_over_2 :provedBy :GelfondSchneider .\n} .\n:report :proof {\n    :exp_minus_pi_over_2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :exp_minus_pi_over_2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :exp_sqrt2 :provedBy :LindemannWeierstrass .\n} .\n:report :proof {\n    :exp_sqrt2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :exp_sqrt2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :half_times_e :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :half_times_e :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :half_times_e :provedBy :TransTimesAlg .\n} .\n:report :proof {\n    :half_times_pi :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :half_times_pi :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :half_times_pi :provedBy :TransTimesAlg .\n} .\n:report :proof {\n    :pi :provedBy :Lindemann1882 .\n} .\n:report :proof {\n    :pi :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pi :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pi_div_2 :provedBy :TransDivAlg .\n} .\n:report :proof {\n    :pi_div_2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pi_div_2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pi_plus_1 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pi_plus_1 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pi_plus_1 :provedBy :TransPlusAlg .\n} .\n:report :proof {\n    :pi_plus_sqrt2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pi_plus_sqrt2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pi_plus_sqrt2 :provedBy :TransPlusAlg .\n} .\n:report :proof {\n    :pow_2_sqrt2 :provedBy :GelfondSchneider .\n} .\n:report :proof {\n    :pow_2_sqrt2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pow_2_sqrt2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pow_e_pi :provedBy :GelfondSchneider .\n} .\n:report :proof {\n    :pow_e_pi :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pow_e_pi :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pow_i_i :provedBy :GelfondSchneider .\n} .\n:report :proof {\n    :pow_i_i :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pow_i_i :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pow_minus1_minusI :provedBy :GelfondSchneider .\n} .\n:report :proof {\n    :pow_minus1_minusI :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pow_minus1_minusI :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pow2sqrt2_div_2 :provedBy :TransDivAlg .\n} .\n:report :proof {\n    :pow2sqrt2_div_2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pow2sqrt2_div_2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pow2sqrt2_plus_1 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :pow2sqrt2_plus_1 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :pow2sqrt2_plus_1 :provedBy :TransPlusAlg .\n} .\n:report :proof {\n    :two_times_e :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :two_times_e :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :two_times_e :provedBy :TransTimesAlg .\n} .\n:report :proof {\n    :two_times_pi :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :two_times_pi :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :two_times_pi :provedBy :TransTimesAlg .\n} .\n:report :proof {\n    :two_times_pow2sqrt2 :provedBy :TransImpliesIrrational .\n} .\n:report :proof {\n    :two_times_pow2sqrt2 :provedBy :TransImpliesNotConstructible .\n} .\n:report :proof {\n    :two_times_pow2sqrt2 :provedBy :TransTimesAlg .\n} .\n:report :transcendental :e .\n:report :transcendental :e_div_2 .\n:report :transcendental :e_plus_1 .\n:report :transcendental :e_plus_2 .\n:report :transcendental :exp_minus_pi_over_2 .\n:report :transcendental :exp_sqrt2 .\n:report :transcendental :half_times_e .\n:report :transcendental :half_times_pi .\n:report :transcendental :pi .\n:report :transcendental :pi_div_2 .\n:report :transcendental :pi_plus_1 .\n:report :transcendental :pi_plus_sqrt2 .\n:report :transcendental :pow_2_sqrt2 .\n:report :transcendental :pow_e_pi .\n:report :transcendental :pow_i_i .\n:report :transcendental :pow_minus1_minusI .\n:report :transcendental :pow2sqrt2_div_2 .\n:report :transcendental :pow2sqrt2_plus_1 .\n:report :transcendental :two_times_e .\n:report :transcendental :two_times_pi .\n:report :transcendental :two_times_pow2sqrt2 .\n:report :unknown :pow_pi_e .\n:report :unknown :prod_e_pi .\n:report :unknown :sum_e_pi .\n" .
+{ :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .

package/examples/transistor-switch.n3

@@ -193,7 +193,7 @@
   ( "on-state load current            : %s\n\n" ?onCurrentText ) string:format ?onCurrentLine .
 }
     => {
-         :01-answer-1 log:outputString "=== Answer ===\n" .
+         :01-answer-1 log:outputString "# transistor-switch\n\n## Source files\n\n- [N3 rules](../transistor-switch.n3)\n\n## Answer\n" .
          :01-answer-2 log:outputString "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.\n" .
          :01-answer-3 log:outputString "case                             : transistor-switch\n" .
          :01-answer-4 log:outputString ?lowStateLine .
@@ -223,7 +223,7 @@
   ( "high-input load limit            : %s\n" ?loadLimitText ) string:format ?loadLine .
 }
     => {
-         :02-why-01 log:outputString "=== Reason Why ===\n" .
+         :02-why-01 log:outputString "## Reason Why\n" .
          :02-why-02 log:outputString "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.\n" .
          :02-why-03 log:outputString ?supplyLine .
          :02-why-04 log:outputString ?rbLine .
@@ -244,7 +244,7 @@
   :case :loadVoltageMatchesResistorDrop true .
 }
     => {
-         :03-check-1 log:outputString "=== Check ===\n" .
+         :03-check-1 log:outputString "## Check\n" .
          :03-check-2 log:outputString "low input stays in cutoff        : yes\n" .
          :03-check-3 log:outputString "high input reaches saturation    : yes\n" .
          :03-check-4 log:outputString "switching states differ          : yes\n" .

package/examples/triple-terms.n3

@@ -18,3 +18,8 @@ VERSION "1.2"
 { ?observation :entails ?entailment }
   log:query
 { ?observation :entails ?entailment } .
+
+
+# Markdown rendering via log:outputString.
+:__md_output :text "# triple-terms\n\n## Source files\n\n- [N3 rules](../triple-terms.n3)\n- [Input TriG](../input/triple-terms.trig)\n\nVERSION \"1.2\"\n\n@prefix : <https://eyereasoner.github.io/eyeling/examples/triple_terms#> .\n\n:observation :entails <<( :sensor :needs :inspection )>> .\n" .
+{ :__md_output :text ?text } log:query { :__md_output log:outputString ?text } .

package/examples/tunnel-junction-wake-switch-becoming.n3

@@ -18,6 +18,8 @@
 @prefix arc: <https://example.org/arc#> .
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .
 
+:000_md_title log:outputString "# tunnel-junction-wake-switch-becoming\n\n## Source files\n\n- [N3 rules](../tunnel-junction-wake-switch-becoming.n3)\n\n" .
+
 :case a arc:Case ;
   arc:question "Can a tunnel-junction wake switch become a low-bias wake-triggering state in a regime where a conventional PN junction cannot?" .
 
@@ -193,14 +195,14 @@
 {
   :out log:outputString """tunnel-junction wake switch — becoming
 
-Answer
+## Answer
 YES for the tunnel junction.
 NO for the conventional low-bias PN junction in the same wake-switch regime.
 
-Reason Why
+## 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
+## 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

package/examples/wind-turbine.n3

@@ -15,6 +15,8 @@
 @prefix string: <http://www.w3.org/2000/10/swap/string#> .
 @prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
 
+:000_md_title log:outputString "# wind-turbine\n\n## Source files\n\n- [N3 rules](../wind-turbine.n3)\n\n" .
+
 # --- Sensor data ---
 :turbine1
     :label "North field turbine" ;
@@ -97,13 +99,13 @@
   :check :c1 ?C1; :c2 ?C2; :c3 ?C3; :c4 ?C4; :c5 ?C5; :c6 ?C6; :c7 ?C7; :c8 ?C8; :c9 ?C9.
   (
     "Wind turbine — Predictive maintenance\n\n"
-    "Answer\n"
+    "## Answer\n"
     ?Outcome "\n\n"
-    "Reason Why\n"
+    "## Reason Why\n"
     ?Label " reports vibration " ?V " against a threshold of " ?VT ", temperature " ?Temp
     " against a threshold of " ?TT ", and rotor speed " ?RPM " against a critical limit of " ?RT ". "
     ?Reason "\n\n"
-    "Check\n"
+    "## Check\n"
     "C1 " ?C1 "\n"
     "C2 " ?C2 "\n"
     "C3 " ?C3 "\n"

package/eyeling.js

@@ -9209,6 +9209,19 @@ function makeExplain(deps) {
     return 0;
   }
 
+  function addMarkdownHardBreaks(text) {
+    const normalized = String(text).replace(/\r\n/g, '\n').replace(/\r/g, '\n');
+    if (!normalized.startsWith('# ')) return text;
+
+    return normalized
+      .split('\n')
+      .map((line) => {
+        if (line.length === 0) return line;
+        return line.replace(/[ \t]+$/g, '') + '  ';
+      })
+      .join('\n');
+  }
+
   function collectOutputStringsFromFacts(facts, prefixes) {
     // Gather all (key, string) pairs from the saturated fact store.
     const pairs = [];
@@ -9229,7 +9242,7 @@ function makeExplain(deps) {
       return a.idx - b.idx; // stable tie-breaker
     });
 
-    return pairs.map((p) => p.text).join('');
+    return addMarkdownHardBreaks(pairs.map((p) => p.text).join(''));
   }
 
   return { printExplanation, collectOutputStringsFromFacts };

package/lib/explain.js

@@ -181,6 +181,19 @@ function makeExplain(deps) {
     return 0;
   }
 
+  function addMarkdownHardBreaks(text) {
+    const normalized = String(text).replace(/\r\n/g, '\n').replace(/\r/g, '\n');
+    if (!normalized.startsWith('# ')) return text;
+
+    return normalized
+      .split('\n')
+      .map((line) => {
+        if (line.length === 0) return line;
+        return line.replace(/[ \t]+$/g, '') + '  ';
+      })
+      .join('\n');
+  }
+
   function collectOutputStringsFromFacts(facts, prefixes) {
     // Gather all (key, string) pairs from the saturated fact store.
     const pairs = [];
@@ -201,7 +214,7 @@ function makeExplain(deps) {
       return a.idx - b.idx; // stable tie-breaker
     });
 
-    return pairs.map((p) => p.text).join('');
+    return addMarkdownHardBreaks(pairs.map((p) => p.text).join(''));
   }
 
   return { printExplanation, collectOutputStringsFromFacts };

package/package.json

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

package/test/examples.test.js

@@ -30,18 +30,44 @@ function run(cmd, args, opts = {}) {
   });
 }
 
-// Normalize output for comparison.
+function normalizeNewlines(text) {
+  return String(text).replace(/\r\n/g, '\n').replace(/\r/g, '\n');
+}
+
+function stripTrailingWhitespace(text) {
+  return normalizeNewlines(text)
+    .split('\n')
+    .map((line) => line.replace(/[\t ]+$/g, ''))
+    .join('\n');
+}
+
+function normalizeTextForCompare(text) {
+  return stripTrailingWhitespace(text).trim();
+}
+
+function normalizeMarkdownForCompare(text) {
+  return normalizeNewlines(text).replace(/^\n+|\n+$/g, '');
+}
+
+// Normalize N3 output for comparison.
 // Eyeling (and other N3 tools) may emit the same closure with different
 // triple ordering. Examples tests should verify content, not presentation.
-function normalizeForCompare(n3Text) {
-  return String(n3Text)
-    .split(/\r?\n/)
-    .map((l) => l.replace(/[\t ]+$/g, '')) // trim trailing whitespace
+function normalizeN3ForCompare(n3Text) {
+  return stripTrailingWhitespace(n3Text)
+    .split('\n')
     .filter((l) => l.length > 0)
     .sort((a, b) => a.localeCompare(b))
     .join('\n');
 }
 
+function normalizeForCompare(text, expectedPath) {
+  const ext = path.extname(expectedPath);
+  const value = text;
+  if (ext === '.md') return normalizeMarkdownForCompare(value);
+  if (ext === '.txt') return normalizeTextForCompare(value);
+  return normalizeN3ForCompare(value);
+}
+
 // Expectation logic (robust, long-term):
 // 1) If file contains:  # expect-exit: N  -> use N
 // 2) Else -> expect exit 0
@@ -79,23 +105,26 @@ function showDiff({ examplesDir, expectedPath, generatedPath }) {
 }
 
 function resolveExpectedPath(outputDir, inputFile) {
-  const exactPath = path.join(outputDir, inputFile);
-  if (fs.existsSync(exactPath)) return exactPath;
-
   const stem = path.basename(inputFile, path.extname(inputFile));
+  const preference = new Map([
+    ['.md', 0],
+    ['.txt', 1],
+    ['.n3', 2],
+  ]);
   const candidates = fs
     .readdirSync(outputDir)
     .filter((name) => path.basename(name, path.extname(name)) === stem)
     .sort((a, b) => {
-      if (path.extname(a) === '.txt' && path.extname(b) !== '.txt') return -1;
-      if (path.extname(a) !== '.txt' && path.extname(b) === '.txt') return 1;
-      return a.localeCompare(b);
+      const pa = preference.get(path.extname(a)) ?? 99;
+      const pb = preference.get(path.extname(b)) ?? 99;
+      return pa - pb || a.localeCompare(b);
     });
 
   if (candidates.length === 0) return null;
   return path.join(outputDir, candidates[0]);
 }
 
+
 function resolveExampleTrigInput(root, inputFile) {
   const stem = path.basename(inputFile, path.extname(inputFile));
   const rel = path.join('input', `${stem}.trig`);
@@ -229,13 +258,15 @@ function main() {
 
     const ms = Date.now() - start;
 
-    // Compare output (order-insensitive)
+    // Compare output. N3 outputs are order-insensitive; Markdown outputs are order-sensitive.
     let diffOk = false;
     try {
       const expectedText = fs.readFileSync(expectedPath, 'utf8');
       const generatedText = fs.readFileSync(generatedPath, 'utf8');
       if (expectedText == null) throw new Error('missing expected output');
-      diffOk = normalizeForCompare(expectedText) === normalizeForCompare(generatedText);
+      diffOk =
+        normalizeForCompare(expectedText, expectedPath) ===
+        normalizeForCompare(generatedText, expectedPath);
     } catch {
       diffOk = false;
     }

package/test/package.test.js

@@ -58,8 +58,23 @@ function runChecked(cmd, args, opts = {}) {
   return res;
 }
 
-function normalizeNewlines(s) {
-  return String(s).replace(/\r\n/g, '\n');
+function normalizeNewlines(text) {
+  return String(text).replace(/\r\n/g, '\n').replace(/\r/g, '\n');
+}
+
+function stripTrailingWhitespace(text) {
+  return normalizeNewlines(text)
+    .split('\n')
+    .map((line) => line.replace(/[\t ]+$/g, ''))
+    .join('\n');
+}
+
+function normalizeTextForCompare(text) {
+  return stripTrailingWhitespace(text).trim();
+}
+
+function normalizeMarkdownForCompare(text) {
+  return normalizeNewlines(text).replace(/^\n+|\n+$/g, '');
 }
 
 // Expectation logic (shared with test/examples.test.js):
@@ -81,6 +96,26 @@ function resolveExampleTrigInput(examplesDir, inputFile) {
   return { abs, rel };
 }
 
+function resolveExpectedPath(outputDir, inputFile) {
+  const stem = path.basename(inputFile, path.extname(inputFile));
+  const preference = new Map([
+    ['.md', 0],
+    ['.txt', 1],
+    ['.n3', 2],
+  ]);
+  const candidates = fs
+    .readdirSync(outputDir)
+    .filter((name) => path.basename(name, path.extname(name)) === stem)
+    .sort((a, b) => {
+      const pa = preference.get(path.extname(a)) ?? 99;
+      const pb = preference.get(path.extname(b)) ?? 99;
+      return pa - pb || a.localeCompare(b);
+    });
+
+  if (candidates.length === 0) return null;
+  return path.join(outputDir, candidates[0]);
+}
+
 function hasGit() {
   const r = run('git', ['--version']);
   return r.status === 0;
@@ -191,11 +226,11 @@ function main() {
     try {
       for (const file of SMOKE_EXAMPLES) {
         const inputPath = path.join(examplesDir, file);
-        const expectedPath = path.join(outputDir, file);
+        const expectedPath = resolveExpectedPath(outputDir, file);
 
         if (!fs.existsSync(inputPath)) throw new Error(`Missing example in installed package: ${inputPath}`);
-        if (!fs.existsSync(expectedPath))
-          throw new Error(`Missing golden output in installed package: ${expectedPath}`);
+        if (!expectedPath || !fs.existsSync(expectedPath))
+          throw new Error(`Missing golden output in installed package for ${file}`);
 
         const n3Text = fs.readFileSync(inputPath, 'utf8');
         const expectedRc = expectedExitCode(n3Text);
@@ -229,9 +264,10 @@ ${stderr}`
         // Normalize newlines so this is stable across platforms.
         const got = normalizeNewlines(r.stdout || '');
         const exp = normalizeNewlines(fs.readFileSync(expectedPath, 'utf8'));
+        const compare = path.extname(expectedPath) === '.md' ? normalizeMarkdownForCompare : normalizeTextForCompare;
 
-        if (got !== exp) {
-          const genPath = path.join(tmpExamplesOut, file);
+        if (compare(got) !== compare(exp)) {
+          const genPath = path.join(tmpExamplesOut, path.basename(expectedPath));
           fs.writeFileSync(genPath, got, 'utf8');
           console.error(`
 Output differs for ${file}:`);

package/examples/output/act-barley-seed-lineage.txt

@@ -1,25 +0,0 @@
-ACT barley seed lineage — can and can't
-
-Answer
-YES for the viable barley lineage.
-NO for the contrast lineages when digital heredity, repair, protected dormancy, or heritable variation are missing.
-
-Reason Why
-The main lineage can achieve genome copying under no-design laws because its hereditary information is digitally instantiated. It can also pass through protected dormancy, germinate, produce propagules, reproduce accurately, close its life cycle, and adaptively persist under saline selection. But the contrast lineages show the "can't" side: non-digital heredity blocks accurate genome copying under no-design laws, lack of repair blocks accurate self-reproduction, lack of dormancy protection blocks lineage closure through a protected seed phase, and lack of heritable variation blocks adaptive evolution and thus blocks evolvability.
-
-Check
-C1  OK - no-design laws are assumed
-C2  OK - the viable genome can be copied under no-design laws
-C3  OK - the viable seed can achieve protected dormancy
-C4  OK - the viable seed can germinate
-C5  OK - the viable adult can produce propagules
-C6  OK - the viable lineage can achieve accurate self-reproduction
-C7  OK - the viable lineage can achieve lineage closure
-C8  OK - the viable lineage can exhibit heritable variation
-C9  OK - the viable lineage can adaptively persist
-C10 OK - the viable lineage is evolvable
-C11 OK - the non-digital lineage cannot achieve accurate self-reproduction
-C12 OK - the repair-deficient lineage cannot achieve accurate self-reproduction
-C13 OK - the coatless lineage cannot achieve lineage closure through protected dormancy
-C14 OK - the static lineage cannot achieve adaptive evolution
-C15 OK - the static lineage cannot be an evolvable lineage

package/examples/output/auroracare.txt

@@ -1,149 +0,0 @@
-AuroraCare — Purpose-based Medical Data Exchange
-
-=== A – Primary care visit ===
-Clinician in the patient's care team accessing the patient summary for primary care management.
-
-Answer
-PERMIT
-
-Reason Why
-Permitted: clinician in the patient's care team, and the primary-care policy matched.
-
-Check
-C1 SKIPPED - not a prohibited purpose
-C2 OK - clinician
-C3 OK - care-team linked
-C4 SKIPPED
-C5 OK - operator=isAnyOf, allowed=["https://example.org/health#PATIENT_SUMMARY","https://example.org/health#LAB_RESULTS"], requested=["https://example.org/health#PATIENT_SUMMARY"]
-C6 SKIPPED - no prohibition matched
-C7 OK - trace shows matching permission
-C8 SKIPPED - no matched policy or no duties
-C9 SKIPPED - policy has no environment constraint
-C10 INFO - matched policy: urn:policy:primary-care-001
-
-=== B – Quality improvement (in scope) ===
-QI analyst using lab results + summary in a secure environment.
-
-Answer
-PERMIT
-
-Reason Why
-Permitted: ODRL/DPV policy matched for secondary use.
-
-Check
-C1 SKIPPED - not a prohibited purpose
-C2 SKIPPED
-C3 SKIPPED
-C4 OK - opt-in present and policy matched
-C5 OK - operator=isAllOf, allowed=["https://example.org/health#LAB_RESULTS","https://example.org/health#PATIENT_SUMMARY"], requested=["https://example.org/health#LAB_RESULTS","https://example.org/health#PATIENT_SUMMARY"]
-C6 SKIPPED - no prohibition matched
-C7 OK - trace shows matching permission
-C8 INFO - duties attached: duty:https://w3id.org/dpv/legal/eu/ehds#requireConsent, duty:https://w3id.org/dpv/legal/eu/ehds#noExfiltration
-C9 OK - operator=eq, allowed="secure_env", requested="secure_env"
-C10 INFO - matched policy: urn:policy:qi-2025-aurora
-
-=== C – Quality improvement (out of scope) ===
-QI analyst with only lab results; policy expects labs + summary.
-
-Answer
-DENY
-
-Reason Why
-Denied: no policy matched (purpose, environment, TOMs, or categories out of scope).
-
-Check
-C1 SKIPPED - not a prohibited purpose
-C2 SKIPPED
-C3 SKIPPED
-C4 OK - denied because opt-in missing or no policy match
-C5 SKIPPED
-C6 SKIPPED - no prohibition matched
-C7 SKIPPED
-C8 SKIPPED - no matched policy or no duties
-C9 SKIPPED
-C10 SKIPPED - no matched policy
-
-=== D – Insurance management ===
-Insurance bot attempting to use health data for insurance management (prohibited purpose).
-
-Answer
-DENY
-
-Reason Why
-Denied: the requested purpose (insurance management) is prohibited by policy.
-
-Check
-C1 OK - denied prohibited purpose
-C2 SKIPPED
-C3 SKIPPED
-C4 SKIPPED
-C5 SKIPPED
-C6 OK - denied due to prohibition
-C7 SKIPPED
-C8 SKIPPED - no matched policy or no duties
-C9 SKIPPED
-C10 SKIPPED - no matched policy
-
-=== E – GP checks labs ===
-GP for the same patient checking lab results via the API gateway.
-
-Answer
-PERMIT
-
-Reason Why
-Permitted: clinician in the patient's care team, and the primary-care policy matched.
-
-Check
-C1 SKIPPED - not a prohibited purpose
-C2 OK - clinician
-C3 OK - care-team linked
-C4 SKIPPED
-C5 OK - operator=isAnyOf, allowed=["https://example.org/health#PATIENT_SUMMARY","https://example.org/health#LAB_RESULTS"], requested=["https://example.org/health#LAB_RESULTS"]
-C6 SKIPPED - no prohibition matched
-C7 OK - trace shows matching permission
-C8 SKIPPED - no matched policy or no duties
-C9 SKIPPED - policy has no environment constraint
-C10 INFO - matched policy: urn:policy:primary-care-001
-
-=== F – Research on anonymised dataset ===
-Researcher using anonymised labs + summary in a secure environment, with opt-in.
-
-Answer
-PERMIT
-
-Reason Why
-Permitted: subject opted in and an ODRL/DPV policy matched (anonymised dataset in secure environment).
-
-Check
-C1 SKIPPED - not a prohibited purpose
-C2 SKIPPED
-C3 SKIPPED
-C4 OK - opt-in present and policy matched
-C5 OK - operator=isAnyOf, allowed=["https://example.org/health#LAB_RESULTS","https://example.org/health#PATIENT_SUMMARY","https://example.org/health#IMAGING_REPORT"], requested=["https://example.org/health#PATIENT_SUMMARY","https://example.org/health#LAB_RESULTS"]
-C6 SKIPPED - no prohibition matched
-C7 OK - trace shows matching permission
-C8 INFO - duties attached: duty:https://w3id.org/dpv/legal/eu/ehds#annualOutcomeReport, duty:https://w3id.org/dpv/legal/eu/ehds#noReidentification, duty:https://w3id.org/dpv/legal/eu/ehds#noExfiltration
-C9 OK - operator=eq, allowed="secure_env", requested="secure_env"
-C10 INFO - matched policy: urn:policy:research-aurora-diabetes
-
-=== G – AI training (opt-out) ===
-Data user wants to train AI, but the subject opted out of AI training.
-
-Answer
-DENY
-
-Reason Why
-Denied: you opted out of your data being used to train AI systems.
-
-Check
-C1 SKIPPED - not a prohibited purpose
-C2 SKIPPED
-C3 SKIPPED
-C4 OK - denied because opt-in missing or no policy match
-C5 SKIPPED
-C6 SKIPPED - no prohibition matched
-C7 SKIPPED
-C8 SKIPPED - no matched policy or no duties
-C9 SKIPPED
-C10 SKIPPED - no matched policy
-

package/examples/output/backward-recursion.n3

@@ -1,4 +0,0 @@
-@prefix : <urn:example#> .
-
-:a :reaches :b .
-:a :reaches :c .