eyeprolog 1.3.69 → 1.3.71

package/test/conformance/wg17-syntax-cases.json

@@ -522,7 +522,7 @@
       "query": "writeq([:-,-]).",
       "input": "writeq([:-,-]).",
       "readCount": 1,
-      "expected": "[:-,-] ³",
+      "expected": "[:-,-]",
       "outcome": {
         "type": "success",
         "stages": [
@@ -586,7 +586,7 @@
       "query": "writeq([.,.(.,.,.)]).",
       "input": "writeq([.,.(.,.,.)]).",
       "readCount": 1,
-      "expected": "['.','.'('.','.','.')] ³",
+      "expected": "['.','.'('.','.','.')]",
       "outcome": {
         "type": "success",
         "stages": [
@@ -602,7 +602,7 @@
       "query": "writeq((a :- b,c)).",
       "input": "writeq((a :- b,c)).",
       "readCount": 1,
-      "expected": "a:-b,c³",
+      "expected": "a:-b,c",
       "outcome": {
         "type": "success",
         "stages": [
@@ -618,7 +618,7 @@
       "query": "write_canonical([a]).",
       "input": "write_canonical([a]).",
       "readCount": 1,
-      "expected": "'.'(a,[])³",
+      "expected": "'.'(a,[])",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1052,7 +1052,7 @@
       "query": "(- (1)) = -(1).",
       "input": "(- (1)) = -(1).",
       "readCount": 1,
-      "expected": "succeeds°",
+      "expected": "succeeds",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1068,7 +1068,7 @@
       "query": "(- -1) = -(-1).",
       "input": "(- -1) = -(-1).",
       "readCount": 1,
-      "expected": "succeeds°",
+      "expected": "succeeds",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1084,7 +1084,7 @@
       "query": "(- 1^2) = ^(-1,2).",
       "input": "(- 1^2) = ^(-1,2).",
       "readCount": 1,
-      "expected": "succeeds°",
+      "expected": "succeeds",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1303,12 +1303,12 @@
       "query": "writeq(-(1)).",
       "input": "writeq(-(1)).",
       "readCount": 1,
-      "expected": "- (1)³",
+      "expected": "- (1)",
       "outcome": {
         "type": "success",
         "stages": [
           {
-            "output": "-(1)",
+            "output": "- (1)",
             "variables": "[]"
           }
         ]
@@ -1335,12 +1335,12 @@
       "query": "writeq(-(1^2)).",
       "input": "writeq(-(1^2)).",
       "readCount": 1,
-      "expected": "- (1^2)³",
+      "expected": "- (1^2)",
       "outcome": {
         "type": "success",
         "stages": [
           {
-            "output": "-(1^2)",
+            "output": "- (1^2)",
             "variables": "[]"
           }
         ]
@@ -1351,12 +1351,12 @@
       "query": "writeq(-(a^2)).",
       "input": "writeq(-(a^2)).",
       "readCount": 1,
-      "expected": "- (a^2)³",
+      "expected": "- (a^2)",
       "outcome": {
         "type": "success",
         "stages": [
           {
-            "output": "-a^2",
+            "output": "- (a^2)",
             "variables": "[]"
           }
         ]
@@ -1367,12 +1367,12 @@
       "query": "writeq(-((a,b))).",
       "input": "writeq(-((a,b))).",
       "readCount": 1,
-      "expected": "- (a,b)³",
+      "expected": "- (a,b)",
       "outcome": {
         "type": "success",
         "stages": [
           {
-            "output": "-(a,b)",
+            "output": "- (a,b)",
             "variables": "[]"
           }
         ]
@@ -1388,7 +1388,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "-(1*2)",
+            "output": "- (1*2)",
             "variables": "[]"
           }
         ]
@@ -1420,7 +1420,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "-(-)",
+            "output": "- (-)",
             "variables": "[]"
           }
         ]
@@ -1431,7 +1431,7 @@
       "query": "writeq(-[-]).",
       "input": "writeq(-[-]).",
       "readCount": 1,
-      "expected": "-[-] ³",
+      "expected": "-[-]",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1479,7 +1479,7 @@
       "query": "writeq(-{a}).",
       "input": "writeq(-{a}).",
       "readCount": 1,
-      "expected": "-{a}³",
+      "expected": "-{a}",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1532,7 +1532,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "- -(1)",
+            "output": "- - (1)",
             "variables": "[]"
           }
         ]
@@ -1543,7 +1543,7 @@
       "query": "op(100,yfx,~).\nwriteq(-(1~2~3)).",
       "input": "op(100,yfx,~).\nwriteq(-(1~2~3)).",
       "readCount": 2,
-      "expected": "- (1~2~3)³",
+      "expected": "- (1~2~3)",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1552,7 +1552,7 @@
             "variables": "[]"
           },
           {
-            "output": "-(1~2~3)",
+            "output": "- (1~2~3)",
             "variables": "[]"
           }
         ]
@@ -1563,7 +1563,7 @@
       "query": " /**/ writeq(- (1~2)).",
       "input": "(catch((op(100,yfx,~)), _, true) -> true ; true).\n  writeq(- (1~2)).",
       "readCount": 2,
-      "expected": "- (1~2)³",
+      "expected": "- (1~2)",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1572,7 +1572,7 @@
             "variables": "[]"
           },
           {
-            "output": "-(1~2)",
+            "output": "- (1~2)",
             "variables": "[]"
           }
         ]
