eyeprolog 1.4.6 → 1.4.9

package/examples/deck/README.md

@@ -2,7 +2,7 @@
 
 Wide-audience companion explanations for selected runnable examples.
 
-- [Introduction to EyeProlog](https://eyereasoner.github.io/eyeprolog/examples/deck/introduction-to-eyeprolog) — a short slide deck introducing facts, rules, answers, proofs, ISO conformance, JavaScript embedding, and RDF roundtrips.
+- [Introduction to EyeProlog](https://eyereasoner.github.io/eyeprolog/examples/deck/introduction-to-eyeprolog) — a guided slide deck introducing facts, rules, answers, proofs, CLP(Z), CLP(B), ISO conformance, JavaScript embedding, RDF roundtrips, and a categorized path through the example corpus.
 - [Cross-organization data sharing](https://eyereasoner.github.io/eyeprolog/examples/deck/cross-organization-data-sharing) — ODRL/DPV sharing decisions with permit, deny, review, safeguards, and obligations.
 - [Explainable EV-depot configuration](https://eyereasoner.github.io/eyeprolog/examples/deck/explainable-ev-depot-configuration) — reversible configuration rules that select a charger, explain blockers, and derive required changes.
 - [ODRL policy reasoning](https://eyereasoner.github.io/eyeprolog/examples/deck/odrl-policy-reasoning) — permissions, prohibitions, duties, conflicts, and defaults.

package/examples/deck/introduction-to-eyeprolog.md

@@ -1,26 +1,24 @@
 ---
 marp: true
 title: Introduction to EyeProlog
-description: A short presentation introducing EyeProlog as a portable, inspectable ISO Prolog engine for answers, proofs, and RDF-backed reasoning.
+description: A short presentation introducing EyeProlog as a portable, inspectable ISO Prolog engine for answers, proofs, constraints, and RDF-backed reasoning.
 ---
 
 # Introduction to EyeProlog
 
-Portable Prolog reasoning for answers, proofs, and knowledge graphs
+Portable Prolog reasoning for answers, proofs, constraints, and knowledge graphs
+
+EyeProlog is meant to be approachable from two directions at once: it is small enough to embed in JavaScript applications, yet explicit enough that a conclusion can be explained as ordinary facts and rules.
 
 ---
 
 ## What is EyeProlog?
 
-EyeProlog is a small ISO Prolog implementation for JavaScript.
+EyeProlog is an ISO-oriented Prolog implementation for JavaScript.
 
-It turns explicit facts and rules into:
+It turns explicit facts and rules into answers, variable bindings, checked example output, optional proof traces, and embeddable reasoning in Node.js or browsers.
 
-- answers;
-- variable bindings;
-- checked example output;
-- optional proof traces;
-- embeddable reasoning in Node.js and browsers.
+The project’s emphasis is not only “can this query run?” but also “can we inspect what happened, test it again, and explain why the answer follows?” That makes EyeProlog useful for demos, documentation, knowledge-graph workflows, and applications that need a small transparent reasoning layer.
 
 ---
 
@@ -42,6 +40,8 @@ Then you ask questions:
    true.
 ```
 
+The same rule can answer a yes/no question, enumerate solutions, or participate in a larger proof. That reuse is one of the reasons Prolog remains attractive for rule-heavy software.
+
 ---
 
 ## The core idea
@@ -56,7 +56,9 @@ facts + rules + query
 answers with reasons
 ```
 
-The same rule can answer a yes/no question, enumerate solutions, or participate in a larger proof.
+A query is not just a function call. It is a logical request: “find values that make this relation true.” EyeProlog searches by unifying terms, trying clauses, and backtracking over alternatives.
+
+Because the input remains ordinary Prolog text, the boundary between data, rules, and answers stays inspectable.
 
 ---
 
@@ -78,6 +80,8 @@ Try a list query:
 ;  X = logic.
 ```
 
+The semicolon asks for another answer. This small interaction already shows the Prolog execution model: a relation can produce more than one solution.
+
 ---
 
 ## Programs are ordinary text
@@ -97,6 +101,8 @@ Run it:
 eyeprolog examples/socrates.pl
 ```
 
+The examples directory uses this same pattern at larger scale. Each runnable example has checked output, so examples are not just illustrative snippets; they are part of the release gate.
+
 ---
 
 ## Proofs are first-class
@@ -107,12 +113,9 @@ EyeProlog can show not only *what* was concluded, but *why*.
 eyeprolog --proof examples/socrates.pl
 ```
 
-Proof output is useful for:
+Proof output is useful for debugging rules, explaining decisions, preserving audit trails, and keeping documentation honest. If a proof-producing example changes, the checked proof output changes too.
 
-- debugging rules;
-- explaining decisions;
-- regression tests;
-- audit trails.
+This is especially helpful when rules encode policies, risk decisions, or derived knowledge where the explanation matters as much as the final answer.
 
 ---
 
@@ -120,23 +123,44 @@ Proof output is useful for:
 
 EyeProlog starts from ISO/IEC 13211-1 Prolog.
 
-That matters because facts, rules, terms, control, errors, streams, arithmetic, and meta-calls have an external reference point.
+That matters because facts, rules, terms, control, errors, streams, arithmetic, and meta-calls have an external reference point. Strict ISO mode keeps that standardized core separate and testable.
+
+Normal mode adds practical libraries and embedding features. The design goal is to keep extensions visible rather than hiding them inside an undocumented dialect.
+
+---
+
+## Constraints over integers: CLP(Z)
 
-Normal mode adds practical libraries and embedding features. Strict ISO mode keeps the standardized core separate and testable.
+`library(clpz)` lets programs state relations over integers instead of manually enumerating arithmetic cases.
+
+```prolog
+:- use_module(library(clpz)).
+
+?- X #>= 1, X #=< 4, Y #= X*X, labeling([X]).
+   X = 1, Y = 1
+;  X = 2, Y = 4
+;  X = 3, Y = 9
+;  X = 4, Y = 16.
+```
+
+This style is useful when you know the constraints before you know the values: scheduling, allocation, Sudoku, finite-domain puzzles, resource planning, and arithmetic search.
 
 ---
 
-## Why JavaScript?
+## Constraints over Booleans: CLP(B)
 
-EyeProlog runs where modern applications already run:
+`library(clpb)` provides Boolean constraints with satisfiability, cardinality, counting, and optimization predicates.
+
+```prolog
+:- use_module(library(clpb)).
+
+?- sat(card([2], [A,B,C,D]) * (A =< C) * (B # D)),
+   labeling([A,B,C,D]).
+```
 
-- command-line tools;
-- npm packages;
-- browser playgrounds;
-- web workers;
-- JavaScript APIs.
+The recent CLP(B) examples show several practical shapes: circuit verification, quorum constraints, feature-model counting, and weighted release planning.
 
-The aim is not to replace every Prolog system. It is to make portable Prolog reasoning easy to embed and inspect.
+Boolean constraints are compact when the domain is “on/off”, “selected/not selected”, “permitted/denied”, or “feature enabled/disabled”.
 
 ---
 
@@ -154,56 +178,79 @@ RDF dataset
 
 RDF remains the interchange layer. Prolog remains the transparent reasoning layer.
 
+This is useful when a knowledge graph needs explicit derivation rules, but the data should still move in and out as RDF rather than as a private in-memory structure.
+
 ---
 
-## What this enables
+## Categorized examples: start here
 
-The example suite uses the same pattern for:
+The example corpus is intentionally broad. A practical path through it is:
 
-- policy decisions;
-- incident response;
-- software supply-chain risk;
-- scientific evidence assessment;
-- EV-depot configuration;
-- symbiotic human/AI/knowledge-graph workflows.
+- **First steps:** `socrates.pl`, `ancestor.pl`, `list-collection.pl`.
+- **Algorithms:** graph reachability, Dijkstra, parser, FFT, SAT/DPLL.
+- **Integer constraints:** CLP(Z) queens, Sudoku, resource allocation.
+- **Boolean constraints:** CLP(B) circuits, cardinality, feature models, planning.
+- **Policies and decisions:** access control, ODRL, GDPR, trust flow.
+- **RDF roundtrips:** symbiotic knowledge graph and domain-specific RDF scenarios.
+- **Proofs:** examples with checked `--proof` output.
 
-Each scenario keeps data, rules, answers, and materialized results as separate inspectable artifacts.
+Use the [playground](https://eyereasoner.github.io/eyeprolog/playground) for quick exploration, or browse the [examples source tree](https://github.com/eyereasoner/eyeprolog/tree/main/examples) when you want to inspect the program and golden output side by side.
 
 ---
 
-## Testing and conformance
+## Example path: constraints
+
+For constraint reasoning, start with the small examples and move outward:
+
+- `clpz-n-queens.pl` shows finite-domain search.
+- `clpz-sudoku-9x9.pl` shows a familiar grid problem.
+- `clpz-resource-allocation.pl` shows planning under resource limits.
+- `clpb-boolean-circuit.pl` shows Boolean verification.
+- `clpb-cardinality.pl` shows exact-count selection.
+- `clpb-feature-model.pl` and `clpb-weighted-planning.pl` show product/release decisions.
+
+Together these examples show that Prolog can describe a problem declaratively while constraint libraries do the propagation and search work.
+
+---
+
+## Example path: knowledge graphs
+
+For RDF-backed reasoning, start with [Symbiotic Knowledge Graphs](https://eyereasoner.github.io/eyeprolog/examples/deck/symbiotic-knowledge-graphs).
 
-EyeProlog’s release gate includes:
+Then explore the scenario decks:
 
-- file-based conformance cases;
-- strict ISO tests;
-- WG17 syntax cases;
-- regression tests;
-- runnable examples;
-- proof examples;
-- documentation synchronization checks.
+- [Cross-organization data sharing](https://eyereasoner.github.io/eyeprolog/examples/deck/cross-organization-data-sharing)
+- [Explainable EV-depot configuration](https://eyereasoner.github.io/eyeprolog/examples/deck/explainable-ev-depot-configuration)
+- [Operational incident response](https://eyereasoner.github.io/eyeprolog/examples/deck/operational-incident-response)
+- [SBOM vulnerability response](https://eyereasoner.github.io/eyeprolog/examples/deck/sbom-vulnerability-response)
+- [Scientific evidence graph](https://eyereasoner.github.io/eyeprolog/examples/deck/scientific-evidence-graph)
+
+Each scenario keeps source RDF, Prolog rules, generated Prolog, and output RDF as separate artifacts.
+
+---
+
+## Testing and conformance
+
+EyeProlog’s release gate includes conformance cases, strict ISO tests, WG17 syntax cases, regression tests, runnable examples, proof examples, and documentation synchronization checks.
 
 The point is simple: behavior should be reproducible, not anecdotal.
 
+The examples are also linted for avoidable singleton-variable warnings. This keeps example code clean for users who run examples through stricter tooling or compare with other Prolog systems.
+
 ---
 
 ## When EyeProlog fits
 
-EyeProlog is a good fit when a project needs:
+EyeProlog is a good fit when a project needs explicit rules, inspectable conclusions, portable Prolog syntax, an embeddable JavaScript runtime, checked examples and proofs, and a clean boundary between data, rules, and results.
 
-- explicit rules;
-- inspectable conclusions;
-- portable Prolog syntax;
-- embeddable JavaScript runtime;
-- checked examples and proofs;
-- a clean boundary between data, rules, and results.
+It is not trying to replace high-performance native Prolog systems. Its niche is transparent reasoning that can live close to JavaScript applications, documentation, and web-accessible demos.
 
 ---
 
 ## Where to go next
 
 - Read [project README](https://github.com/eyereasoner/eyeprolog#readme) for setup and links.
-- Read [Why EyeProlog?](https://eyereasoner.github.io/eyeprolog/why-eyeprolog) for the design motivation.
 - Open [EyeProlog playground](https://eyereasoner.github.io/eyeprolog/playground) to run examples in a browser.
-- Explore [runnable examples](https://github.com/eyereasoner/eyeprolog/tree/main/examples) for runnable programs.
+- Browse [runnable examples](https://github.com/eyereasoner/eyeprolog/tree/main/examples) by category or filename.
+- Read [Why EyeProlog?](https://eyereasoner.github.io/eyeprolog/why-eyeprolog) for the design motivation.
 - Read [The Art of EyeProlog](https://eyereasoner.github.io/eyeprolog/the-art-of-eyeprolog) for the full reference.

package/package.json

@@ -3,7 +3,7 @@
   "publishConfig": {
     "access": "public"
   },
-  "version": "1.4.6",
+  "version": "1.4.9",
   "description": "EyeProlog turns facts and rules into answers and proofs.",
   "type": "module",
   "main": "./index.js",

package/src/cli.js

@@ -154,6 +154,7 @@ export async function main(argv) {
     isoStrict: options.isoStrict,
     autoload: options.autoload,
     autoloadGoals: options.goals,
+    onWarning: printSourceWarning,
   });
 
   const portabilityFailures = program.interopPortabilityWarnings ?? [];
@@ -271,6 +272,13 @@ function readStdin() {
   });
 }
 
+
+function printSourceWarning(warning) {
+  if (warning.kind !== 'singleton') return;
+  process.stderr.write(`Warning: singleton: ${warning.name}, near ${warning.filename}:${warning.line}
+`);
+}
+
 function printWarnings(program) {
   for (const warning of program.interopPortabilityWarnings ?? []) {
     if (warning.kind === 'library') {

package/src/parser.js

@@ -246,6 +246,8 @@ class Parser {
     this.anonymous = 0;
     this.variables = new Map();
     this.sourceMetadata = options.sourceMetadata !== false;
+    this.onWarning = typeof options.onWarning === 'function' ? options.onWarning : null;
+    this.currentSourceTermLine = 1;
     this.strictIso = options.isoStrict === true;
     this.parserFlagState = options.parserFlagState ?? {
       doubleQuotes: options.doubleQuotes ?? 'chars',
@@ -1010,9 +1012,14 @@ class Parser {
   parseProgram(emit = null) {
     const clauses = emit ? null : [];
     let clauseNumber = 0;
-    const accept = emit ?? ((clause) => clauses.push(clause));
+    const rawAccept = emit ?? ((clause) => clauses.push(clause));
+    const accept = (item) => {
+      reportClauseSingletonWarnings(item, this.onWarning, this.filename, this.currentSourceTermLine);
+      rawAccept(item);
+    };
     while (this.token.type !== TOK.EOF) {
       const line = this.token.line;
+      this.currentSourceTermLine = line;
       // Prefix operator notation needs one program-level distinction so
       // a comma in `?- A, B.` remains inside the query rather than outside the
       // prefix term. Ordinary functional notation is parsed as a term and then
@@ -1226,6 +1233,29 @@ function listAtomNames(term) {
 }
 
 
+function collectClauseVariableOccurrences(term, counts) {
+  if (term == null) return;
+  if (term.type === 'var') {
+    counts.set(term.name, (counts.get(term.name) ?? 0) + 1);
+    return;
+  }
+  if (term.type === COMPOUND) {
+    for (const arg of term.args) collectClauseVariableOccurrences(arg, counts);
+  }
+}
+
+function reportClauseSingletonWarnings(clause, onWarning, filename, line) {
+  if (typeof onWarning !== 'function' || clause?.kind === 'quad') return;
+  const counts = new Map();
+  collectClauseVariableOccurrences(clause.head, counts);
+  for (const goal of clause.body ?? []) collectClauseVariableOccurrences(goal, counts);
+  for (const [name, count] of counts) {
+    if (count !== 1 || String(name).startsWith('_')) continue;
+    onWarning({ kind: 'singleton', name, filename: filename ?? '<input>', line });
+  }
+}
+
+
 export function parseClauses(source, options = {}) {
   const ownsParserFlagState = options.parserFlagState == null;
   const initialDoubleQuotes = options.doubleQuotes ?? 'chars';
@@ -1282,6 +1312,7 @@ function parseClausesFastNoSource(source, emit = null, emitBinary = null, option
   const accept = emit ?? ((clause) => clauses.push(clause));
   let anonymous = 0;
   let chunk = '';
+  let chunkStartLine = 1;
 
   const cached = (cache, key, create) => {
     const existing = cache.get(key);
@@ -1466,12 +1497,42 @@ function parseClausesFastNoSource(source, emit = null, emitBinary = null, option
     return -1;
   };
 
-  const emitFastBinaryRange = (text, start, end) => {
+  const reportFastBinarySingletonWarnings = (head, body, line) => {
+    if (typeof options.onWarning !== 'function') return;
+    const variables = [];
+    const add = (type, name) => {
+      if (type !== 'var' || String(name).startsWith('_')) return;
+      variables.push(name);
+    };
+    add(head.arg0Type, head.arg0Name);
+    add(head.arg1Type, head.arg1Name);
+    if (body != null) {
+      add(body.arg0Type, body.arg0Name);
+      add(body.arg1Type, body.arg1Name);
+    }
+    for (let i = 0; i < variables.length; i++) {
+      let count = 0;
+      for (let j = 0; j < variables.length; j++) {
+        if (variables[i] === variables[j]) count++;
+      }
+      if (count === 1) {
+        options.onWarning({
+          kind: 'singleton',
+          name: variables[i],
+          filename: options.filename ?? '<input>',
+          line,
+        });
+      }
+    }
+  };
+
+  const emitFastBinaryRange = (text, start, end, line) => {
     if (!emitBinary || start >= end || text.charCodeAt(end - 1) !== 46) return false;
     const termEnd = end - 1;
     const rule = findRuleInRange(text, start, termEnd);
     if (rule < 0) {
       if (!parseBinaryRawRange(text, start, termEnd, rawHead)) return false;
+      reportFastBinarySingletonWarnings(rawHead, null, line);
       emitBinary(rawHead.name,
         rawHead.arg0Type, rawHead.arg0Name, rawHead.arg1Type, rawHead.arg1Name,
         null, null, null, null, null);
@@ -1480,6 +1541,7 @@ function parseClausesFastNoSource(source, emit = null, emitBinary = null, option
     if (findRuleInRange(text, rule + 2, termEnd) >= 0 ||
         !parseBinaryRawRange(text, start, rule, rawHead) ||
         !parseBinaryRawRange(text, rule + 2, termEnd, rawBody)) return false;
+    reportFastBinarySingletonWarnings(rawHead, rawBody, line);
     emitBinary(rawHead.name,
       rawHead.arg0Type, rawHead.arg0Name, rawHead.arg1Type, rawHead.arg1Name,
       rawBody.name, rawBody.arg0Type, rawBody.arg0Name, rawBody.arg1Type, rawBody.arg1Name);
@@ -1541,6 +1603,7 @@ function parseClausesFastNoSource(source, emit = null, emitBinary = null, option
 
   const flush = () => {
     const text = chunk.trim();
+    const sourceLine = chunkStartLine;
     chunk = '';
     if (!text) return true;
     // Once a preparation-time char_conversion/2 mapping is active, every
@@ -1549,11 +1612,15 @@ function parseClausesFastNoSource(source, emit = null, emitBinary = null, option
     // here would silently bypass Convc for otherwise simple clauses.
     const simple = preparationConversionActive() ? null : parseSimple(text);
     if (simple) {
+      reportClauseSingletonWarnings(simple, options.onWarning, options.filename ?? '<input>', sourceLine);
       accept(simple);
       return true;
     }
     try {
-      const parsed = new Parser(text, { ...options, sourceMetadata: false }).parseProgram();
+      const nestedWarning = typeof options.onWarning === 'function'
+        ? (warning) => options.onWarning({ ...warning, line: warning.line + sourceLine - 1 })
+        : null;
+      const parsed = new Parser(text, { ...options, sourceMetadata: false, onWarning: nestedWarning }).parseProgram();
       for (const clause of parsed) accept(clause);
       return true;
     } catch (_) {
@@ -1562,6 +1629,7 @@ function parseClausesFastNoSource(source, emit = null, emitBinary = null, option
   };
 
   let lineStart = 0;
+  let lineNumber = 1;
   while (lineStart <= source.length) {
     let lineEnd = source.indexOf('\n', lineStart);
     if (lineEnd < 0) lineEnd = source.length;
@@ -1571,17 +1639,21 @@ function parseClausesFastNoSource(source, emit = null, emitBinary = null, option
     [contentStart, contentEnd] = trimRange(source, contentStart, contentEnd);
     if (contentStart < contentEnd && source.charCodeAt(contentStart) !== 37) {
       if (!chunk && source.charCodeAt(contentEnd - 1) === 46 && !preparationConversionActive()) {
-        if (emitFastBinaryRange(source, contentStart, contentEnd)) {
+        if (emitFastBinaryRange(source, contentStart, contentEnd, lineNumber)) {
           // The program builder accepted a compact binary clause directly.
         } else {
           const simple = parseFastRange(source, contentStart, contentEnd);
-          if (simple) accept(simple);
-          else {
+          if (simple) {
+            reportClauseSingletonWarnings(simple, options.onWarning, options.filename ?? '<input>', lineNumber);
+            accept(simple);
+          } else {
+            chunkStartLine = lineNumber;
             chunk = source.slice(lineStart, lineEnd) + '\n';
             if (!flush()) return null;
           }
         }
       } else {
+        if (!chunk) chunkStartLine = lineNumber;
         chunk += source.slice(lineStart, lineEnd) + '\n';
         if (source.charCodeAt(contentEnd - 1) === 46) {
           if (!flush()) return null;
@@ -1590,6 +1662,7 @@ function parseClausesFastNoSource(source, emit = null, emitBinary = null, option
     }
     if (lineEnd === source.length) break;
     lineStart = lineEnd + 1;
+    lineNumber++;
   }
   if (chunk.trim() && !flush()) return null;
   return clauses ?? true;

package/src/program.js

@@ -1390,7 +1390,7 @@ function readModuleSource(designation, options) {
     return {
       name,
       text: registered.source,
-      options: { ...options, filename: registered.filename, baseDir: 'src/lib' },
+      options: { ...options, filename: registered.filename, baseDir: 'src/lib', onWarning: null },
     };
   }
   if (designation.type !== ATOM) throw new PrologError('type_error(source_sink)', designation);

package/test/run-examples.mjs

@@ -214,6 +214,11 @@ function runProgramExample(programFile, filename, options) {
   const expectedExit = text.match(/^%\s*expect-exit:\s*(\d+)\s*$/m);
   const program = Program.parseSources([{ text, filename }], {
     sourceMetadata: options.proof,
+    onWarning: (warning) => {
+      if (warning.kind === 'singleton') {
+        process.stderr.write(`Warning: singleton: ${warning.name}, near ${warning.filename}:${warning.line}\n`);
+      }
+    },
   });
   try {
     const result = run(program, { ...options, goals: goalsInProgramOrder(program, text) });

package/test/run-regression.mjs

@@ -45,7 +45,7 @@ import {
   variantTerms,
   parseProgramText,
 } from '../src/index.js';
-import { ISO_OPERATOR_DEFINITIONS, parseGoalText, parseNumberTokenText } from '../src/parser.js';
+import { ISO_OPERATOR_DEFINITIONS, parseGoalText, parseNumberTokenText, tryParseClausesFastInto } from '../src/parser.js';
 import { PrologError, formalErrorTerm } from '../src/iso.js';
 import { compareTerms } from '../src/term.js';
 import { formatTermForWrite } from '../src/write.js';
@@ -4062,6 +4062,38 @@ child.stdin.write(\`consult(${consultedAtom}).\\n\`);
         assertIncludes(result.stderr, '/(member, 2)', 'stderr');
       },
     },
+    {
+      name: 'CLI reports singleton source variables without a corpus-wide warning scan',
+      run: () => {
+        const input = 'p(X, Once, _Ignored, _) :- q(X).\nq(a).\n';
+        const result = runCli(['-'], { input });
+        assertEqual(result.status, 0, 'exit status');
+        assertEqual(result.stdout, '', 'stdout');
+        assertEqual(result.stderr, 'Warning: singleton: Once, near <stdin>:1\n', 'stderr');
+      },
+    },
+    {
+      name: 'singleton warnings preserve the compact binary parser path',
+      run: () => {
+        const clauses = [];
+        const binary = [];
+        const warnings = [];
+        const parsed = tryParseClausesFastInto(
+          'p(X,Y) :- q(X,a).\n',
+          (clause) => clauses.push(clause),
+          (...args) => binary.push(args),
+          { filename: 'fast.pl', onWarning: (warning) => warnings.push(warning) },
+        );
+        assertEqual(parsed, true, 'fast parse result');
+        assertEqual(clauses.length, 0, 'materialized clause count');
+        assertEqual(binary.length, 1, 'direct binary clause count');
+        assertEqual(warnings.length, 1, 'warning count');
+        assertEqual(warnings[0].kind, 'singleton', 'warning kind');
+        assertEqual(warnings[0].name, 'Y', 'warning variable');
+        assertEqual(warnings[0].filename, 'fast.pl', 'warning filename');
+        assertEqual(warnings[0].line, 1, 'warning line');
+      },
+    },
     {
       name: '--warnings flags explicit library(prologue) dependencies',
       run: () => {
@@ -4647,6 +4679,7 @@ child.stdin.write(\`consult(${consultedAtom}).\\n\`);
 }
 
 
+
 function documentationSyncCases() {
   return [
     {