eyelang 1.7.16 → 2.0.0

package/examples/gd-step-certified.eye

@@ -1,162 +0,0 @@
-% Memoize interval computations reused across width, midpoint, gradient, step,
-% objective, and contraction report relations.
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-%
-% This is a proof-friendly optimization trace: every numeric fact needed to
-% justify the step is materialized, so proof output can certify why the update
-% is accepted.
-materialize(eta, 2).
-materialize(etaLeHalf, 2).
-materialize(xBounds, 2).
-materialize(midpoint, 2).
-materialize(width, 2).
-materialize(gradientBounds, 2).
-materialize(stepBounds, 2).
-materialize(objectiveBounds, 2).
-materialize(widthContractsAt, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-table(x_bounds, 3).
-table(width, 2).
-table(g_bounds, 3).
-table(p_bounds, 3).
-table(midpoint, 3).
-table(f_lower, 2).
-table(f_upper, 2).
-
-% Adapted from Eyeling's gd-step-certified.n3.
-% One-dimensional gradient descent over certified interval bounds.
-
-max_k(10).
-target(1.0).
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-eta(?eta) :- div(1.0, 5, ?eta).
-x_bounds(0, 0.0, 2.0).
-
-index(0). index(1). index(2). index(3). index(4). index(5).
-index(6). index(7). index(8). index(9). index(10).
-
-previous(1, 0). previous(2, 1). previous(3, 2). previous(4, 3). previous(5, 4).
-previous(6, 5). previous(7, 6). previous(8, 7). previous(9, 8). previous(10, 9).
-
-g_bounds(?k, ?gl, ?gu) :-
-  target(?a),
-  x_bounds(?k, ?l, ?u),
-  sub(?l, ?a, ?dl),
-  sub(?u, ?a, ?du),
-  mul(2, ?dl, ?gl),
-  mul(2, ?du, ?gu).
-
-p_bounds(?k, ?pl, ?pu) :-
-  eta(?eta),
-  g_bounds(?k, ?gl, ?gu),
-  mul(?eta, ?gl, ?pl),
-  mul(?eta, ?gu, ?pu).
-
-x_bounds(?k1, ?l1, ?u1) :-
-  previous(?k1, ?k),
-  x_bounds(?k, ?l, ?u),
-  target(?a),
-  eta(?eta),
-  sub(?l, ?a, ?dl),
-  sub(?u, ?a, ?du),
-  mul(2, ?dl, ?gl),
-  mul(2, ?du, ?gu),
-  mul(?eta, ?gl, ?pl),
-  mul(?eta, ?gu, ?pu),
-  sub(?l, ?pu, ?l1),
-  sub(?u, ?pl, ?u1).
-
-width(?k, ?w) :-
-  x_bounds(?k, ?l, ?u),
-  sub(?u, ?l, ?w).
-
-midpoint(?k, ?m, ?halfw) :-
-  x_bounds(?k, ?l, ?u),
-  width(?k, ?w),
-  div(?w, 2, ?halfw),
-  add(?l, ?u, ?sum),
-  div(?sum, 2, ?m).
-
-eta_le_half(true) :-
-  eta(?eta),
-  div(1.0, 2, ?half),
-  le(?eta, ?half).
-
-width_contracts_at(?k1, true) :-
-  eta_le_half(true),
-  previous(?k1, ?k),
-  width(?k, ?w),
-  width(?k1, ?w1),
-  le(?w1, ?w).
-
-max2(?a, ?b, ?a) :- ge(?a, ?b).
-max2(?a, ?b, ?b) :- lt(?a, ?b).
-min2(?a, ?b, ?a) :- le(?a, ?b).
-min2(?a, ?b, ?b) :- gt(?a, ?b).
-
-end_squares(?k, ?sl, ?su) :-
-  target(?a),
-  x_bounds(?k, ?l, ?u),
-  sub(?l, ?a, ?dl),
-  sub(?u, ?a, ?du),
-  mul(?dl, ?dl, ?sl),
-  mul(?du, ?du, ?su).
-
-f_upper(?k, ?fu) :-
-  end_squares(?k, ?sl, ?su),
-  max2(?sl, ?su, ?fu).
-
-f_lower(?k, 0.0) :-
-  target(?a),
-  x_bounds(?k, ?l, ?u),
-  le(?l, ?a),
-  le(?a, ?u).
-
-f_lower(?k, ?fl) :-
-  target(?a),
-  x_bounds(?k, ?l, ?u),
-  lt(?u, ?a),
-  end_squares(?k, ?sl, ?su),
-  min2(?sl, ?su, ?fl).
-
-f_lower(?k, ?fl) :-
-  target(?a),
-  x_bounds(?k, ?l, ?u),
-  lt(?a, ?l),
-  end_squares(?k, ?sl, ?su),
-  min2(?sl, ?su, ?fl).
-
-eta(result, ?eta) :-
-  eta(?eta).
-
-etaLeHalf(result, true) :-
-  eta_le_half(true).
-
-xBounds(result, bounds(?k, ?l, ?u)) :-
-  index(?k),
-  x_bounds(?k, ?l, ?u).
-
-midpoint(result, midpoint(?k, ?m, ?halfw)) :-
-  index(?k),
-  midpoint(?k, ?m, ?halfw).
-
-width(result, width(?k, ?w)) :-
-  index(?k),
-  width(?k, ?w).
-
-gradientBounds(result, gradient(?k, ?gl, ?gu)) :-
-  index(?k),
-  g_bounds(?k, ?gl, ?gu).
-
-stepBounds(result, step(?k, ?pl, ?pu)) :-
-  index(?k),
-  p_bounds(?k, ?pl, ?pu).
-
-objectiveBounds(result, f(?k, ?fl, ?fu)) :-
-  index(?k),
-  f_lower(?k, ?fl),
-  f_upper(?k, ?fu).
-
-widthContractsAt(result, ?k) :-
-  width_contracts_at(?k, true).

package/examples/gdpr-compliance.eye

@@ -1,69 +0,0 @@
-% GDPR-style compliance check.
-% Each processing case is tested for purpose compatibility, legal basis,
-% minimisation, special-category safeguards, and international-transfer safety.
-% Separate failure rules produce concise reasons for noncompliant cases.
-
-materialize(status, 2).
-materialize(reason, 2).
-
-% case_alpha is intended to pass; case_beta is intentionally incomplete.
-processing(case_alpha).
-processing(case_beta).
-
-purpose(case_alpha, care_coordination).
-purpose(case_beta, marketing).
-
-legal_basis(case_alpha, explicit_consent).
-% case_beta intentionally has no legal basis.
-
-minimized(case_alpha).
-not_minimized(case_beta).
-
-special_category(case_alpha, health_data).
-special_category(case_beta, health_data).
-
-safeguard(case_alpha, encryption).
-safeguard(case_alpha, access_logging).
-safeguard(case_beta, encryption).
-
-third_country_transfer(case_beta).
-adequacy_decision(case_alpha).
-
-% Compliance is decomposed into reusable checks so reasons can be reported.
-has_required_basis(?case) :- legal_basis(?case, explicit_consent).
-has_required_basis(?case) :- legal_basis(?case, medical_care).
-
-has_health_safeguards(?case) :-
-  special_category(?case, health_data),
-  safeguard(?case, encryption),
-  safeguard(?case, access_logging).
-
-transfer_ok(?case) :- not(third_country_transfer(?case)).
-transfer_ok(?case) :- adequacy_decision(?case).
-
-compliant(?case) :-
-  processing(?case),
-  has_required_basis(?case),
-  minimized(?case),
-  has_health_safeguards(?case),
-  transfer_ok(?case).
-
-% Individual failure rules explain why a case is noncompliant.
-noncompliance_reason(?case, missing_legal_basis) :-
-  processing(?case),
-  not(has_required_basis(?case)).
-
-noncompliance_reason(?case, not_minimized) :-
-  not_minimized(?case).
-
-noncompliance_reason(?case, missing_access_logging) :-
-  special_category(?case, health_data),
-  not(safeguard(?case, access_logging)).
-
-noncompliance_reason(?case, transfer_without_adequacy) :-
-  third_country_transfer(?case),
-  not(adequacy_decision(?case)).
-
-status(?case, gdpr_compliant) :- compliant(?case).
-status(?case, gdpr_noncompliant) :- noncompliance_reason(?case, ?_reason).
-reason(?case, ?reason) :- noncompliance_reason(?case, ?reason).

package/examples/good-cobbler.eye

@@ -1,16 +0,0 @@
-% Good cobbler, adapted from Eyeling's examples/good-cobbler.n3.
-%
-% The Eyeling result is a quoted assertion saying that joe is a good Cobbler.
-% Here the quoted assertion is represented as an eyelang term.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(is, 2).
-
-% The asserted fact is kept separate from the output form so the rule can show
-% how a quoted Eyeling assertion maps to an ordinary eyelang term.
-assertedIs(joe, good(cobbler)).
-
-% The single rule is intentionally simple: it preserves the subject and
-% profession while wrapping the conclusion as is(X, good(Y)).
-is(test, is(?x, good(?y))) :-
-  assertedIs(?x, good(?y)).

package/examples/gps.eye

@@ -1,146 +0,0 @@
-% GPS route-planning example translated from Eyeling's gps.n3.
-% The map is stored as quoted formula data and projected with holds/3.  Route
-% paths accumulate action sequence, duration, cost, belief, and comfort; table
-% keeps repeated comparison and explanation queries from recomputing paths.
-
-materialize(recommendedRoute, 2).
-materialize(outcome, 2).
-materialize(statement, 3).
-materialize(label, 2).
-materialize(actionSequence, 2).
-materialize(durationSeconds, 2).
-materialize(cost, 2).
-materialize(belief, 2).
-materialize(comfort, 2).
-materialize(selectedRoute, 2).
-materialize(comparison, 2).
-
-table(path, 7).
-table(traveller_path, 6).
-
-case_graph(caseGraph, (
-  location(i1, gent),
-  text(question, "Which route should we take from Gent to Oostende?"),
-  label(routeDirect, "Gent -> Brugge -> Oostende"),
-  label(routeViaKortrijk, "Gent -> Kortrijk -> Brugge -> Oostende")
-)).
-
-map_graph(mapBE, (
-  gps_description(mapBE, description(location(?s, gent), true, location(?s, brugge), drive_gent_brugge, 1500.0, 0.006, 0.96, 0.99)),
-  gps_description(mapBE, description(location(?s, gent), true, location(?s, kortrijk), drive_gent_kortrijk, 1600.0, 0.007, 0.96, 0.99)),
-  gps_description(mapBE, description(location(?s, kortrijk), true, location(?s, brugge), drive_kortrijk_brugge, 1600.0, 0.007, 0.96, 0.99)),
-  gps_description(mapBE, description(location(?s, brugge), true, location(?s, oostende), drive_brugge_oostende, 900.0, 0.004, 0.98, 1.0))
-)).
-
-case_statement(?s, ?p, ?o) :-
-  case_graph(caseGraph, ?context),
-  holds(?context, ?p, [?s, ?o]).
-
-map_description(?from, ?to, ?action, ?duration, ?cost, ?belief, ?comfort) :-
-  map_graph(mapBE, ?context),
-  holds(?context, gps_description(mapBE, description(?from, true, ?to, ?action, ?duration, ?cost, ?belief, ?comfort))).
-
-path(?from, ?to, [?action], ?duration, ?cost, ?belief, ?comfort) :-
-  map_description(?from, ?to, ?action, ?duration, ?cost, ?belief, ?comfort).
-
-path(?from, ?to, ?actions, ?duration, ?cost, ?belief, ?comfort) :-
-  map_description(?from, ?mid, ?action, ?d1, ?c1, ?b1, ?f1),
-  path(?mid, ?to, ?restactions, ?d2, ?c2, ?b2, ?f2),
-  append([?action], ?restactions, ?actions),
-  add(?d1, ?d2, ?duration),
-  add(?c1, ?c2, ?cost),
-  mul(?b1, ?b2, ?belief),
-  mul(?f1, ?f2, ?comfort).
-
-traveller_start(i1, location(i1, gent)).
-traveller_goal(i1, location(i1, oostende)).
-
-traveller_path(?traveller, ?actions, ?duration, ?cost, ?belief, ?comfort) :-
-  traveller_start(?traveller, ?from),
-  traveller_goal(?traveller, ?to),
-  path(?from, ?to, ?actions, ?duration, ?cost, ?belief, ?comfort).
-
-route_metrics(routeDirect, ?duration, ?cost, ?belief, ?comfort) :-
-  traveller_path(i1, [drive_gent_brugge, drive_brugge_oostende], ?duration, ?cost, ?belief, ?comfort).
-
-route_metrics(routeViaKortrijk, ?duration, ?cost, ?belief, ?comfort) :-
-  traveller_path(i1, [drive_gent_kortrijk, drive_kortrijk_brugge, drive_brugge_oostende], ?duration, ?cost, ?belief, ?comfort).
-
-recommended_route(routeDirect) :-
-  route_metrics(routeDirect, ?directduration, ?directcost, ?directbelief, ?directcomfort),
-  route_metrics(routeViaKortrijk, ?viaduration, ?viacost, ?viabelief, ?viacomfort),
-  lt(?directduration, ?viaduration),
-  lt(?directcost, ?viacost),
-  gt(?directbelief, ?viabelief),
-  gt(?directcomfort, ?viacomfort).
-
-outcome(routeDirect, "Take the direct route via Brugge.").
-
-% Verification checks, analogous to the false-producing guards in gps.n3.
-check(c1, true) :-
-  traveller_path(i1, [drive_gent_brugge, drive_brugge_oostende], ?, ?, ?, ?).
-
-check(c2, true) :-
-  traveller_path(i1, [drive_gent_kortrijk, drive_kortrijk_brugge, drive_brugge_oostende], ?, ?, ?, ?).
-
-check(c3, true) :-
-  route_metrics(routeDirect, ?d1, ?, ?, ?),
-  route_metrics(routeViaKortrijk, ?d2, ?, ?, ?),
-  lt(?d1, ?d2).
-
-check(c4, true) :-
-  route_metrics(routeDirect, ?, ?c1, ?, ?),
-  route_metrics(routeViaKortrijk, ?, ?c2, ?, ?),
-  lt(?c1, ?c2).
-
-check(c5, true) :-
-  route_metrics(routeDirect, ?, ?, ?b1, ?f1),
-  route_metrics(routeViaKortrijk, ?, ?, ?b2, ?f2),
-  gt(?b1, ?b2),
-  gt(?f1, ?f2).
-
-recommendedRoute(decision, ?route) :-
-  recommended_route(?route).
-
-outcome(decision, ?outcome) :-
-  recommended_route(?route),
-  outcome(?route, ?outcome).
-
-statement(check, ?check, true) :-
-  check(?check, true).
-
-route_actions(routeDirect, [drive_gent_brugge, drive_brugge_oostende]).
-route_actions(routeViaKortrijk, [drive_gent_kortrijk, drive_kortrijk_brugge, drive_brugge_oostende]).
-
-% Derived route and report relations.  These are consequences of the route search
-% and comparison, not pre-written markdown output.
-label(?route, ?label) :-
-  case_statement(?route, label, ?label),
-  route_metrics(?route, ?_duration, ?_cost, ?_belief, ?_comfort).
-
-actionSequence(?route, ?actions) :-
-  route_actions(?route, ?actions),
-  route_metrics(?route, ?_duration, ?_cost, ?_belief, ?_comfort).
-
-durationSeconds(?route, ?duration) :-
-  route_metrics(?route, ?duration, ?_cost, ?_belief, ?_comfort).
-
-cost(?route, ?cost) :-
-  route_metrics(?route, ?_duration, ?cost, ?_belief, ?_comfort).
-
-belief(?route, ?belief) :-
-  route_metrics(?route, ?_duration, ?_cost, ?belief, ?_comfort).
-
-comfort(?route, ?comfort) :-
-  route_metrics(?route, ?_duration, ?_cost, ?_belief, ?comfort).
-
-selectedRoute(report, route(?route, ?actions, ?duration, ?cost, ?belief, ?comfort)) :-
-  recommended_route(?route),
-  route_actions(?route, ?actions),
-  route_metrics(?route, ?duration, ?cost, ?belief, ?comfort).
-
-comparison(report, dominates(routeDirect, routeViaKortrijk)) :-
-  recommended_route(routeDirect),
-  check(c3, true),
-  check(c4, true),
-  check(c5, true).

package/examples/graph-reachability.eye

@@ -1,33 +0,0 @@
-% Graph reachability example adapted from Eyelet input/graph-reachability.eye.
-% The recursive search carries a Visited list and rejects already-seen nodes with
-% not(member(...)).  This keeps reachability finite and also lets the example
-% derive explicit not_reachable/2 evidence for a negative test case.
-
-materialize(reachable, 2).
-materialize(not_reachable, 2).
-
-edge(a, b).
-edge(a, c).
-edge(b, d).
-edge(c, e).
-edge(d, f).
-edge(e, f).
-edge(f, g).
-
-reachable(?node, ?node, ?_visited).
-reachable(?start, ?goal, ?visited) :-
-  edge(?start, ?next),
-  not(member(?next, ?visited)),
-  reachable(?next, ?goal, [?next|?visited]).
-
-is_reachable(?start, ?goal) :-
-  reachable(?start, ?goal, [?start]).
-
-reachable(reachability_case, path(a, f)) :-
-  is_reachable(a, f).
-
-reachable(reachability_case, path(c, g)) :-
-  is_reachable(c, g).
-
-not_reachable(reachability_case, path(b, e)) :-
-  not(is_reachable(b, e)).

package/examples/graph.eye

@@ -1,35 +0,0 @@
-% Transitive graph paths over a small map of French cities.
-%
-% The base relation is directed: oneway(A, B) means there is a road from A
-% to B.  The derived relation path(A, B) is the transitive closure: B is
-% reachable from A by one or more directed legs.
-%
-% The recursive rule is written in a productive, right-recursive form:
-%
-%     path(A, C) :- oneway(A, B), path(B, C).
-%
-% That order matters in a goal-directed reasoner.  A left-recursive closure
-% rule such as `path(A, C) :- path(A, B), path(B, C).` starts by asking for
-% the same open relation it is currently proving, so eyelang's recursion guard
-% must stop it to avoid an infinite loop.  The result is under-generation: only
-% direct edges are printed.  Starting with the concrete generator `oneway/2`
-% first makes each recursive step smaller and yields the complete closure.
-
-materialize(path, 2).
-
-oneway(paris, orleans).
-oneway(paris, chartres).
-oneway(paris, amiens).
-oneway(orleans, blois).
-oneway(orleans, bourges).
-oneway(blois, tours).
-oneway(chartres, lemans).
-oneway(lemans, angers).
-oneway(lemans, tours).
-oneway(angers, nantes).
-
-path(?a, ?b) :-
-    oneway(?a, ?b).
-path(?a, ?c) :-
-    oneway(?a, ?b),
-    path(?b, ?c).

package/examples/gray-code-counter.eye

@@ -1,47 +0,0 @@
-% Gray-code counter adapted from Eyeling gray-code-counter.n3.
-% Boolean gates are represented as truth-table facts.  The circuit rules compose
-% those gates into next-state logic for three flip-flops, and testgcc/3 runs the
-% counter over a finite clock sequence.
-
-materialize(isgcc, 2).
-
-% Boolean gates are truth tables; the circuit rules compose them.
-and(0, 0, 0). and(0, 1, 0). and(1, 0, 0). and(1, 1, 1).
-or(0, 0, 0).  or(0, 1, 1).  or(1, 0, 1).  or(1, 1, 1).
-inv(0, 1). inv(1, 0).
-
-dff(?d, 0, ?q, ?q).
-dff(?d, 1, ?_q, ?d).
-
-neta(?a, ?b, ?q) :-
-  and(?a, ?b, ?t1),
-  inv(?a, ?na),
-  inv(?b, ?nb),
-  and(?na, ?nb, ?t2),
-  or(?t1, ?t2, ?q).
-
-netb(?a, ?b, ?c, ?q1, ?q2) :-
-  and(?a, ?c, ?t1),
-  inv(?c, ?nc),
-  and(?b, ?nc, ?t2),
-  inv(?a, ?na),
-  and(?na, ?c, ?t3),
-  or(?t1, ?t2, ?q1),
-  or(?t2, ?t3, ?q2).
-
-% One clock step computes D inputs, then updates the three flip-flops.
-gcc(?c, [?qa, ?qb, ?qc], [?za, ?zb, ?zc]) :-
-  netb(?qa, ?qb, ?qc, ?d1, ?d2),
-  neta(?qa, ?qb, ?d3),
-  dff(?d1, ?c, ?qa, ?za),
-  dff(?d2, ?c, ?qb, ?zb),
-  dff(?d3, ?c, ?qc, ?zc).
-
-% testgcc/3 runs the circuit over a list of clock inputs.
-testgcc([], ?_state, []).
-testgcc([?c|?cs], ?state, [?next|?rest]) :-
-  gcc(?c, ?state, ?next),
-  testgcc(?cs, ?next, ?rest).
-
-isgcc([[1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0]], ?states) :-
-  testgcc([1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0], ?states).

package/examples/greatest-lower-bound-uniqueness.eye

@@ -1,30 +0,0 @@
-% Order-theory proof sketch: greatest lower bounds are unique.
-%
-% Two candidate GLBs are asserted for the same pair.  The rules derive that
-% each must be below the other, then use antisymmetry-style sameTerm/2 reasoning
-% to report that the candidates denote the same lower bound.
-materialize(sameGreatestLowerBound, 4).
-
-% Adapted from Eyeling greatest-lower-bound-uniqueness.n3.  The named facts
-% intentionally use two different symbols, g1 and g2, so the final output shows
-% the equality-style conclusion as an explicit derived relation.
-
-glbOf(g1, a, b).
-glbOf(g2, a, b).
-
-% leq/2 captures the defining property of a GLB: every lower bound is below it.
-lowerBoundOf(?m, ?a, ?b) :- glbOf(?m, ?a, ?b).
-
-leq(?l, ?m) :-
-  glbOf(?m, ?a, ?b),
-  lowerBoundOf(?l, ?a, ?b).
-
-sameTerm(?m, ?n) :-
-  leq(?m, ?n),
-  leq(?n, ?m).
-
-sameGreatestLowerBound(?a, ?b, ?m, ?n) :-
-  glbOf(?m, ?a, ?b),
-  glbOf(?n, ?a, ?b),
-  sameTerm(?m, ?n),
-  neq(?m, ?n).

package/examples/group-inverse-uniqueness.eye

@@ -1,36 +0,0 @@
-% Group inverse uniqueness, adapted from Eyeling's examples/group-inverse-uniqueness.n3.
-%
-% The output mirrors the Eyeling golden result shape:
-% sameInverse(x, i, j) and sameInverse(x, j, i).
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(sameInverse, 3).
-
-% The group table is deliberately tiny: e is the identity, and i and j are
-% two names that both behave as the inverse of x.
-element(e).
-element(x).
-element(i).
-element(j).
-
-% leftInverse/2 and rightInverse/2 are proved from op/3.  sameInverse/3
-% then derives uniqueness by combining both inverse directions with sameTerm/2.
-op(e, ?x, ?x) :- element(?x).
-op(?x, e, ?x) :- element(?x).
-op(i, x, e).
-op(x, j, e).
-op(j, x, e).
-op(x, i, e).
-
-sameTerm(?x, ?x) :- element(?x).
-sameTerm(i, j).
-sameTerm(j, i).
-
-leftInverse(?a, ?b) :- op(?b, ?a, e).
-rightInverse(?a, ?b) :- op(?a, ?b, e).
-
-sameInverse(?a, ?b, ?c) :-
-  leftInverse(?a, ?b),
-  rightInverse(?a, ?c),
-  sameTerm(?b, ?c),
-  neq(?b, ?c).

package/examples/hamiltonian-path.eye

@@ -1,51 +0,0 @@
-% Hamiltonian path, adapted from Eyelet's input/hamiltonian-path.eye.
-%
-% The graph is the same six-vertex undirected graph.  eyelang spells the finite
-% vertex set directly and derives every path that visits each vertex exactly
-% once.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(hasHamiltonianPath, 2).
-materialize(hamiltonianPath, 2).
-
-% The finite six-vertex graph is small enough to search directly.  adjacent/2
-% is tabled because every candidate path repeatedly asks the same edge tests.
-table(adjacent, 2).
-
-edge(v1, v2).
-edge(v1, v3).
-edge(v1, v5).
-edge(v1, v6).
-edge(v2, v3).
-edge(v2, v4).
-edge(v2, v6).
-edge(v3, v4).
-edge(v3, v6).
-edge(v4, v5).
-edge(v4, v6).
-
-% hamiltonian_path/1 is intentionally unrolled to six positions: each next
-% vertex must be adjacent to the previous one and absent from the prefix.
-adjacent(?v, ?u) :- edge(?v, ?u).
-adjacent(?v, ?u) :- edge(?u, ?v).
-
-vertex(v1).
-vertex(v2).
-vertex(v3).
-vertex(v4).
-vertex(v5).
-vertex(v6).
-
-hamiltonian_path([?a, ?b, ?c, ?d, ?e, ?f]) :-
-  vertex(?a),
-  vertex(?b), adjacent(?a, ?b), not_member(?b, [?a]),
-  vertex(?c), adjacent(?b, ?c), not_member(?c, [?a, ?b]),
-  vertex(?d), adjacent(?c, ?d), not_member(?d, [?a, ?b, ?c]),
-  vertex(?e), adjacent(?d, ?e), not_member(?e, [?a, ?b, ?c, ?d]),
-  vertex(?f), adjacent(?e, ?f), not_member(?f, [?a, ?b, ?c, ?d, ?e]).
-
-hasHamiltonianPath(graph, true) :-
-  hamiltonian_path(?_path).
-
-hamiltonianPath(graph, ?path) :-
-  hamiltonian_path(?path).