@@ -1619,7 +1619,7 @@
       "query": "op(9,xf,'$VAR'), writeq(- '$VAR'(0)).",
       "input": "op(9,xf,'$VAR'), writeq(- '$VAR'(0)).",
       "readCount": 1,
-      "expected": "-A ³",
+      "expected": "-A",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1695,7 +1695,7 @@
       "query": "compound(+1).",
       "input": "compound(+1).",
       "readCount": 1,
-      "expected": "succeeds ²",
+      "expected": "succeeds",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1711,7 +1711,7 @@
       "query": "compound(+ 1).",
       "input": "compound(+ 1).",
       "readCount": 1,
-      "expected": "succeeds ²",
+      "expected": "succeeds",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1727,7 +1727,7 @@
       "query": "writeq(+1^2).",
       "input": "writeq(+1^2).",
       "readCount": 1,
-      "expected": "+1^2 ²",
+      "expected": "+1^2",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1754,7 +1754,7 @@
       "query": "writeq([+{a},+[]]).",
       "input": "writeq([+{a},+[]]).",
       "readCount": 1,
-      "expected": "[+{a},+[]] ² ³",
+      "expected": "[+{a},+[]]",
       "outcome": {
         "type": "success",
         "stages": [
@@ -1819,7 +1819,7 @@
       "query": "op(999,xfy,'|').",
       "input": "op(999,xfy,'|').",
       "readCount": 1,
-      "expected": "p._e.(c., o.,'|') ²",
+      "expected": "p._e.(c., o.,'|')",
       "outcome": {
         "type": "error",
         "formal": "permission_error(create, operator)"
@@ -1952,7 +1952,7 @@
       "query": "current_op(200,fy,+).",
       "input": "current_op(200,fy,+).",
       "readCount": 1,
-      "expected": "succeeds ²",
+      "expected": "succeeds",
       "outcome": {
         "type": "success",
         "stages": [
@@ -2984,7 +2984,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "-(a*b)",
+            "output": "- (a*b)",
             "variables": "[]"
           }
         ]
@@ -3000,7 +3000,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "\\(a*b)",
+            "output": "\\ (a*b)",
             "variables": "[]"
           }
         ]
@@ -3173,7 +3173,7 @@
       "query": "writeq('$VAR'(0)).",
       "input": "writeq('$VAR'(0)).",
       "readCount": 1,
-      "expected": "A ³",
+      "expected": "A",
       "outcome": {
         "type": "success",
         "stages": [
@@ -3738,7 +3738,7 @@
       "query": " /**/ writeq(\"a\").",
       "input": "(catch((set_prolog_flag(\n double_quotes,chars)), _, true) -> true ; true).\n  writeq(\"a\").",
       "readCount": 2,
-      "expected": "[a] ³",
+      "expected": "[a]",
       "outcome": {
         "type": "success",
         "stages": [
@@ -3885,7 +3885,7 @@
       "query": " /**/ writeq((a-->b,c|d)).",
       "input": "(catch((op(1105,xfy,'|')), _, true) -> true ; true).\n  writeq((a-->b,c|d)).",
       "readCount": 2,
-      "expected": "a-->b,c|d² ³",
+      "expected": "a-->b,c|d",
       "outcome": {
         "type": "success",
         "stages": [
@@ -3956,7 +3956,7 @@
       "query": " /**/ writeq([(a|b)]).",
       "input": "(catch((op(1105,xfy,'|')), _, true) -> true ; true).\n  writeq([(a|b)]).",
       "readCount": 2,
-      "expected": "[(a|b)] ³",
+      "expected": "[(a|b)]",
       "outcome": {
         "type": "success",
         "stages": [
@@ -4210,7 +4210,7 @@
       "query": "op(400,fx,f).\nwriteq(f/*.*/(1,2)).",
       "input": "op(400,fx,f).\nwriteq(f/*.*/(1,2)).",
       "readCount": 2,
-      "expected": "f (1,2)³",
+      "expected": "f (1,2)",
       "outcome": {
         "type": "success",
         "stages": [
@@ -4660,7 +4660,7 @@
       "query": "op(500, xfy, {}).",
       "input": "op(500, xfy, {}).",
       "readCount": 1,
-      "expected": "p._e.(c.,o.,{}) ²",
+      "expected": "p._e.(c.,o.,{})",
       "outcome": {
         "type": "error",
         "formal": "permission_error(create, operator)"
@@ -4958,7 +4958,7 @@
             "variables": "[]"
           },
           {
-            "output": "~(a=b)",
+            "output": "~ (a=b)",
             "variables": "[]"
           }
         ]
@@ -4974,7 +4974,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "\\(a=b)",
+            "output": "\\ (a=b)",
             "variables": "[]"
           }
         ]
@@ -4990,7 +4990,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "+(a=b)",
+            "output": "+ (a=b)",
             "variables": "[]"
           }
         ]
@@ -5076,7 +5076,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "+(1*2)^3",
+            "output": "+ (1*2)^3",
             "variables": "[]"
           }
         ]
@@ -5092,7 +5092,7 @@
         "type": "success",
         "stages": [
           {
-            "output": "-((1*2)^3)",
+            "output": "- ((1*2)^3)",
             "variables": "[]"
           }
         ]

package/test/run-regression.mjs

@@ -314,6 +314,19 @@ probe :- empty_assoc(A), copy_term_nat(A, _), bb_b_put(current, ok), bb_get(curr
           goal: "catch((VN=[[]],write_term(T,[variable_names(VN)])),error(E,_),writeq(E))",
         });
         assertEqual(list.stdout, 'domain_error(write_option,variable_names([[]]))', 'list culprit');
+
+        assertEqual(run('', { isoStrict: true, goal: 'writeq(-(1^2))' }).stdout.split('writeq(')[0],
+          '- (1^2)', 'writeq negative power layout');
+        assertEqual(run('', { isoStrict: true, goal: 'writeq(-(a^2))' }).stdout.split('writeq(')[0],
+          '- (a^2)', 'writeq symbolic negative power layout');
+        assertEqual(run('', {
+          isoStrict: true,
+          goal: "write_term(-X^2,[variable_names(['X'=X])])",
+        }).stdout, '- (X^2)', 'write_term variable_names negative power layout');
+        assertEqual(run('', {
+          isoStrict: true,
+          goal: "X=1,write_term(-X^2,[variable_names(['X'=X])])",
+        }).stdout.split('1 = 1')[0], '- (1^2)', 'write_term bound variable negative power layout');
       },
     },
     {
@@ -3703,6 +3716,16 @@ function documentationSyncCases() {
         assertEqual(parsed[0].query, 'set_prolog_flag( double_quotes,chars).', 'normalized query');
       },
     },
+    {
+      name: 'WG17 upgrader removes presentation footnote markers from Codex text',
+      run: () => {
+        const rows = Array.from({ length: 120 }, (_, index) =>
+          `<tr><td>${index + 1}<td>writeq(-(1^2)).<td>- (1^2)&sup3;`).join('\n');
+        const html = `<table><tr><th>#<th>Query<th>Codex${rows}</table>`;
+        const parsed = parseWg17SyntaxTable(html);
+        assertEqual(parsed[0].expected, '- (1^2)', 'normalized Codex expectation');
+      },
+    },
     {
       name: 'WG17 upstream expectations independently validate reviewed outcomes',
       run: () => {
@@ -3719,6 +3742,22 @@ function documentationSyncCases() {
           true,
           'observable output',
         );
+        const negativePower = { id: 183, input: 'writeq(-(1^2)).' };
+        assertEqual(
+          matchesUpstreamExpectation('- (1^2)', { type: 'success', stages: [{ output: '-(1^2)', variables: '[]' }] }, negativePower),
+          false,
+          'mandatory operator/parenthesis layout is not erased',
+        );
+        assertEqual(
+          matchesUpstreamExpectation('- (a^2)', { type: 'success', stages: [{ output: '-a^2', variables: '[]' }] }, negativePower),
+          false,
+          'mandatory negative-power parentheses are not erased',
+        );
+        assertEqual(
+          matchesUpstreamExpectation('- (1^2)', { type: 'success', stages: [{ output: '- (1 ^ 2)', variables: '[]' }] }, negativePower),
+          true,
+          'non-semantic internal operator spacing remains flexible',
+        );
         const repeated = {
           id: 227, input: 'write_canonical(B+B).',
           outcome: { type: 'success', stages: [{ output: '+(_A,_A)', variables: "['B' = B]" }] },
@@ -3798,7 +3837,7 @@ function documentationSyncCases() {
           'README cover links to the book',
         );
         for (const filename of ['src/iso.js', 'src/dcg.js', 'src/atts.js', 'src/standard-library.js',
-          'src/CLPZ-MIGRATION.md', 'src/lib/aggregate.pl', 'src/lib/atts.pl', 'src/lib/comparison.pl', 'src/lib/dates.pl',
+          'src/lib/aggregate.pl', 'src/lib/atts.pl', 'src/lib/comparison.pl', 'src/lib/dates.pl',
           'src/lib/iso_ext.pl', 'src/lib/lists.pl', 'src/lib/primes.pl', 'src/lib/prologue.pl',
           'src/lib/random.pl', 'src/lib/strings.pl', 'src/lib/uuid.pl',
           'src/playground-worker.js']) {
@@ -4900,7 +4939,7 @@ answer(ok) :-
         assertEqual(Boolean(registry.get('is', 2)), true, 'ISO is/2 exists');
         assertEqual(Boolean(registry.get('append', 3)), false, 'append/3 is not ISO core');
         assertEqual(library.eyePrologLibrary, true, 'complete registry marker');
-        assertEqual(library.defs.size, 175, 'EyeProlog registry contains ISO definitions, cleanup controls, observability extensions, WFS tnot/1, and private library adapters');
+        assertEqual(library.defs.size, 154, 'EyeProlog registry contains ISO definitions, cleanup controls, observability extensions, WFS tnot/1, and generic library adapters');
         assertEqual(Boolean(registry.get('phrase', 2)), true, 'Part 3 phrase/2 exists');
         assertEqual(Boolean(registry.get('phrase', 3)), true, 'Part 3 phrase/3 exists');
         assertEqual(registry.get('statistics', 0), null, 'statistics/0 is absent from the ISO registry');
@@ -4938,8 +4977,8 @@ answer(ok) :-
         assertEqual(registry.get('eyeprolog__countall', 2), null, 'private countall adapter is absent from ISO registry');
         assertEqual(Boolean(library.get('eyeprolog__countall', 2)), true, 'private countall adapter is registered for EyeProlog');
         assertEqual(Boolean(library.get('eyeprolog__time', 1)), true, 'private time adapter is registered for EyeProlog');
-        assertEqual(Boolean(library.get('eyeprolog__clpz_labeling', 2)), true, 'private CLP(Z) labeling adapter is registered');
-        assertEqual(Boolean(library.get('eyeprolog__clpz_global_cardinality', 3)), true, 'private CLP(Z) cardinality adapter is registered');
+        assertEqual(library.get('eyeprolog__clpz_labeling', 2), null, 'CLP(Z) labeling is implemented in Prolog');
+        assertEqual(library.get('eyeprolog__clpz_global_cardinality', 3), null, 'CLP(Z) cardinality is implemented in Prolog');
         assertEqual(registry.get('put_atts', 2), null, 'put_atts/2 is absent from the ISO registry');
         assertEqual(Boolean(library.get('put_atts', 2)), true, 'put_atts/2 is registered for attributed-variable libraries');
         assertEqual(Boolean(library.get('$put_to_attr_list', 3)), true, 'private attribute-list adapter is registered');
@@ -5079,7 +5118,7 @@ repeated(X) :- X in 1..3, all_distinct([X, X]).
 `);
         assertEqual(program.findGroup('labeling', 2)?.module, 'clpz', 'labeling/2 module');
         assertEqual(run(program, { goals: ['answer(X, Y, B)', 'contradiction', 'pruned(Domain)', 'hall(Domain)', 'repeated(X)'] }).stdout,
-          'answer(1, 4, 1).\nanswer(2, 3, 0).\npruned(1 \\/ 3).\nhall(3).\n', 'CLP(Z) constrained answers');
+          'answer(1, 4, 1).\nanswer(2, 3, 0).\npruned(1 \\/ 3).\nhall(3..3).\n', 'CLP(Z) constrained answers');
       },
     },
     {

package/test/run-wg17.mjs

@@ -140,6 +140,38 @@ function stripLayoutOutsideQuotes(text) {
   return output.replace(/\.$/, '').replace(/([eE])\+(?=\d)/g, '$1');
 }
 
+function leadingGraphicOperatorParenSignature(text) {
+  const source = presentationText(text);
+  let index = 0;
+  const operators = [];
+  while (index < source.length) {
+    const match = source.slice(index).match(/^[!#$&*+\-./<=>?@^~\\]+/);
+    if (match == null) return null;
+    operators.push(match[0]);
+    index += match[0].length;
+    const layoutStart = index;
+    while (/\s/.test(source[index] ?? '')) index++;
+    if (index === layoutStart) return null;
+    if (source[index] === '(') return operators;
+  }
+  return null;
+}
+
+function preservesLeadingOperatorParenLayout(expected, actual) {
+  const signature = leadingGraphicOperatorParenSignature(expected);
+  if (signature == null) return true;
+  const source = presentationText(actual);
+  let index = 0;
+  for (const operator of signature) {
+    if (!source.startsWith(operator, index)) return false;
+    index += operator.length;
+    const layoutStart = index;
+    while (/\s/.test(source[index] ?? '')) index++;
+    if (index === layoutStart) return false;
+  }
+  return source[index] === '(';
+}
+
 function normalizeExampleVariables(text) {
   const names = new Map();
   let next = 0;
@@ -248,6 +280,10 @@ function textExpectationMatches(expectedText, actual, item, example = false) {
       left = normalizeExampleVariables(left);
       right = normalizeExampleVariables(right);
     }
+    // Some Codex expectations intentionally carry a mandatory lexical
+    // boundary, notably Cor.3 prefix-operator cases such as `- (1^2)`. Do not
+    // erase that boundary before the semantic/layout-tolerant fallbacks below.
+    if (!preservesLeadingOperatorParenLayout(left, right)) continue;
     if (stripLayoutOutsideQuotes(left) === stripLayoutOutsideQuotes(right)) return true;
     if (termEquivalent(left, right, item)) return true;
     if (example) {

package/the-art-of-eyeprolog.md

@@ -6414,28 +6414,24 @@ level projects module `attribute_goals//1` hooks as residual goals. The checked
 [`examples/attributed-variables.pl`](https://github.com/eyereasoner/eyeprolog/blob/main/examples/attributed-variables.pl)
 demonstrates binding verification and attribute transfer across aliases.
 
-`library(clpz)` follows the familiar Trealla and Scryer convention for
-constraint logic programming over integers. EyeProlog currently provides finite
-interval and union domains, arithmetic and reified constraints, backtrackable
-labeling with `ff`, `up`, and `down`, global distinctness, linear sums and scalar
-products, chains, elements, value counting, extensional tuple tables,
-lexicographic chains, serialized schedules, global cardinality with costs,
-Hamiltonian circuits, three-way comparison, and domain reflection. Its existing
-`src/clpz.js` store is now explicitly transitional: the attributed-variable layer
-is intended to support staged reuse of Markus Triska's MIT-licensed
-[Scryer `clpz.pl`](https://github.com/mthom/scryer-prolog/blob/master/src/lib/clpz.pl).
-The generic compile-time expansion blocker is now closed: normal-profile source
-loading runs module-local and `user` `term_expansion/2` and `goal_expansion/2`
-hooks, accepts clause-list expansions, preserves surrounding variable sharing,
-and provides `expand_term/2` for processor DCG lowering. EyeProlog now also
-registers the Scryer support modules needed by that source (`assoc`, `pairs`,
-`between`, `dcgs`, `terms`, `error`, `si`, `freeze`, `arithmetic`, `debug`, and
-`format`) and supplies a generic copy-on-write backtrackable blackboard. The
-remaining migration step is to vendor and load a pinned upstream `clpz.pl`, then
-establish behavioral and performance parity before removing the JS kernel. The
-migration state is tracked in [`src/CLPZ-MIGRATION.md`](src/CLPZ-MIGRATION.md).
-Until parity is reached, the JS kernel remains the active implementation so
-existing CLP(Z) behavior does not regress.
+`library(clpz)` is Markus Triska's MIT-licensed Scryer Prolog implementation of
+constraint logic programming over integers, bundled as `src/lib/clpz.pl`.
+EyeProlog executes the Prolog propagator implementation through the generic
+attributed-variable machinery in `src/term.js` and `src/atts.js`. The library
+provides relational arithmetic and reification, finite and union domains,
+labeling, all-different/all-distinct constraints, sums and scalar products,
+extensional tuple tables, lexicographic chains, serialized and cumulative
+scheduling, global cardinality with costs, Hamiltonian circuits, `disjoint2/1`,
+`automaton/3,8`, value counting, comparison, and domain reflection.
+
+The compiler services used by the library are ordinary EyeProlog facilities:
+module-local and `user` `term_expansion/2` and `goal_expansion/2`, clause-list
+expansion, and `expand_term/2` for processor DCG lowering. The same runtime also
+provides a generic copy-on-write backtrackable blackboard and the supporting
+Prolog modules `assoc`, `pairs`, `between`, `dcgs`, `terms`, `error`, `si`,
+`freeze`, `arithmetic`, `debug`, and `format`. The bundled CLP(Z) source is
+synchronized with Scryer commit `e3df91e25f8a09ee942c04e8baef553bba5c6110`,
+Git blob `806445c11e14c8b2515f3de7f309e0ac04d9ad04`.
 
 Alongside its interop entries `call_nth/2`, `time/1`, and `.../2`,
 `library(iso_ext)` also exports EyeProlog's extension relations `countall/2`,
@@ -7204,9 +7200,9 @@ mode at a time.
 | --- | --- | --- |
 | [CLP(Z) factorial](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-factorial.pl) | Declarative predecessor and product constraints propagate a factorial without mode-sensitive `is/2`. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-factorial.pl) |
 | [CLP(Z) global constraints](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-global-constraints.pl) | Compatibility tables, lexicographic and serialized schedules, global cardinality with costs, circuits, value counting, and integer comparison. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-global-constraints.pl) |
-| [CLP(Z) N-queens](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-n-queens.pl) | Eight-queens using finite domains, delayed diagonal constraints, `all_distinct/1`, and first-fail labeling, plus a small multi-solution enumeration check. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-n-queens.pl) |
+| [CLP(Z) N-queens](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-n-queens.pl) | A checked eight-queens witness using finite domains, delayed diagonal constraints, `all_distinct/1`, and first-fail labeling, plus a four-queens multi-solution search. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-n-queens.pl) |
 | [CLP(Z) resource allocation](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-resource-allocation.pl) | Resource assignment using `element/3`, `sum/3`, `scalar_product/4`, reification, labeling options, and domain reflection. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-resource-allocation.pl) |
-| [CLP(Z) Sudoku 9×9](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-sudoku-9x9.pl) | The difficult AI Escargot puzzle modeled with finite domains, 27 all-distinct constraints, and first-fail labeling. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-sudoku-9x9.pl) |
+| [CLP(Z) Sudoku 9×9](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-sudoku-9x9.pl) | The AI Escargot 9×9 model with finite domains, 27 all-distinct constraints, and first-fail labeling; the default golden verifies its known solution while `sudoku9/1` remains the search relation. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-sudoku-9x9.pl) |
 | [Combinatorics Findall Sort](https://github.com/eyereasoner/eyeprolog/blob/main/examples/combinatorics-findall-sort.pl) | Eyelet-inspired combinations example using `findall/3` and ISO `sort/2`. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/combinatorics-findall-sort.pl) |
 | [Floating Point](https://github.com/eyereasoner/eyeprolog/blob/main/examples/floating-point.pl) | Floating-point arithmetic and comparisons. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/floating-point.pl) · [proof](https://github.com/eyereasoner/eyeprolog/blob/main/examples/proof/floating-point.pl) |
 | [Atomic conversion](https://github.com/eyereasoner/eyeprolog/blob/main/examples/iso-atomic-conversion.pl) | Atom splitting, character atoms, Unicode codes, and numeric parsing. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/iso-atomic-conversion.pl) |

package/tools/report-wg17-syntax-coverage.mjs

@@ -99,10 +99,14 @@ upstream assertion.
 
 ## Current standing
 
+The percentage below is **traceability coverage**, not a conformance pass rate.
+A represented case still has to pass the executable upstream assertion in
+\`test/run-wg17.mjs\`.
+
 | Measure | Count |
 | --- | ---: |
 | Active upstream cases | ${activeIds.length} |
-| Executable EyeProlog dispositions | ${coveredIds.length} (${percentage}%) |
+| Upstream cases represented in the executable matrix | ${coveredIds.length} (${percentage}%) |
 | Not yet traced one-by-one | ${untracedIds.length} |
 | Deleted upstream identifiers | ${formatRanges(manifest.upstream.deletedIds)} |
 

package/tools/upgrade-wg17.mjs

@@ -16,6 +16,7 @@ const namedEntities = new Map([
   ['amp', '&'], ['lt', '<'], ['gt', '>'], ['quot', '"'], ['apos', "'"],
   ['nbsp', '\u00a0'], ['ndash', '–'], ['mdash', '—'], ['minus', '−'],
   ['hellip', '…'], ['middot', '·'], ['times', '×'], ['laquo', '«'], ['raquo', '»'],
+  ['sup2', '²'], ['sup3', '³'], ['deg', '°'],
 ]);
 
 export function decodeHtmlEntities(text) {
@@ -96,7 +97,7 @@ export function parseWg17SyntaxTable(html) {
     // They are not part of the Prolog source being specified, so normalize
     // them to ordinary spaces before snapshotting/comparing rows.
     const query = htmlCellText(cells[1]).replace(/\u00a0/g, ' ');
-    const expected = htmlCellText(cells[2]).replace(/\u00a0/g, ' ').replace(/[ \t\n]+/g, ' ').trim();
+    const expected = htmlCellText(cells[2]).replace(/\u00a0/g, ' ').replace(/[²³°]/g, '').replace(/[ \t\n]+/g, ' ').trim();
     if (query.length === 0 || expected.length === 0) continue;
     cases.push({ id, query, expected });
     seen.add(id);