eyeling 1.15.9 → 1.15.11

package/HANDBOOK.md

@@ -376,6 +376,10 @@ That’s alpha-equivalence:
 
 Eyeling implements alpha-equivalence by checking whether there exists a consistent renaming mapping between the two formulas’ variables/blanks that makes the triples match.
 
+Important scope nuance: only blanks/variables that are local to the quoted formula participate in alpha-renaming. If a formula is being matched after an outer substitution has already instantiated part of it, those substituted terms are treated as fixed. In other words, alpha-equivalence may rename formula-local placeholders, but it must not rename names that came from the enclosing match. This prevents a substituted outer blank node from being confused with a local blank node inside the quoted formula.
+
+So `{ _:x :p :o }` obtained by substituting `?A = _:x` into `{ ?A :p :o }` must not alpha-match `{ _:b :p :o }` by renaming `_:x` to `_:b`.
+
 ### 6.2 Groundness: “variables inside formulas don’t leak”
 
 Eyeling makes a deliberate choice about _groundness_:

package/README.md

@@ -1,5 +1,7 @@
 # eyeling
 
+[![npm version](https://img.shields.io/npm/v/eyereasoner.svg)](https://www.npmjs.com/package/eyereasoner) [![DOI](https://zenodo.org/badge/581706557.svg)](https://doi.org/10.5281/zenodo.19068086)
+
 A compact [Notation3 (N3)](https://notation3.org/) reasoner in **JavaScript**.
 
 - Single self-contained bundle (`eyeling.js`), no external runtime dependencies

package/examples/deck/faltings-genus2-finiteness.md

@@ -0,0 +1,211 @@
+# Faltings’ theorem (emulated) in Notation3: a genus‑2 curve over Q
+
+This deck explains the example `faltings-genus2-finiteness.n3` ([Playground][1]).
+
+The goal is to show—at a friendly, “wide audience” level—how an N3 file can _model_ a famous mathematical implication:
+
+> “If a curve has genus ≥ 2, then it has only finitely many rational points.”
+
+---
+
+## The problem in plain language
+
+People often ask:
+
+> “Which solutions can an equation have if you only allow fractions?”
+
+A **rational point** means a solution where the coordinates are rational numbers (fractions like 3/7).
+
+Some equations have **infinitely many** rational points. Others have **only finitely many**.
+
+This example is about expressing the “only finitely many” conclusion as a machine-checkable **rule**.
+
+---
+
+## The concrete curve in this example
+
+We model this curve:
+
+\[ y^2 = x(x+1)(x-2)(x+2)(x-3) \]
+
+You can spot some obvious rational solutions just by making the right-hand side zero:
+
+- (0, 0)
+- (-1, 0)
+- (2, 0)
+- (-2, 0)
+- (3, 0)
+
+The file includes these as example data points.
+
+---
+
+## What is “genus” (without the heavy math)?
+
+A good mental model is:
+
+- **genus 0**: sphere-like (0 holes)
+- **genus 1**: donut-like (1 hole)
+- **genus 2**: “two-hole donut”
+- **genus ≥ 2**: more complicated surfaces
+
+In algebraic geometry, _genus_ is a deep invariant, but for this deck you only need:
+
+> genus is a number that measures how “holey” a curve is.
+
+---
+
+## The famous implication (Faltings’ theorem)
+
+Very roughly:
+
+- For genus 0: rational points are “none or infinite”
+- For genus 1: rational points can be infinite, but structured (elliptic curves)
+- For genus ≥ 2: rational points are **finite**
+
+Faltings proved (in 1983) the last bullet (formerly the Mordell conjecture).
+
+---
+
+## What this N3 example _does_
+
+It does **not** re-prove the theorem.
+
+Instead, it treats “Faltings’ theorem” as a named rule:
+
+- If something is a curve,
+- over a number field,
+- with genus ≥ 2,
+- then infer: “its rational points are finite.”
+
+That’s the kind of modeling you do when you want a reasoner to apply well-known results reliably.
+
+---
+
+## Why this is useful (even though it’s an emulation)
+
+Think of it like a _library function_.
+
+You may not re-derive calculus every time you compute a derivative; you rely on a trusted rule.
+
+Similarly, you can:
+
+- store curve facts as data,
+- encode trusted theorems as rules,
+- and let a reasoner apply them consistently.
+
+---
+
+## N3 in one minute
+
+N3 is RDF + rules.
+
+- **Facts** look like triples:
+  - `:C :genus 2.`
+- **Rules** look like:
+  - `{ ... } => { ... } .`
+
+Variables start with `?`, like `?curve`, `?g`.
+
+---
+
+## The data section (what we assert)
+
+The file asserts:
+
+```n3
+:C a :Curve ;
+   :equation "y^2 = x(x+1)(x-2)(x+2)(x-3)" ;
+   :definedOver :Q ;
+   :genus 2 .
+```
+
+And it also asserts that `:Q` is a `:NumberField`, plus a few sample points.
+
+---
+
+## The rule section (the “theorem” as logic)
+
+Here is the core rule (lightly formatted):
+
+```n3
+{
+  ?curve a :Curve ;
+         :definedOver ?field ;
+         :genus ?g .
+  ?field a :NumberField .
+  ?g math:notLessThan 2 .
+}
+=>
+{
+  ?curve :coveredBy :FaltingsTheorem ;
+         :hasRationalPointsCardinality :Finite .
+} .
+```
+
+That `math:notLessThan` is a standard N3 math builtin: it means “≥”.
+
+---
+
+## What gets inferred
+
+Once a reasoner sees the facts:
+
+- `:C a :Curve`
+- `:C :definedOver :Q`
+- `:C :genus 2`
+- `:Q a :NumberField`
+
+…the rule fires and it can derive:
+
+```n3
+:C :hasRationalPointsCardinality :Finite .
+:C :coveredBy :FaltingsTheorem .
+```
+
+There’s also a small follow-on rule that derives a friendlier Boolean:
+
+```n3
+:C :doesNotHaveInfinitelyManyRationalPoints true .
+```
+
+---
+
+## Important: what it does _not_ compute
+
+This file does **not** find all rational points.
+
+Faltings’ theorem is about **finiteness**, not an explicit list.
+
+So the example’s job is:
+
+- represent the curve,
+- represent the theorem as a rule,
+- and show that the reasoner can draw the finiteness conclusion.
+
+---
+
+## Try it
+
+### In your browser
+
+Use the playground link at the top: [Playground][1].
+
+### On the command line
+
+```bash
+eyeling faltings-genus2-finiteness.n3
+```
+
+---
+
+## Where you can take this next
+
+Easy extensions:
+
+- Add more example curves with different genera
+- Add rules that _classify_ genus based on curve families (toy versions)
+- Connect this to a small “math knowledge base” of reusable lemmas
+- Use the same pattern for other theorems: “if conditions, then property”
+
+[1]: https://eyereasoner.github.io/eyeling/demo?url=https://raw.githubusercontent.com/eyereasoner/eyeling/refs/heads/main/examples/faltings-genus2-finiteness.n3 'Playground'

package/examples/faltings-genus2-finiteness.n3

@@ -0,0 +1,69 @@
+# ==================================================================
+# File: faltings-genus2-finiteness.n3
+# Purpose:
+#   Encode a simple Notation3 example inspired by Faltings' theorem.
+#
+# Mathematical content:
+#   The curve
+#     y^2 = x(x+1)(x-2)(x+2)(x-3)
+#   is treated as a genus-2 curve over Q.
+#   By an N3 rule that emulates Faltings' theorem,
+#   any curve over a number field with genus >= 2
+#   is inferred to have only finitely many rational points.
+#
+# Notes:
+#   - This file is a logical emulation, not a formal proof.
+#   - Several explicit rational points are included as examples.
+# ==================================================================
+
+@prefix :     <http://example.org/faltings#> .
+@prefix xsd:  <http://www.w3.org/2001/XMLSchema#> .
+@prefix math: <http://www.w3.org/2000/10/swap/math#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+
+# --- the example curve ---
+:C
+    a :Curve ;
+    :equation "y^2 = x(x+1)(x-2)(x+2)(x-3)" ;
+    :definedOver :Q ;
+    :genus 2 ;
+    rdfs:label "Example genus-2 curve" .
+
+:Q a :NumberField ;
+   rdfs:label "the rationals" .
+
+:FaltingsTheorem
+    a :Theorem ;
+    rdfs:label "If a curve over a number field has genus >= 2, then it has finitely many rational points." .
+
+:Finite a :CardinalityClass .
+
+# --- some explicit rational points on the curve ---
+:P0  a :RationalPoint ; :onCurve :C ; :x  0 ; :y 0 .
+:P1  a :RationalPoint ; :onCurve :C ; :x -1 ; :y 0 .
+:P2  a :RationalPoint ; :onCurve :C ; :x  2 ; :y 0 .
+:P3  a :RationalPoint ; :onCurve :C ; :x -2 ; :y 0 .
+:P4  a :RationalPoint ; :onCurve :C ; :x  3 ; :y 0 .
+
+# --- emulation of Faltings' theorem ---
+{
+    ?curve a :Curve ;
+           :definedOver ?field ;
+           :genus ?g .
+    ?field a :NumberField .
+    ?g math:notLessThan 2 .
+}
+=>
+{
+    ?curve :coveredBy :FaltingsTheorem ;
+           :hasRationalPointsCardinality :Finite .
+} .
+
+# --- optional derived statement ---
+{
+    ?curve :hasRationalPointsCardinality :Finite .
+}
+=>
+{
+    ?curve :doesNotHaveInfinitelyManyRationalPoints true .
+} .

package/examples/french-cities.n3

@@ -29,3 +29,5 @@
 # OWL rules
 {?P a owl:TransitiveProperty. ?S ?P ?X. ?X ?P ?O.} => {?S ?P ?O}.
 
+# query
+{?C :path :nantes} log:query {?C :path :nantes}.

package/examples/jsonterm-advanced.n3

@@ -0,0 +1,92 @@
+# =================================================================
+# More advanced jsonterm example.
+#
+# Mapping used:
+# - JSON objects become anonymous node structures.
+# - JSON arrays become N3 lists.
+# - JSON null becomes a normal symbol here, j:null.
+# - JSON booleans become ordinary boolean literals: true and false.
+# =================================================================
+
+@prefix ex: <https://example.org/#> .
+@prefix j: <https://example.org/json#> .
+
+[
+  j:id "user-101";
+  j:profile [
+    j:name "Alice";
+    j:active true;
+    j:address [
+      j:city "Ghent";
+      j:country "BE"
+    ]
+  ];
+  j:roles ("admin" "editor");
+  j:preferences [
+    j:languages ("nl" "fr" "en");
+    j:theme "dark";
+    j:beta false
+  ];
+  j:orders (
+    [
+      j:id "ord-1";
+      j:total 125;
+      j:items ("book" "pen")
+    ]
+    [
+      j:id "ord-2";
+      j:total 45;
+      j:items ("notebook");
+      j:coupon j:null
+    ]
+  )
+] ex:kind j:UserDocument .
+
+{
+  ?Doc ex:kind j:UserDocument .
+  ?Doc j:profile [
+    j:name ?Name;
+    j:active true;
+    j:address [ j:country "BE" ]
+  ] .
+}
+=>
+{
+  ?Doc ex:userName ?Name .
+  ?Doc ex:eligibleForReview true .
+} .
+
+{
+  ?Doc j:preferences [
+    j:languages ("nl" "fr" "en");
+    j:theme "dark";
+    j:beta false
+  ] .
+}
+=>
+{
+  ?Doc ex:profileTag "multilingual-dark-profile" .
+} .
+
+{
+  ?Doc j:orders (
+    [ j:id ?FirstId; j:total 125; j:items ("book" "pen") ]
+    [ j:id ?SecondId; j:total 45; j:items ("notebook"); j:coupon j:null ]
+  ) .
+}
+=>
+{
+  ?Doc ex:hasHighValueStarterOrder true .
+  ?Doc ex:hasCouponlessFollowup true .
+} .
+
+{
+  ?Doc ex:eligibleForReview true .
+  ?Doc ex:profileTag "multilingual-dark-profile" .
+  ?Doc ex:hasHighValueStarterOrder true .
+  ?Doc ex:hasCouponlessFollowup true .
+}
+=>
+{
+  ex:test ex:is true .
+} .

package/examples/jsonterm.n3

@@ -0,0 +1,37 @@
+# =================================================
+# jsonterm example
+#
+# Mapping used:
+# - JSON objects become anonymous node structures.
+# - JSON arrays become N3 lists.
+# - JSON null becomes a normal symbol here, j:null.
+# =================================================
+
+@prefix ex: <https://example.org/#> .
+@prefix j: <https://example.org/json#> .
+
+[
+  j:user "alice";
+  j:roles ("admin" j:null)
+]
+("likes" 1)
+[
+  j:city "Paris";
+  j:coords (2.35 48.85)
+] .
+
+{
+  [
+    j:user ?U;
+    j:roles ("admin" j:null)
+  ]
+  ("likes" 1)
+  [
+    j:city "Paris";
+    j:coords (2.35 48.85)
+  ] .
+}
+=>
+{
+  ex:test ex:is true .
+} .

package/examples/output/faltings-genus2-finiteness.n3

@@ -0,0 +1,5 @@
+@prefix : <http://example.org/faltings#> .
+
+:C :coveredBy :FaltingsTheorem .
+:C :hasRationalPointsCardinality :Finite .
+:C :doesNotHaveInfinitelyManyRationalPoints true .

package/examples/output/french-cities.n3

@@ -1,23 +1,6 @@
 @prefix : <http://www.agfa.com/w3c/euler/graph.axiom#> .
 
-:paris :path :orleans .
-:paris :path :chartres .
-:paris :path :amiens .
-:orleans :path :blois .
-:orleans :path :bourges .
-:blois :path :tours .
-:chartres :path :lemans .
-:lemans :path :angers .
-:lemans :path :tours .
 :angers :path :nantes .
-:paris :path :blois .
-:paris :path :bourges .
-:paris :path :lemans .
-:orleans :path :tours .
-:chartres :path :angers .
-:chartres :path :tours .
-:lemans :path :nantes .
-:paris :path :tours .
-:paris :path :angers .
 :chartres :path :nantes .
+:lemans :path :nantes .
 :paris :path :nantes .

package/examples/output/jsonterm-advanced.n3

@@ -0,0 +1,8 @@
+@prefix ex: <https://example.org/#> .
+
+_:b1 ex:userName "Alice" .
+_:b1 ex:eligibleForReview true .
+_:b1 ex:profileTag "multilingual-dark-profile" .
+_:b1 ex:hasHighValueStarterOrder true .
+_:b1 ex:hasCouponlessFollowup true .
+ex:test ex:is true .

package/examples/output/jsonterm.n3

@@ -0,0 +1,3 @@
+@prefix ex: <https://example.org/#> .
+
+ex:test ex:is true .

package/eyeling.js

@@ -110,6 +110,35 @@ function makeBuiltins(deps) {
   return { evalBuiltin, isBuiltinPred };
 }
 
+function __builtinCollectVarsInTerm(t, out) {
+  if (t instanceof Var) {
+    out.add(t.name);
+    return;
+  }
+  if (t instanceof ListTerm) {
+    for (const e of t.elems) __builtinCollectVarsInTerm(e, out);
+    return;
+  }
+  if (t instanceof OpenListTerm) {
+    for (const e of t.prefix) __builtinCollectVarsInTerm(e, out);
+    out.add(t.tailVar);
+    return;
+  }
+  if (t instanceof GraphTerm) {
+    for (const tr of t.triples) __builtinCollectVarsInTriple(tr, out);
+  }
+}
+
+function __builtinCollectVarsInTriple(tr, out) {
+  __builtinCollectVarsInTerm(tr.s, out);
+  __builtinCollectVarsInTerm(tr.p, out);
+  __builtinCollectVarsInTerm(tr.o, out);
+}
+
+function __builtinCollectVarsInTriples(triples, out) {
+  for (const tr of triples) __builtinCollectVarsInTriple(tr, out);
+}
+
 function literalHasLangTag(lit) {
   // True iff the literal is a quoted string literal with a language tag suffix,
   // e.g. "hello"@en or """hello"""@en.
@@ -3040,6 +3069,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
     if (!(g.o instanceof GraphTerm)) return [];
 
     const visited2 = [];
+    const keepVars = new Set();
+    if (g.s instanceof GraphTerm) __builtinCollectVarsInTriples(g.s.triples, keepVars);
     // Start from the incoming substitution so bindings flow outward.
     return proveGoals(
       Array.from(g.o.triples),
@@ -3050,6 +3081,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
       visited2,
       varGen,
       maxResults,
+      keepVars.size ? { keepVars } : undefined,
     );
   }
 
@@ -5352,27 +5384,80 @@ function triplesListEqual(xs, ys) {
   return true;
 }
 
-// Alpha-equivalence for quoted formulas, up to *variable* and blank-node renaming.
+function collectProtectedNamesInTerm(t, protectedVars, protectedBlanks) {
+  if (t instanceof Var) {
+    protectedVars.add(t.name);
+    return;
+  }
+  if (t instanceof Blank) {
+    protectedBlanks.add(t.label);
+    return;
+  }
+  if (t instanceof ListTerm) {
+    for (const e of t.elems) collectProtectedNamesInTerm(e, protectedVars, protectedBlanks);
+    return;
+  }
+  if (t instanceof OpenListTerm) {
+    for (const e of t.prefix) collectProtectedNamesInTerm(e, protectedVars, protectedBlanks);
+    protectedVars.add(t.tailVar);
+    return;
+  }
+  if (t instanceof GraphTerm) {
+    for (const tr of t.triples) {
+      collectProtectedNamesInTerm(tr.s, protectedVars, protectedBlanks);
+      collectProtectedNamesInTerm(tr.p, protectedVars, protectedBlanks);
+      collectProtectedNamesInTerm(tr.o, protectedVars, protectedBlanks);
+    }
+  }
+}
+
+function collectProtectedNamesFromSubst(subst) {
+  const protectedVars = new Set();
+  const protectedBlanks = new Set();
+  if (!subst) return { protectedVars, protectedBlanks };
+  for (const k in subst) {
+    if (!Object.prototype.hasOwnProperty.call(subst, k)) continue;
+    collectProtectedNamesInTerm(subst[k], protectedVars, protectedBlanks);
+  }
+  return { protectedVars, protectedBlanks };
+}
+
+// Alpha-equivalence for quoted formulas, up to *local* variable and blank-node renaming.
+// Terms that originate from the surrounding substitution are treated as fixed and are
+// therefore not alpha-renamable inside the quoted formula.
 // Treats a formula as an unordered set of triples (order-insensitive match).
-function alphaEqVarName(x, y, vmap) {
+function alphaEqVarName(x, y, vmap, protectedVarsA, protectedVarsB) {
+  const xProtected = protectedVarsA && protectedVarsA.has(x);
+  const yProtected = protectedVarsB && protectedVarsB.has(y);
+  if (xProtected || yProtected) return xProtected && yProtected && x === y;
   if (Object.prototype.hasOwnProperty.call(vmap, x)) return vmap[x] === y;
   vmap[x] = y;
   return true;
 }
 
-function alphaEqTermInGraph(a, b, vmap, bmap) {
-  // Blank nodes: renamable
+function alphaEqBlankLabel(x, y, bmap, protectedBlanksA, protectedBlanksB) {
+  const xProtected = protectedBlanksA && protectedBlanksA.has(x);
+  const yProtected = protectedBlanksB && protectedBlanksB.has(y);
+  if (xProtected || yProtected) return xProtected && yProtected && x === y;
+  if (Object.prototype.hasOwnProperty.call(bmap, x)) return bmap[x] === y;
+  bmap[x] = y;
+  return true;
+}
+
+function alphaEqTermInGraph(a, b, vmap, bmap, opts) {
+  const protectedVarsA = opts && opts.protectedVarsA;
+  const protectedVarsB = opts && opts.protectedVarsB;
+  const protectedBlanksA = opts && opts.protectedBlanksA;
+  const protectedBlanksB = opts && opts.protectedBlanksB;
+
+  // Blank nodes: renamable only when they are local to the formula.
   if (a instanceof Blank && b instanceof Blank) {
-    const x = a.label;
-    const y = b.label;
-    if (Object.prototype.hasOwnProperty.call(bmap, x)) return bmap[x] === y;
-    bmap[x] = y;
-    return true;
+    return alphaEqBlankLabel(a.label, b.label, bmap, protectedBlanksA, protectedBlanksB);
   }
 
-  // Variables: renamable (ONLY inside quoted formulas)
+  // Variables: renamable only when they are local to the formula.
   if (a instanceof Var && b instanceof Var) {
-    return alphaEqVarName(a.name, b.name, vmap);
+    return alphaEqVarName(a.name, b.name, vmap, protectedVarsA, protectedVarsB);
   }
 
   if (a instanceof Iri && b instanceof Iri) return a.value === b.value;
@@ -5381,7 +5466,7 @@ function alphaEqTermInGraph(a, b, vmap, bmap) {
   if (a instanceof ListTerm && b instanceof ListTerm) {
     if (a.elems.length !== b.elems.length) return false;
     for (let i = 0; i < a.elems.length; i++) {
-      if (!alphaEqTermInGraph(a.elems[i], b.elems[i], vmap, bmap)) return false;
+      if (!alphaEqTermInGraph(a.elems[i], b.elems[i], vmap, bmap, opts)) return false;
     }
     return true;
   }
@@ -5389,29 +5474,30 @@ function alphaEqTermInGraph(a, b, vmap, bmap) {
   if (a instanceof OpenListTerm && b instanceof OpenListTerm) {
     if (a.prefix.length !== b.prefix.length) return false;
     for (let i = 0; i < a.prefix.length; i++) {
-      if (!alphaEqTermInGraph(a.prefix[i], b.prefix[i], vmap, bmap)) return false;
+      if (!alphaEqTermInGraph(a.prefix[i], b.prefix[i], vmap, bmap, opts)) return false;
     }
-    // tailVar is a var-name string, so treat it as renamable too
-    return alphaEqVarName(a.tailVar, b.tailVar, vmap);
+    // tailVar is a var-name string, so treat it as renamable too when local.
+    return alphaEqVarName(a.tailVar, b.tailVar, vmap, protectedVarsA, protectedVarsB);
   }
 
-  // Nested formulas: compare with fresh maps (separate scope)
+  // Nested formulas: compare with fresh maps (separate scope), but keep the same
+  // protected outer names so already-substituted terms stay fixed everywhere.
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    return alphaEqGraphTriples(a.triples, b.triples);
+    return alphaEqGraphTriples(a.triples, b.triples, opts);
   }
 
   return false;
 }
 
-function alphaEqTripleInGraph(a, b, vmap, bmap) {
+function alphaEqTripleInGraph(a, b, vmap, bmap, opts) {
   return (
-    alphaEqTermInGraph(a.s, b.s, vmap, bmap) &&
-    alphaEqTermInGraph(a.p, b.p, vmap, bmap) &&
-    alphaEqTermInGraph(a.o, b.o, vmap, bmap)
+    alphaEqTermInGraph(a.s, b.s, vmap, bmap, opts) &&
+    alphaEqTermInGraph(a.p, b.p, vmap, bmap, opts) &&
+    alphaEqTermInGraph(a.o, b.o, vmap, bmap, opts)
   );
 }
 
-function alphaEqGraphTriples(xs, ys) {
+function alphaEqGraphTriples(xs, ys, opts) {
   if (xs.length !== ys.length) return false;
   // Fast path: exact same sequence.
   if (triplesListEqual(xs, ys)) return true;
@@ -5430,7 +5516,7 @@ function alphaEqGraphTriples(xs, ys) {
 
       const v2 = { ...vmap };
       const b2 = { ...bmap };
-      if (!alphaEqTripleInGraph(x, y, v2, b2)) continue;
+      if (!alphaEqTripleInGraph(x, y, v2, b2, opts)) continue;
 
       used[j] = true;
       if (step(i + 1, v2, b2)) return true;
@@ -5512,7 +5598,16 @@ function tripleFastKey(tr) {
 }
 
 function ensureFactIndexes(facts) {
-  if (facts.__byPred && facts.__byPS && facts.__byPO && facts.__keySet) return;
+  if (
+    facts.__byPred &&
+    facts.__byPS &&
+    facts.__byPO &&
+    facts.__wildPred &&
+    facts.__wildPS &&
+    facts.__wildPO &&
+    facts.__keySet
+  )
+    return;
 
   Object.defineProperty(facts, '__byPred', {
     value: new Map(),
@@ -5529,6 +5624,21 @@ function ensureFactIndexes(facts) {
     enumerable: false,
     writable: true,
   });
+  Object.defineProperty(facts, '__wildPred', {
+    value: [],
+    enumerable: false,
+    writable: true,
+  });
+  Object.defineProperty(facts, '__wildPS', {
+    value: new Map(),
+    enumerable: false,
+    writable: true,
+  });
+  Object.defineProperty(facts, '__wildPO', {
+    value: new Map(),
+    enumerable: false,
+    writable: true,
+  });
   Object.defineProperty(facts, '__keySet', {
     value: new Set(),
     enumerable: false,
@@ -5539,6 +5649,9 @@ function ensureFactIndexes(facts) {
 }
 
 function indexFact(facts, tr, idx) {
+  const sk = termFastKey(tr.s);
+  const ok = termFastKey(tr.o);
+
   if (tr.p instanceof Iri) {
     // Use predicate term id as the primary key to avoid hashing long IRI strings.
     const pk = tr.p.__tid;
@@ -5550,7 +5663,6 @@ function indexFact(facts, tr, idx) {
     }
     pb.push(idx);
 
-    const sk = termFastKey(tr.s);
     if (sk !== null) {
       let ps = facts.__byPS.get(pk);
       if (!ps) {
@@ -5565,7 +5677,6 @@ function indexFact(facts, tr, idx) {
       psb.push(idx);
     }
 
-    const ok = termFastKey(tr.o);
     if (ok !== null) {
       let po = facts.__byPO.get(pk);
       if (!po) {
@@ -5579,6 +5690,26 @@ function indexFact(facts, tr, idx) {
       }
       pob.push(idx);
     }
+  } else {
+    facts.__wildPred.push(idx);
+
+    if (sk !== null) {
+      let psb = facts.__wildPS.get(sk);
+      if (!psb) {
+        psb = [];
+        facts.__wildPS.set(sk, psb);
+      }
+      psb.push(idx);
+    }
+
+    if (ok !== null) {
+      let pob = facts.__wildPO.get(ok);
+      if (!pob) {
+        pob = [];
+        facts.__wildPO.set(ok, pob);
+      }
+      pob.push(idx);
+    }
   }
 
   const key = tripleFastKey(tr);
@@ -5608,11 +5739,30 @@ function candidateFacts(facts, goal) {
       if (po) byPO = po.get(ok) || null;
     }
 
-    if (byPS && byPO) return byPS.length <= byPO.length ? byPS : byPO;
-    if (byPS) return byPS;
-    if (byPO) return byPO;
+    let exact = null;
+    if (byPS && byPO) exact = byPS.length <= byPO.length ? byPS : byPO;
+    else if (byPS) exact = byPS;
+    else if (byPO) exact = byPO;
+    else exact = facts.__byPred.get(pk) || null;
 
-    return facts.__byPred.get(pk) || [];
+    /** @type {number[] | null} */
+    let wildPS = null;
+    if (sk !== null) wildPS = facts.__wildPS.get(sk) || null;
+
+    /** @type {number[] | null} */
+    let wildPO = null;
+    if (ok !== null) wildPO = facts.__wildPO.get(ok) || null;
+
+    let wild = null;
+    if (wildPS && wildPO) wild = wildPS.length <= wildPO.length ? wildPS : wildPO;
+    else if (wildPS) wild = wildPS;
+    else if (wildPO) wild = wildPO;
+    else wild = facts.__wildPred.length ? facts.__wildPred : null;
+
+    if (exact && wild) return exact.concat(wild);
+    if (exact) return exact;
+    if (wild) return wild;
+    return [];
   }
 
   return null;
@@ -5767,7 +5917,13 @@ function __goalMemoKey(goals, subst, facts, opts) {
   const mode = opts && opts.deferBuiltins ? 'D1' : 'D0';
   const scopedLevel = facts && typeof facts.__scopedClosureLevel === 'number' ? facts.__scopedClosureLevel : 0;
   const scopedTag = facts && facts.__scopedSnapshot ? 'S' : 'N';
-  return `${mode}|${scopedTag}|${scopedLevel}|${parts.join('\n')}`;
+  let keepVarsTag = '';
+  if (opts && opts.keepVars) {
+    const keepVars = Array.isArray(opts.keepVars) ? opts.keepVars.slice() : Array.from(opts.keepVars);
+    keepVars.sort();
+    keepVarsTag = `|K:${keepVars.join(',')}`;
+  }
+  return `${mode}|${scopedTag}|${scopedLevel}${keepVarsTag}|${parts.join('\n')}`;
 }
 
 function __cloneGoalSolutions(solutions) {
@@ -6149,7 +6305,17 @@ function unifyTermWithOptions(a, b, subst, opts) {
 
   // Graphs
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    if (alphaEqGraphTriples(a.triples, b.triples)) return subst;
+    const protectedNames = collectProtectedNamesFromSubst(subst);
+    if (
+      alphaEqGraphTriples(a.triples, b.triples, {
+        protectedVarsA: protectedNames.protectedVars,
+        protectedVarsB: protectedNames.protectedVars,
+        protectedBlanksA: protectedNames.protectedBlanks,
+        protectedBlanksB: protectedNames.protectedBlanks,
+      })
+    ) {
+      return subst;
+    }
     return unifyGraphTriples(a.triples, b.triples, subst);
   }
 
@@ -6299,6 +6465,9 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
   // Variables from the original goal list (needed by the caller to instantiate conclusions)
   const answerVars = new Set();
   gcCollectVarsInGoals(initialGoals, answerVars);
+  if (opts && opts.keepVars) {
+    for (const v of opts.keepVars) answerVars.add(v);
+  }
 
   if (!initialGoals.length) {
     results.push(gcCompactForGoals(substMut, [], answerVars));
@@ -6521,7 +6690,17 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
 
     // Graphs
     if (a instanceof GraphTerm && b instanceof GraphTerm) {
-      if (alphaEqGraphTriples(a.triples, b.triples)) return true;
+      const protectedNames = collectProtectedNamesFromSubst(substMut);
+      if (
+        alphaEqGraphTriples(a.triples, b.triples, {
+          protectedVarsA: protectedNames.protectedVars,
+          protectedVarsB: protectedNames.protectedVars,
+          protectedBlanksA: protectedNames.protectedBlanks,
+          protectedBlanksB: protectedNames.protectedBlanks,
+        })
+      ) {
+        return true;
+      }
       // Fallback: reuse allocation-heavy graph unifier rarely hit in typical workloads.
       const delta = unifyGraphTriples(a.triples, b.triples, {});
       if (delta === null) return false;

package/lib/builtins.js

@@ -98,6 +98,35 @@ function makeBuiltins(deps) {
   return { evalBuiltin, isBuiltinPred };
 }
 
+function __builtinCollectVarsInTerm(t, out) {
+  if (t instanceof Var) {
+    out.add(t.name);
+    return;
+  }
+  if (t instanceof ListTerm) {
+    for (const e of t.elems) __builtinCollectVarsInTerm(e, out);
+    return;
+  }
+  if (t instanceof OpenListTerm) {
+    for (const e of t.prefix) __builtinCollectVarsInTerm(e, out);
+    out.add(t.tailVar);
+    return;
+  }
+  if (t instanceof GraphTerm) {
+    for (const tr of t.triples) __builtinCollectVarsInTriple(tr, out);
+  }
+}
+
+function __builtinCollectVarsInTriple(tr, out) {
+  __builtinCollectVarsInTerm(tr.s, out);
+  __builtinCollectVarsInTerm(tr.p, out);
+  __builtinCollectVarsInTerm(tr.o, out);
+}
+
+function __builtinCollectVarsInTriples(triples, out) {
+  for (const tr of triples) __builtinCollectVarsInTriple(tr, out);
+}
+
 function literalHasLangTag(lit) {
   // True iff the literal is a quoted string literal with a language tag suffix,
   // e.g. "hello"@en or """hello"""@en.
@@ -3028,6 +3057,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
     if (!(g.o instanceof GraphTerm)) return [];
 
     const visited2 = [];
+    const keepVars = new Set();
+    if (g.s instanceof GraphTerm) __builtinCollectVarsInTriples(g.s.triples, keepVars);
     // Start from the incoming substitution so bindings flow outward.
     return proveGoals(
       Array.from(g.o.triples),
@@ -3038,6 +3069,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
       visited2,
       varGen,
       maxResults,
+      keepVars.size ? { keepVars } : undefined,
     );
   }
 

package/lib/engine.js

@@ -736,27 +736,80 @@ function triplesListEqual(xs, ys) {
   return true;
 }
 
-// Alpha-equivalence for quoted formulas, up to *variable* and blank-node renaming.
+function collectProtectedNamesInTerm(t, protectedVars, protectedBlanks) {
+  if (t instanceof Var) {
+    protectedVars.add(t.name);
+    return;
+  }
+  if (t instanceof Blank) {
+    protectedBlanks.add(t.label);
+    return;
+  }
+  if (t instanceof ListTerm) {
+    for (const e of t.elems) collectProtectedNamesInTerm(e, protectedVars, protectedBlanks);
+    return;
+  }
+  if (t instanceof OpenListTerm) {
+    for (const e of t.prefix) collectProtectedNamesInTerm(e, protectedVars, protectedBlanks);
+    protectedVars.add(t.tailVar);
+    return;
+  }
+  if (t instanceof GraphTerm) {
+    for (const tr of t.triples) {
+      collectProtectedNamesInTerm(tr.s, protectedVars, protectedBlanks);
+      collectProtectedNamesInTerm(tr.p, protectedVars, protectedBlanks);
+      collectProtectedNamesInTerm(tr.o, protectedVars, protectedBlanks);
+    }
+  }
+}
+
+function collectProtectedNamesFromSubst(subst) {
+  const protectedVars = new Set();
+  const protectedBlanks = new Set();
+  if (!subst) return { protectedVars, protectedBlanks };
+  for (const k in subst) {
+    if (!Object.prototype.hasOwnProperty.call(subst, k)) continue;
+    collectProtectedNamesInTerm(subst[k], protectedVars, protectedBlanks);
+  }
+  return { protectedVars, protectedBlanks };
+}
+
+// Alpha-equivalence for quoted formulas, up to *local* variable and blank-node renaming.
+// Terms that originate from the surrounding substitution are treated as fixed and are
+// therefore not alpha-renamable inside the quoted formula.
 // Treats a formula as an unordered set of triples (order-insensitive match).
-function alphaEqVarName(x, y, vmap) {
+function alphaEqVarName(x, y, vmap, protectedVarsA, protectedVarsB) {
+  const xProtected = protectedVarsA && protectedVarsA.has(x);
+  const yProtected = protectedVarsB && protectedVarsB.has(y);
+  if (xProtected || yProtected) return xProtected && yProtected && x === y;
   if (Object.prototype.hasOwnProperty.call(vmap, x)) return vmap[x] === y;
   vmap[x] = y;
   return true;
 }
 
-function alphaEqTermInGraph(a, b, vmap, bmap) {
-  // Blank nodes: renamable
+function alphaEqBlankLabel(x, y, bmap, protectedBlanksA, protectedBlanksB) {
+  const xProtected = protectedBlanksA && protectedBlanksA.has(x);
+  const yProtected = protectedBlanksB && protectedBlanksB.has(y);
+  if (xProtected || yProtected) return xProtected && yProtected && x === y;
+  if (Object.prototype.hasOwnProperty.call(bmap, x)) return bmap[x] === y;
+  bmap[x] = y;
+  return true;
+}
+
+function alphaEqTermInGraph(a, b, vmap, bmap, opts) {
+  const protectedVarsA = opts && opts.protectedVarsA;
+  const protectedVarsB = opts && opts.protectedVarsB;
+  const protectedBlanksA = opts && opts.protectedBlanksA;
+  const protectedBlanksB = opts && opts.protectedBlanksB;
+
+  // Blank nodes: renamable only when they are local to the formula.
   if (a instanceof Blank && b instanceof Blank) {
-    const x = a.label;
-    const y = b.label;
-    if (Object.prototype.hasOwnProperty.call(bmap, x)) return bmap[x] === y;
-    bmap[x] = y;
-    return true;
+    return alphaEqBlankLabel(a.label, b.label, bmap, protectedBlanksA, protectedBlanksB);
   }
 
-  // Variables: renamable (ONLY inside quoted formulas)
+  // Variables: renamable only when they are local to the formula.
   if (a instanceof Var && b instanceof Var) {
-    return alphaEqVarName(a.name, b.name, vmap);
+    return alphaEqVarName(a.name, b.name, vmap, protectedVarsA, protectedVarsB);
   }
 
   if (a instanceof Iri && b instanceof Iri) return a.value === b.value;
@@ -765,7 +818,7 @@ function alphaEqTermInGraph(a, b, vmap, bmap) {
   if (a instanceof ListTerm && b instanceof ListTerm) {
     if (a.elems.length !== b.elems.length) return false;
     for (let i = 0; i < a.elems.length; i++) {
-      if (!alphaEqTermInGraph(a.elems[i], b.elems[i], vmap, bmap)) return false;
+      if (!alphaEqTermInGraph(a.elems[i], b.elems[i], vmap, bmap, opts)) return false;
     }
     return true;
   }
@@ -773,29 +826,30 @@ function alphaEqTermInGraph(a, b, vmap, bmap) {
   if (a instanceof OpenListTerm && b instanceof OpenListTerm) {
     if (a.prefix.length !== b.prefix.length) return false;
     for (let i = 0; i < a.prefix.length; i++) {
-      if (!alphaEqTermInGraph(a.prefix[i], b.prefix[i], vmap, bmap)) return false;
+      if (!alphaEqTermInGraph(a.prefix[i], b.prefix[i], vmap, bmap, opts)) return false;
     }
-    // tailVar is a var-name string, so treat it as renamable too
-    return alphaEqVarName(a.tailVar, b.tailVar, vmap);
+    // tailVar is a var-name string, so treat it as renamable too when local.
+    return alphaEqVarName(a.tailVar, b.tailVar, vmap, protectedVarsA, protectedVarsB);
   }
 
-  // Nested formulas: compare with fresh maps (separate scope)
+  // Nested formulas: compare with fresh maps (separate scope), but keep the same
+  // protected outer names so already-substituted terms stay fixed everywhere.
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    return alphaEqGraphTriples(a.triples, b.triples);
+    return alphaEqGraphTriples(a.triples, b.triples, opts);
   }
 
   return false;
 }
 
-function alphaEqTripleInGraph(a, b, vmap, bmap) {
+function alphaEqTripleInGraph(a, b, vmap, bmap, opts) {
   return (
-    alphaEqTermInGraph(a.s, b.s, vmap, bmap) &&
-    alphaEqTermInGraph(a.p, b.p, vmap, bmap) &&
-    alphaEqTermInGraph(a.o, b.o, vmap, bmap)
+    alphaEqTermInGraph(a.s, b.s, vmap, bmap, opts) &&
+    alphaEqTermInGraph(a.p, b.p, vmap, bmap, opts) &&
+    alphaEqTermInGraph(a.o, b.o, vmap, bmap, opts)
   );
 }
 
-function alphaEqGraphTriples(xs, ys) {
+function alphaEqGraphTriples(xs, ys, opts) {
   if (xs.length !== ys.length) return false;
   // Fast path: exact same sequence.
   if (triplesListEqual(xs, ys)) return true;
@@ -814,7 +868,7 @@ function alphaEqGraphTriples(xs, ys) {
 
       const v2 = { ...vmap };
       const b2 = { ...bmap };
-      if (!alphaEqTripleInGraph(x, y, v2, b2)) continue;
+      if (!alphaEqTripleInGraph(x, y, v2, b2, opts)) continue;
 
       used[j] = true;
       if (step(i + 1, v2, b2)) return true;
@@ -896,7 +950,16 @@ function tripleFastKey(tr) {
 }
 
 function ensureFactIndexes(facts) {
-  if (facts.__byPred && facts.__byPS && facts.__byPO && facts.__keySet) return;
+  if (
+    facts.__byPred &&
+    facts.__byPS &&
+    facts.__byPO &&
+    facts.__wildPred &&
+    facts.__wildPS &&
+    facts.__wildPO &&
+    facts.__keySet
+  )
+    return;
 
   Object.defineProperty(facts, '__byPred', {
     value: new Map(),
@@ -913,6 +976,21 @@ function ensureFactIndexes(facts) {
     enumerable: false,
     writable: true,
   });
+  Object.defineProperty(facts, '__wildPred', {
+    value: [],
+    enumerable: false,
+    writable: true,
+  });
+  Object.defineProperty(facts, '__wildPS', {
+    value: new Map(),
+    enumerable: false,
+    writable: true,
+  });
+  Object.defineProperty(facts, '__wildPO', {
+    value: new Map(),
+    enumerable: false,
+    writable: true,
+  });
   Object.defineProperty(facts, '__keySet', {
     value: new Set(),
     enumerable: false,
@@ -923,6 +1001,9 @@ function ensureFactIndexes(facts) {
 }
 
 function indexFact(facts, tr, idx) {
+  const sk = termFastKey(tr.s);
+  const ok = termFastKey(tr.o);
+
   if (tr.p instanceof Iri) {
     // Use predicate term id as the primary key to avoid hashing long IRI strings.
     const pk = tr.p.__tid;
@@ -934,7 +1015,6 @@ function indexFact(facts, tr, idx) {
     }
     pb.push(idx);
 
-    const sk = termFastKey(tr.s);
     if (sk !== null) {
       let ps = facts.__byPS.get(pk);
       if (!ps) {
@@ -949,7 +1029,6 @@ function indexFact(facts, tr, idx) {
       psb.push(idx);
     }
 
-    const ok = termFastKey(tr.o);
     if (ok !== null) {
       let po = facts.__byPO.get(pk);
       if (!po) {
@@ -963,6 +1042,26 @@ function indexFact(facts, tr, idx) {
       }
       pob.push(idx);
     }
+  } else {
+    facts.__wildPred.push(idx);
+
+    if (sk !== null) {
+      let psb = facts.__wildPS.get(sk);
+      if (!psb) {
+        psb = [];
+        facts.__wildPS.set(sk, psb);
+      }
+      psb.push(idx);
+    }
+
+    if (ok !== null) {
+      let pob = facts.__wildPO.get(ok);
+      if (!pob) {
+        pob = [];
+        facts.__wildPO.set(ok, pob);
+      }
+      pob.push(idx);
+    }
   }
 
   const key = tripleFastKey(tr);
@@ -992,11 +1091,30 @@ function candidateFacts(facts, goal) {
       if (po) byPO = po.get(ok) || null;
     }
 
-    if (byPS && byPO) return byPS.length <= byPO.length ? byPS : byPO;
-    if (byPS) return byPS;
-    if (byPO) return byPO;
+    let exact = null;
+    if (byPS && byPO) exact = byPS.length <= byPO.length ? byPS : byPO;
+    else if (byPS) exact = byPS;
+    else if (byPO) exact = byPO;
+    else exact = facts.__byPred.get(pk) || null;
+
+    /** @type {number[] | null} */
+    let wildPS = null;
+    if (sk !== null) wildPS = facts.__wildPS.get(sk) || null;
+
+    /** @type {number[] | null} */
+    let wildPO = null;
+    if (ok !== null) wildPO = facts.__wildPO.get(ok) || null;
+
+    let wild = null;
+    if (wildPS && wildPO) wild = wildPS.length <= wildPO.length ? wildPS : wildPO;
+    else if (wildPS) wild = wildPS;
+    else if (wildPO) wild = wildPO;
+    else wild = facts.__wildPred.length ? facts.__wildPred : null;
 
-    return facts.__byPred.get(pk) || [];
+    if (exact && wild) return exact.concat(wild);
+    if (exact) return exact;
+    if (wild) return wild;
+    return [];
   }
 
   return null;
@@ -1151,7 +1269,13 @@ function __goalMemoKey(goals, subst, facts, opts) {
   const mode = opts && opts.deferBuiltins ? 'D1' : 'D0';
   const scopedLevel = facts && typeof facts.__scopedClosureLevel === 'number' ? facts.__scopedClosureLevel : 0;
   const scopedTag = facts && facts.__scopedSnapshot ? 'S' : 'N';
-  return `${mode}|${scopedTag}|${scopedLevel}|${parts.join('\n')}`;
+  let keepVarsTag = '';
+  if (opts && opts.keepVars) {
+    const keepVars = Array.isArray(opts.keepVars) ? opts.keepVars.slice() : Array.from(opts.keepVars);
+    keepVars.sort();
+    keepVarsTag = `|K:${keepVars.join(',')}`;
+  }
+  return `${mode}|${scopedTag}|${scopedLevel}${keepVarsTag}|${parts.join('\n')}`;
 }
 
 function __cloneGoalSolutions(solutions) {
@@ -1533,7 +1657,17 @@ function unifyTermWithOptions(a, b, subst, opts) {
 
   // Graphs
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    if (alphaEqGraphTriples(a.triples, b.triples)) return subst;
+    const protectedNames = collectProtectedNamesFromSubst(subst);
+    if (
+      alphaEqGraphTriples(a.triples, b.triples, {
+        protectedVarsA: protectedNames.protectedVars,
+        protectedVarsB: protectedNames.protectedVars,
+        protectedBlanksA: protectedNames.protectedBlanks,
+        protectedBlanksB: protectedNames.protectedBlanks,
+      })
+    ) {
+      return subst;
+    }
     return unifyGraphTriples(a.triples, b.triples, subst);
   }
 
@@ -1683,6 +1817,9 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
   // Variables from the original goal list (needed by the caller to instantiate conclusions)
   const answerVars = new Set();
   gcCollectVarsInGoals(initialGoals, answerVars);
+  if (opts && opts.keepVars) {
+    for (const v of opts.keepVars) answerVars.add(v);
+  }
 
   if (!initialGoals.length) {
     results.push(gcCompactForGoals(substMut, [], answerVars));
@@ -1905,7 +2042,17 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
 
     // Graphs
     if (a instanceof GraphTerm && b instanceof GraphTerm) {
-      if (alphaEqGraphTriples(a.triples, b.triples)) return true;
+      const protectedNames = collectProtectedNamesFromSubst(substMut);
+      if (
+        alphaEqGraphTriples(a.triples, b.triples, {
+          protectedVarsA: protectedNames.protectedVars,
+          protectedVarsB: protectedNames.protectedVars,
+          protectedBlanksA: protectedNames.protectedBlanks,
+          protectedBlanksB: protectedNames.protectedBlanks,
+        })
+      ) {
+        return true;
+      }
       // Fallback: reuse allocation-heavy graph unifier rarely hit in typical workloads.
       const delta = unifyGraphTriples(a.triples, b.triples, {});
       if (delta === null) return false;

package/package.json

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

package/test/api.test.js

@@ -1432,6 +1432,73 @@ ex:w a ex:Woman .
 `,
     expect: [/:(?:test)\s+:(?:is)\s+true\s*\./],
   },
+
+  {
+    name: '59 regression: quoted-formula alpha-equivalence must not rename blanks introduced by outer substitution',
+    opt: { proofComments: false },
+    input: `@prefix : <http://example.org/> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+@prefix math: <http://www.w3.org/2000/10/swap/math#> .
+
+_:x :hates { _:foo :making :mess }.
+
+{
+    ?A :hates { ?A :making :mess }.
+}
+=>
+{
+    ?A :hates :Himself.
+}.
+
+{
+    ?A :hates :Himself.
+}
+=>
+{
+    :test :is false.
+}.
+`,
+    notExpect: [/:(?:test)\s+:(?:is)\s+false\s*\./],
+  },
+
+  {
+    name: '60 regression: log:includes must match quoted triples with variable predicates',
+    opt: { proofComments: false },
+    input: `@prefix : <http://example.org/> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@base <http://example.org/>.
+
+{
+    { ?X ?Y ?Z. } log:includes { :a :b :c. }.
+}
+=>
+{
+    ?X ?Y ?Z.
+    {
+        :a :b :c.
+    }
+    =>
+    {
+        :result :has :success-literal-3.
+    }.
+}.
+
+{ } => {
+    :test :contains :success-literal-3.
+}.
+
+{
+    :result :has :success-literal-3.
+}
+=>
+{
+    :test :is true.
+}.
+`,
+    expect: [/:(?:test)\s+:(?:contains)\s+:(?:success-literal-3)\s*\./, /:(?:test)\s+:(?:is)\s+true\s*\./],
+  },
 ];
 
 let passed = 0;