eyeprolog 1.6.12 → 1.6.13
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/examples/proof/abstract-interpretation.pl +146 -0
- package/examples/proof/ackermann.pl +296 -0
- package/examples/proof/alignment-demo.pl +196 -0
- package/examples/proof/allen-interval-calculus.pl +1271 -0
- package/examples/proof/auroracare.pl +954 -0
- package/examples/proof/basic-monadic.pl +37176 -0
- package/examples/proof/bayes-therapy.pl +1349 -0
- package/examples/proof/bench.pl +2802 -0
- package/examples/proof/binomial-vandermonde.pl +983 -0
- package/examples/proof/blocks-world-planning.pl +471 -0
- package/examples/proof/bmi.pl +386 -0
- package/examples/proof/braking-safety-worlds.pl +508 -0
- package/examples/proof/buck-converter-design.pl +179 -0
- package/examples/proof/bulk-stream-write.pl +3 -0
- package/examples/proof/collatz-1000.pl +43784 -0
- package/examples/proof/competitive-enzyme-kinetics.pl +167 -0
- package/examples/proof/complex.pl +514 -0
- package/examples/proof/context-schema-audit.pl +374 -0
- package/examples/proof/continued-fraction-sqrt2.pl +476 -0
- package/examples/proof/control-system.pl +137 -0
- package/examples/proof/critical-path-schedule.pl +491 -0
- package/examples/proof/cross-organization-data-sharing.pl +732 -0
- package/examples/proof/cyclic-path.pl +44 -0
- package/examples/proof/dairy-energy-balance.pl +290 -0
- package/examples/proof/dcg-expression-language.pl +157 -0
- package/examples/proof/deep-taxonomy-10.pl +185 -0
- package/examples/proof/deep-taxonomy-100.pl +365 -0
- package/examples/proof/deep-taxonomy-1000.pl +163 -0
- package/examples/proof/deep-taxonomy-10000.pl +163 -0
- package/examples/proof/deep-taxonomy-100000.pl +163 -0
- package/examples/proof/delfour.pl +1615 -0
- package/examples/proof/dijkstra-findall-sort.pl +354 -0
- package/examples/proof/dijkstra-risk-path.pl +820 -0
- package/examples/proof/dijkstra.pl +753 -0
- package/examples/proof/dining-philosophers.pl +2663 -0
- package/examples/proof/donald-gerald-robert.pl +311 -0
- package/examples/proof/dpv-odrl-purpose-mapping.pl +1189 -0
- package/examples/proof/drone-corridor-planner.pl +2365 -0
- package/examples/proof/easter-computus.pl +1406 -0
- package/examples/proof/eulerian-path.pl +457 -0
- package/examples/proof/ev-range-worlds.pl +508 -0
- package/examples/proof/exoplanet-validation-worlds.pl +397 -0
- package/examples/proof/explainable-ev-depot-configuration.pl +313 -0
- package/examples/proof/family-cousins.pl +920 -0
- package/examples/proof/fast-fourier-transform.pl +5045 -0
- package/examples/proof/fastpow.pl +769 -0
- package/examples/proof/fft8-numeric.pl +685 -0
- package/examples/proof/fibonacci.pl +1425 -0
- package/examples/proof/field-nitrogen-balance.pl +320 -0
- package/examples/proof/flandor.pl +533 -0
- package/examples/proof/fundamental-theorem-arithmetic.pl +245 -0
- package/examples/proof/gd-step-certified.pl +1717 -0
- package/examples/proof/goldbach.pl +1135 -0
- package/examples/proof/gps.pl +627 -0
- package/examples/proof/graph.pl +105 -0
- package/examples/proof/gray-code-counter.pl +355 -0
- package/examples/proof/hamiltonian-path.pl +3373 -0
- package/examples/proof/hamming-code.pl +232 -0
- package/examples/proof/heron-theorem.pl +79 -0
- package/examples/proof/http-client.pl +0 -0
- package/examples/proof/illegitimate-reasoning.pl +220 -0
- package/examples/proof/integer-partitions.pl +1642 -0
- package/examples/proof/iso-atomic-conversion.pl +73 -0
- package/examples/proof/knowledge-engineering-alignment-flow.pl +200 -0
- package/examples/proof/knuth-bendix-completion.pl +290 -0
- package/examples/proof/law-of-cosines.pl +71 -0
- package/examples/proof/least-squares-regression.pl +342 -0
- package/examples/proof/lee.pl +637 -0
- package/examples/proof/lldm.pl +581 -0
- package/examples/proof/manufacturing-quality-control.pl +181 -0
- package/examples/proof/map-four-color-search.pl +796 -0
- package/examples/proof/markov-logic-network.pl +405 -0
- package/examples/proof/matrix-chain-order.pl +164 -0
- package/examples/proof/matrix-noncommutativity.pl +183 -0
- package/examples/proof/microgrid-dispatch.pl +164 -0
- package/examples/proof/missionaries-cannibals.pl +428 -0
- package/examples/proof/modular-exponentiation.pl +838 -0
- package/examples/proof/monkey-bananas.pl +278 -0
- package/examples/proof/network-sla.pl +100 -0
- package/examples/proof/newton-raphson.pl +520 -0
- package/examples/proof/observability-log-correlation.pl +1061 -0
- package/examples/proof/odrl-dpv-fpv-trust-flow.pl +1366 -0
- package/examples/proof/odrl-dpv-healthcare-risk-ranked.pl +488 -0
- package/examples/proof/odrl-dpv-risk-ranked.pl +637 -0
- package/examples/proof/odrl-policy-advanced.pl +705 -0
- package/examples/proof/odrl-policy-reasoning.pl +1423 -0
- package/examples/proof/odrl-policy.pl +103 -0
- package/examples/proof/operational-incident-response.pl +435 -0
- package/examples/proof/orbital-transfer-design.pl +288 -0
- package/examples/proof/path-discovery.pl +502 -0
- package/examples/proof/peano-arithmetic.pl +910 -0
- package/examples/proof/peano-calculus.pl +294 -0
- package/examples/proof/pell-equation.pl +295 -0
- package/examples/proof/pendulum-period.pl +97 -0
- package/examples/proof/pi.pl +3 -0
- package/examples/proof/pointer-analysis.pl +94 -0
- package/examples/proof/polynomial.pl +2487 -0
- package/examples/proof/portable-library-overlap.pl +6 -0
- package/examples/proof/quadratic-formula.pl +159 -0
- package/examples/proof/quine-mccluskey.pl +914 -0
- package/examples/proof/radioactive-decay.pl +104 -0
- package/examples/proof/rdf12-annotated-claims.pl +263 -0
- package/examples/proof/register-allocation.pl +120 -0
- package/examples/proof/relational-cube-lookup.pl +15867 -0
- package/examples/proof/riemann-hypothesis.pl +148 -0
- package/examples/proof/sat-solver-dpll.pl +226 -0
- package/examples/proof/scientific-evidence-graph.pl +681 -0
- package/examples/proof/send-more-money.pl +252 -0
- package/examples/proof/service-impact.pl +151 -0
- package/examples/proof/shoelace-polygon-area.pl +161 -0
- package/examples/proof/skolem-functions.pl +128 -0
- package/examples/proof/statistics-summary.pl +250 -0
- package/examples/proof/stirling-bell-numbers.pl +125 -0
- package/examples/proof/superdense-coding.pl +118 -0
- package/examples/proof/symbiotic-knowledge-graph.pl +1569 -0
- package/examples/proof/truth-maintenance-system.pl +466 -0
- package/examples/proof/turing.pl +1183 -0
- package/examples/proof/type-inference.pl +267 -0
- package/examples/proof/vector-similarity.pl +163 -0
- package/examples/proof/vulnerability-impact.pl +180 -0
- package/examples/proof/wolf-goat-cabbage.pl +339 -0
- package/examples/proof/zebra.pl +176 -0
- package/package.json +1 -1
- package/src/check-proof.js +159 -11
- package/test/conformance/NEUMERKEL-LATEST.md +3 -3
- package/test/regression/cases-white-box.mjs +38 -0
- package/test/run-examples.mjs +7 -111
- package/test/run-proof-checking.mjs +28 -5
- package/the-art-of-eyeprolog.md +4 -2
|
@@ -0,0 +1,457 @@
|
|
|
1
|
+
oddVertices(eulerian_path_case, []).
|
|
2
|
+
path(eulerian_path_case, [v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1]).
|
|
3
|
+
edgeCount(eulerian_path_case, 11).
|
|
4
|
+
|
|
5
|
+
clause(1, edge(e12, v1, v2), true).
|
|
6
|
+
clause(2, edge(e13, v1, v3), true).
|
|
7
|
+
clause(3, edge(e15, v1, v5), true).
|
|
8
|
+
clause(4, edge(e16, v1, v6), true).
|
|
9
|
+
clause(5, edge(e23, v2, v3), true).
|
|
10
|
+
clause(6, edge(e24, v2, v4), true).
|
|
11
|
+
clause(7, edge(e26, v2, v6), true).
|
|
12
|
+
clause(8, edge(e34, v3, v4), true).
|
|
13
|
+
clause(9, edge(e36, v3, v6), true).
|
|
14
|
+
clause(10, edge(e45, v4, v5), true).
|
|
15
|
+
clause(11, edge(e46, v4, v6), true).
|
|
16
|
+
clause(16, adjacent_by_edge(var('V'), var('U'), var('E')), edge(var('E'), var('V'), var('U'))).
|
|
17
|
+
clause(17, adjacent_by_edge(var('V'), var('U'), var('E')), edge(var('E'), var('U'), var('V'))).
|
|
18
|
+
clause(18, select_item(var('Item'), [var('Item') | var('Rest')], var('Rest')), true).
|
|
19
|
+
clause(19,
|
|
20
|
+
select_item(var('Item'), [var('Head') | var('Tail')], [var('Head') | var('Rest')]),
|
|
21
|
+
select_item(var('Item'), var('Tail'), var('Rest'))).
|
|
22
|
+
clause(21,
|
|
23
|
+
odd_vertices(var('Odds')),
|
|
24
|
+
(findall(var('V'), odd_degree(var('V')), var('Raw')), sort(var('Raw'), var('Odds')))).
|
|
25
|
+
clause(22,
|
|
26
|
+
all_edges(var('Edges')),
|
|
27
|
+
(findall(var('E'), edge(var('E'), anonymous(1), anonymous(2)), var('Raw')),
|
|
28
|
+
sort(var('Raw'), var('Edges')))).
|
|
29
|
+
clause(23,
|
|
30
|
+
vertices(var('Vertices')),
|
|
31
|
+
(findall(var('V'), vertex(var('V')), var('Raw')), sort(var('Raw'), var('Vertices')))).
|
|
32
|
+
clause(25,
|
|
33
|
+
eulerian_start(var('Start')),
|
|
34
|
+
(odd_vertices([]), vertices([var('Start') | anonymous(1)]))).
|
|
35
|
+
clause(26,
|
|
36
|
+
eulerian_path(var('Path')),
|
|
37
|
+
(eulerian_start(var('Start')),
|
|
38
|
+
all_edges(var('Edges')),
|
|
39
|
+
dfs_euler(var('Start'), [var('Start')], var('Edges'), var('Reversedpath')),
|
|
40
|
+
reverse(var('Reversedpath'), var('Path')))).
|
|
41
|
+
clause(27, dfs_euler(anonymous(1), var('Path'), [], var('Path')), true).
|
|
42
|
+
clause(28,
|
|
43
|
+
dfs_euler(var('Current'), var('Visited'), var('Remaining'), var('Path')),
|
|
44
|
+
(adjacent_by_edge(var('Current'), var('Next'), var('Edge')),
|
|
45
|
+
select_item(var('Edge'), var('Remaining'), var('Newremaining')),
|
|
46
|
+
dfs_euler(var('Next'), [var('Next') | var('Visited')], var('Newremaining'), var('Path')))).
|
|
47
|
+
clause(29, oddVertices(eulerian_path_case, var('Odds')), odd_vertices(var('Odds'))).
|
|
48
|
+
clause(30, path(eulerian_path_case, var('Path')), once(eulerian_path(var('Path')))).
|
|
49
|
+
clause(31,
|
|
50
|
+
edgeCount(eulerian_path_case, var('Count')),
|
|
51
|
+
(all_edges(var('Edges')), length(var('Edges'), var('Count')))).
|
|
52
|
+
|
|
53
|
+
step(oddVertices(eulerian_path_case, []), rule(29), ['Odds' = []], [odd_vertices([])]).
|
|
54
|
+
step(odd_vertices([]),
|
|
55
|
+
rule(21),
|
|
56
|
+
['Odds' = [], 'Raw' = []],
|
|
57
|
+
[findall(V, odd_degree(V), []), sort([], [])]).
|
|
58
|
+
step(findall(V, odd_degree(V), []), collected, [], []).
|
|
59
|
+
step(sort([], []), builtin, [], []).
|
|
60
|
+
step(path(eulerian_path_case, [v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1]),
|
|
61
|
+
rule(30),
|
|
62
|
+
['Path' = [v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1]],
|
|
63
|
+
[once(eulerian_path([v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1]))]).
|
|
64
|
+
step(once(eulerian_path([v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1])),
|
|
65
|
+
builtin,
|
|
66
|
+
[],
|
|
67
|
+
[eulerian_path([v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1])]).
|
|
68
|
+
step(eulerian_path([v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1]),
|
|
69
|
+
rule(26),
|
|
70
|
+
['Path' = [v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1],
|
|
71
|
+
'Start' = v1,
|
|
72
|
+
'Edges' = [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46],
|
|
73
|
+
'Reversedpath' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]],
|
|
74
|
+
[eulerian_start(v1),
|
|
75
|
+
all_edges([e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]),
|
|
76
|
+
dfs_euler(v1, [v1], [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
77
|
+
reverse([v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1], [v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1])]).
|
|
78
|
+
step(eulerian_start(v1),
|
|
79
|
+
rule(25),
|
|
80
|
+
['Start' = v1],
|
|
81
|
+
[odd_vertices([]), vertices([v1, v2, v3, v4, v5, v6])]).
|
|
82
|
+
step(vertices([v1, v2, v3, v4, v5, v6]),
|
|
83
|
+
rule(23),
|
|
84
|
+
['Vertices' = [v1, v2, v3, v4, v5, v6],
|
|
85
|
+
'Raw' = [v1, v1, v1, v1, v2, v2, v2, v3, v3, v4, v4, v2, v3, v5, v6, v3, v4, v6, v4, v6, v5, v6]],
|
|
86
|
+
[findall(V, vertex(V), [v1, v1, v1, v1, v2, v2, v2, v3, v3, v4, v4, v2, v3, v5, v6, v3, v4, v6, v4, v6, v5, v6]),
|
|
87
|
+
sort([v1, v1, v1, v1, v2, v2, v2, v3, v3, v4, v4, v2, v3, v5, v6, v3, v4, v6, v4, v6, v5, v6], [v1, v2, v3, v4, v5, v6])]).
|
|
88
|
+
step(findall(V, vertex(V), [v1, v1, v1, v1, v2, v2, v2, v3, v3, v4, v4, v2, v3, v5, v6, v3, v4, v6, v4, v6, v5, v6]),
|
|
89
|
+
collected,
|
|
90
|
+
[],
|
|
91
|
+
[]).
|
|
92
|
+
step(sort([v1, v1, v1, v1, v2, v2, v2, v3, v3, v4, v4, v2, v3, v5, v6, v3, v4, v6, v4, v6, v5, v6], [v1, v2, v3, v4, v5, v6]),
|
|
93
|
+
builtin,
|
|
94
|
+
[],
|
|
95
|
+
[]).
|
|
96
|
+
step(all_edges([e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]),
|
|
97
|
+
rule(22),
|
|
98
|
+
['Edges' = [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46],
|
|
99
|
+
'Raw' = [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]],
|
|
100
|
+
[findall(E, edge(E, _a, _b), [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]),
|
|
101
|
+
sort([e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46])]).
|
|
102
|
+
step(findall(E, edge(E, _a, _b), [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]),
|
|
103
|
+
collected,
|
|
104
|
+
[],
|
|
105
|
+
[]).
|
|
106
|
+
step(sort([e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]),
|
|
107
|
+
builtin,
|
|
108
|
+
[],
|
|
109
|
+
[]).
|
|
110
|
+
step(dfs_euler(v1, [v1], [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
111
|
+
rule(28),
|
|
112
|
+
['Current' = v1,
|
|
113
|
+
'Visited' = [v1],
|
|
114
|
+
'Remaining' = [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46],
|
|
115
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
116
|
+
'Next' = v2,
|
|
117
|
+
'Edge' = e12,
|
|
118
|
+
'Newremaining' = [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]],
|
|
119
|
+
[adjacent_by_edge(v1, v2, e12),
|
|
120
|
+
select_item(e12, [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]),
|
|
121
|
+
dfs_euler(v2, [v2, v1], [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
122
|
+
step(adjacent_by_edge(v1, v2, e12),
|
|
123
|
+
rule(16),
|
|
124
|
+
['V' = v1, 'U' = v2, 'E' = e12],
|
|
125
|
+
[edge(e12, v1, v2)]).
|
|
126
|
+
step(edge(e12, v1, v2), fact(1), [], []).
|
|
127
|
+
step(select_item(e12, [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]),
|
|
128
|
+
fact(18),
|
|
129
|
+
['Item' = e12, 'Rest' = [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]],
|
|
130
|
+
[]).
|
|
131
|
+
step(dfs_euler(v2, [v2, v1], [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
132
|
+
rule(28),
|
|
133
|
+
['Current' = v2,
|
|
134
|
+
'Visited' = [v2, v1],
|
|
135
|
+
'Remaining' = [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46],
|
|
136
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
137
|
+
'Next' = v3,
|
|
138
|
+
'Edge' = e23,
|
|
139
|
+
'Newremaining' = [e13, e15, e16, e24, e26, e34, e36, e45, e46]],
|
|
140
|
+
[adjacent_by_edge(v2, v3, e23),
|
|
141
|
+
select_item(e23, [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [e13, e15, e16, e24, e26, e34, e36, e45, e46]),
|
|
142
|
+
dfs_euler(v3, [v3, v2, v1], [e13, e15, e16, e24, e26, e34, e36, e45, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
143
|
+
step(adjacent_by_edge(v2, v3, e23),
|
|
144
|
+
rule(16),
|
|
145
|
+
['V' = v2, 'U' = v3, 'E' = e23],
|
|
146
|
+
[edge(e23, v2, v3)]).
|
|
147
|
+
step(edge(e23, v2, v3), fact(5), [], []).
|
|
148
|
+
step(select_item(e23, [e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], [e13, e15, e16, e24, e26, e34, e36, e45, e46]),
|
|
149
|
+
rule(19),
|
|
150
|
+
['Item' = e23,
|
|
151
|
+
'Head' = e13,
|
|
152
|
+
'Tail' = [e15, e16, e23, e24, e26, e34, e36, e45, e46],
|
|
153
|
+
'Rest' = [e15, e16, e24, e26, e34, e36, e45, e46]],
|
|
154
|
+
[select_item(e23, [e15, e16, e23, e24, e26, e34, e36, e45, e46], [e15, e16, e24, e26, e34, e36, e45, e46])]).
|
|
155
|
+
step(select_item(e23, [e15, e16, e23, e24, e26, e34, e36, e45, e46], [e15, e16, e24, e26, e34, e36, e45, e46]),
|
|
156
|
+
rule(19),
|
|
157
|
+
['Item' = e23,
|
|
158
|
+
'Head' = e15,
|
|
159
|
+
'Tail' = [e16, e23, e24, e26, e34, e36, e45, e46],
|
|
160
|
+
'Rest' = [e16, e24, e26, e34, e36, e45, e46]],
|
|
161
|
+
[select_item(e23, [e16, e23, e24, e26, e34, e36, e45, e46], [e16, e24, e26, e34, e36, e45, e46])]).
|
|
162
|
+
step(select_item(e23, [e16, e23, e24, e26, e34, e36, e45, e46], [e16, e24, e26, e34, e36, e45, e46]),
|
|
163
|
+
rule(19),
|
|
164
|
+
['Item' = e23,
|
|
165
|
+
'Head' = e16,
|
|
166
|
+
'Tail' = [e23, e24, e26, e34, e36, e45, e46],
|
|
167
|
+
'Rest' = [e24, e26, e34, e36, e45, e46]],
|
|
168
|
+
[select_item(e23, [e23, e24, e26, e34, e36, e45, e46], [e24, e26, e34, e36, e45, e46])]).
|
|
169
|
+
step(select_item(e23, [e23, e24, e26, e34, e36, e45, e46], [e24, e26, e34, e36, e45, e46]),
|
|
170
|
+
fact(18),
|
|
171
|
+
['Item' = e23, 'Rest' = [e24, e26, e34, e36, e45, e46]],
|
|
172
|
+
[]).
|
|
173
|
+
step(dfs_euler(v3, [v3, v2, v1], [e13, e15, e16, e24, e26, e34, e36, e45, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
174
|
+
rule(28),
|
|
175
|
+
['Current' = v3,
|
|
176
|
+
'Visited' = [v3, v2, v1],
|
|
177
|
+
'Remaining' = [e13, e15, e16, e24, e26, e34, e36, e45, e46],
|
|
178
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
179
|
+
'Next' = v4,
|
|
180
|
+
'Edge' = e34,
|
|
181
|
+
'Newremaining' = [e13, e15, e16, e24, e26, e36, e45, e46]],
|
|
182
|
+
[adjacent_by_edge(v3, v4, e34),
|
|
183
|
+
select_item(e34, [e13, e15, e16, e24, e26, e34, e36, e45, e46], [e13, e15, e16, e24, e26, e36, e45, e46]),
|
|
184
|
+
dfs_euler(v4, [v4, v3, v2, v1], [e13, e15, e16, e24, e26, e36, e45, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
185
|
+
step(adjacent_by_edge(v3, v4, e34),
|
|
186
|
+
rule(16),
|
|
187
|
+
['V' = v3, 'U' = v4, 'E' = e34],
|
|
188
|
+
[edge(e34, v3, v4)]).
|
|
189
|
+
step(edge(e34, v3, v4), fact(8), [], []).
|
|
190
|
+
step(select_item(e34, [e13, e15, e16, e24, e26, e34, e36, e45, e46], [e13, e15, e16, e24, e26, e36, e45, e46]),
|
|
191
|
+
rule(19),
|
|
192
|
+
['Item' = e34,
|
|
193
|
+
'Head' = e13,
|
|
194
|
+
'Tail' = [e15, e16, e24, e26, e34, e36, e45, e46],
|
|
195
|
+
'Rest' = [e15, e16, e24, e26, e36, e45, e46]],
|
|
196
|
+
[select_item(e34, [e15, e16, e24, e26, e34, e36, e45, e46], [e15, e16, e24, e26, e36, e45, e46])]).
|
|
197
|
+
step(select_item(e34, [e15, e16, e24, e26, e34, e36, e45, e46], [e15, e16, e24, e26, e36, e45, e46]),
|
|
198
|
+
rule(19),
|
|
199
|
+
['Item' = e34,
|
|
200
|
+
'Head' = e15,
|
|
201
|
+
'Tail' = [e16, e24, e26, e34, e36, e45, e46],
|
|
202
|
+
'Rest' = [e16, e24, e26, e36, e45, e46]],
|
|
203
|
+
[select_item(e34, [e16, e24, e26, e34, e36, e45, e46], [e16, e24, e26, e36, e45, e46])]).
|
|
204
|
+
step(select_item(e34, [e16, e24, e26, e34, e36, e45, e46], [e16, e24, e26, e36, e45, e46]),
|
|
205
|
+
rule(19),
|
|
206
|
+
['Item' = e34,
|
|
207
|
+
'Head' = e16,
|
|
208
|
+
'Tail' = [e24, e26, e34, e36, e45, e46],
|
|
209
|
+
'Rest' = [e24, e26, e36, e45, e46]],
|
|
210
|
+
[select_item(e34, [e24, e26, e34, e36, e45, e46], [e24, e26, e36, e45, e46])]).
|
|
211
|
+
step(select_item(e34, [e24, e26, e34, e36, e45, e46], [e24, e26, e36, e45, e46]),
|
|
212
|
+
rule(19),
|
|
213
|
+
['Item' = e34,
|
|
214
|
+
'Head' = e24,
|
|
215
|
+
'Tail' = [e26, e34, e36, e45, e46],
|
|
216
|
+
'Rest' = [e26, e36, e45, e46]],
|
|
217
|
+
[select_item(e34, [e26, e34, e36, e45, e46], [e26, e36, e45, e46])]).
|
|
218
|
+
step(select_item(e34, [e26, e34, e36, e45, e46], [e26, e36, e45, e46]),
|
|
219
|
+
rule(19),
|
|
220
|
+
['Item' = e34, 'Head' = e26, 'Tail' = [e34, e36, e45, e46], 'Rest' = [e36, e45, e46]],
|
|
221
|
+
[select_item(e34, [e34, e36, e45, e46], [e36, e45, e46])]).
|
|
222
|
+
step(select_item(e34, [e34, e36, e45, e46], [e36, e45, e46]),
|
|
223
|
+
fact(18),
|
|
224
|
+
['Item' = e34, 'Rest' = [e36, e45, e46]],
|
|
225
|
+
[]).
|
|
226
|
+
step(dfs_euler(v4, [v4, v3, v2, v1], [e13, e15, e16, e24, e26, e36, e45, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
227
|
+
rule(28),
|
|
228
|
+
['Current' = v4,
|
|
229
|
+
'Visited' = [v4, v3, v2, v1],
|
|
230
|
+
'Remaining' = [e13, e15, e16, e24, e26, e36, e45, e46],
|
|
231
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
232
|
+
'Next' = v5,
|
|
233
|
+
'Edge' = e45,
|
|
234
|
+
'Newremaining' = [e13, e15, e16, e24, e26, e36, e46]],
|
|
235
|
+
[adjacent_by_edge(v4, v5, e45),
|
|
236
|
+
select_item(e45, [e13, e15, e16, e24, e26, e36, e45, e46], [e13, e15, e16, e24, e26, e36, e46]),
|
|
237
|
+
dfs_euler(v5, [v5, v4, v3, v2, v1], [e13, e15, e16, e24, e26, e36, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
238
|
+
step(adjacent_by_edge(v4, v5, e45),
|
|
239
|
+
rule(16),
|
|
240
|
+
['V' = v4, 'U' = v5, 'E' = e45],
|
|
241
|
+
[edge(e45, v4, v5)]).
|
|
242
|
+
step(edge(e45, v4, v5), fact(10), [], []).
|
|
243
|
+
step(select_item(e45, [e13, e15, e16, e24, e26, e36, e45, e46], [e13, e15, e16, e24, e26, e36, e46]),
|
|
244
|
+
rule(19),
|
|
245
|
+
['Item' = e45,
|
|
246
|
+
'Head' = e13,
|
|
247
|
+
'Tail' = [e15, e16, e24, e26, e36, e45, e46],
|
|
248
|
+
'Rest' = [e15, e16, e24, e26, e36, e46]],
|
|
249
|
+
[select_item(e45, [e15, e16, e24, e26, e36, e45, e46], [e15, e16, e24, e26, e36, e46])]).
|
|
250
|
+
step(select_item(e45, [e15, e16, e24, e26, e36, e45, e46], [e15, e16, e24, e26, e36, e46]),
|
|
251
|
+
rule(19),
|
|
252
|
+
['Item' = e45,
|
|
253
|
+
'Head' = e15,
|
|
254
|
+
'Tail' = [e16, e24, e26, e36, e45, e46],
|
|
255
|
+
'Rest' = [e16, e24, e26, e36, e46]],
|
|
256
|
+
[select_item(e45, [e16, e24, e26, e36, e45, e46], [e16, e24, e26, e36, e46])]).
|
|
257
|
+
step(select_item(e45, [e16, e24, e26, e36, e45, e46], [e16, e24, e26, e36, e46]),
|
|
258
|
+
rule(19),
|
|
259
|
+
['Item' = e45,
|
|
260
|
+
'Head' = e16,
|
|
261
|
+
'Tail' = [e24, e26, e36, e45, e46],
|
|
262
|
+
'Rest' = [e24, e26, e36, e46]],
|
|
263
|
+
[select_item(e45, [e24, e26, e36, e45, e46], [e24, e26, e36, e46])]).
|
|
264
|
+
step(select_item(e45, [e24, e26, e36, e45, e46], [e24, e26, e36, e46]),
|
|
265
|
+
rule(19),
|
|
266
|
+
['Item' = e45, 'Head' = e24, 'Tail' = [e26, e36, e45, e46], 'Rest' = [e26, e36, e46]],
|
|
267
|
+
[select_item(e45, [e26, e36, e45, e46], [e26, e36, e46])]).
|
|
268
|
+
step(select_item(e45, [e26, e36, e45, e46], [e26, e36, e46]),
|
|
269
|
+
rule(19),
|
|
270
|
+
['Item' = e45, 'Head' = e26, 'Tail' = [e36, e45, e46], 'Rest' = [e36, e46]],
|
|
271
|
+
[select_item(e45, [e36, e45, e46], [e36, e46])]).
|
|
272
|
+
step(select_item(e45, [e36, e45, e46], [e36, e46]),
|
|
273
|
+
rule(19),
|
|
274
|
+
['Item' = e45, 'Head' = e36, 'Tail' = [e45, e46], 'Rest' = [e46]],
|
|
275
|
+
[select_item(e45, [e45, e46], [e46])]).
|
|
276
|
+
step(select_item(e45, [e45, e46], [e46]), fact(18), ['Item' = e45, 'Rest' = [e46]], []).
|
|
277
|
+
step(dfs_euler(v5, [v5, v4, v3, v2, v1], [e13, e15, e16, e24, e26, e36, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
278
|
+
rule(28),
|
|
279
|
+
['Current' = v5,
|
|
280
|
+
'Visited' = [v5, v4, v3, v2, v1],
|
|
281
|
+
'Remaining' = [e13, e15, e16, e24, e26, e36, e46],
|
|
282
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
283
|
+
'Next' = v1,
|
|
284
|
+
'Edge' = e15,
|
|
285
|
+
'Newremaining' = [e13, e16, e24, e26, e36, e46]],
|
|
286
|
+
[adjacent_by_edge(v5, v1, e15),
|
|
287
|
+
select_item(e15, [e13, e15, e16, e24, e26, e36, e46], [e13, e16, e24, e26, e36, e46]),
|
|
288
|
+
dfs_euler(v1, [v1, v5, v4, v3, v2, v1], [e13, e16, e24, e26, e36, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
289
|
+
step(adjacent_by_edge(v5, v1, e15),
|
|
290
|
+
rule(17),
|
|
291
|
+
['V' = v5, 'U' = v1, 'E' = e15],
|
|
292
|
+
[edge(e15, v1, v5)]).
|
|
293
|
+
step(edge(e15, v1, v5), fact(3), [], []).
|
|
294
|
+
step(select_item(e15, [e13, e15, e16, e24, e26, e36, e46], [e13, e16, e24, e26, e36, e46]),
|
|
295
|
+
rule(19),
|
|
296
|
+
['Item' = e15,
|
|
297
|
+
'Head' = e13,
|
|
298
|
+
'Tail' = [e15, e16, e24, e26, e36, e46],
|
|
299
|
+
'Rest' = [e16, e24, e26, e36, e46]],
|
|
300
|
+
[select_item(e15, [e15, e16, e24, e26, e36, e46], [e16, e24, e26, e36, e46])]).
|
|
301
|
+
step(select_item(e15, [e15, e16, e24, e26, e36, e46], [e16, e24, e26, e36, e46]),
|
|
302
|
+
fact(18),
|
|
303
|
+
['Item' = e15, 'Rest' = [e16, e24, e26, e36, e46]],
|
|
304
|
+
[]).
|
|
305
|
+
step(dfs_euler(v1, [v1, v5, v4, v3, v2, v1], [e13, e16, e24, e26, e36, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
306
|
+
rule(28),
|
|
307
|
+
['Current' = v1,
|
|
308
|
+
'Visited' = [v1, v5, v4, v3, v2, v1],
|
|
309
|
+
'Remaining' = [e13, e16, e24, e26, e36, e46],
|
|
310
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
311
|
+
'Next' = v3,
|
|
312
|
+
'Edge' = e13,
|
|
313
|
+
'Newremaining' = [e16, e24, e26, e36, e46]],
|
|
314
|
+
[adjacent_by_edge(v1, v3, e13),
|
|
315
|
+
select_item(e13, [e13, e16, e24, e26, e36, e46], [e16, e24, e26, e36, e46]),
|
|
316
|
+
dfs_euler(v3, [v3, v1, v5, v4, v3, v2, v1], [e16, e24, e26, e36, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
317
|
+
step(adjacent_by_edge(v1, v3, e13),
|
|
318
|
+
rule(16),
|
|
319
|
+
['V' = v1, 'U' = v3, 'E' = e13],
|
|
320
|
+
[edge(e13, v1, v3)]).
|
|
321
|
+
step(edge(e13, v1, v3), fact(2), [], []).
|
|
322
|
+
step(select_item(e13, [e13, e16, e24, e26, e36, e46], [e16, e24, e26, e36, e46]),
|
|
323
|
+
fact(18),
|
|
324
|
+
['Item' = e13, 'Rest' = [e16, e24, e26, e36, e46]],
|
|
325
|
+
[]).
|
|
326
|
+
step(dfs_euler(v3, [v3, v1, v5, v4, v3, v2, v1], [e16, e24, e26, e36, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
327
|
+
rule(28),
|
|
328
|
+
['Current' = v3,
|
|
329
|
+
'Visited' = [v3, v1, v5, v4, v3, v2, v1],
|
|
330
|
+
'Remaining' = [e16, e24, e26, e36, e46],
|
|
331
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
332
|
+
'Next' = v6,
|
|
333
|
+
'Edge' = e36,
|
|
334
|
+
'Newremaining' = [e16, e24, e26, e46]],
|
|
335
|
+
[adjacent_by_edge(v3, v6, e36),
|
|
336
|
+
select_item(e36, [e16, e24, e26, e36, e46], [e16, e24, e26, e46]),
|
|
337
|
+
dfs_euler(v6, [v6, v3, v1, v5, v4, v3, v2, v1], [e16, e24, e26, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
338
|
+
step(adjacent_by_edge(v3, v6, e36),
|
|
339
|
+
rule(16),
|
|
340
|
+
['V' = v3, 'U' = v6, 'E' = e36],
|
|
341
|
+
[edge(e36, v3, v6)]).
|
|
342
|
+
step(edge(e36, v3, v6), fact(9), [], []).
|
|
343
|
+
step(select_item(e36, [e16, e24, e26, e36, e46], [e16, e24, e26, e46]),
|
|
344
|
+
rule(19),
|
|
345
|
+
['Item' = e36, 'Head' = e16, 'Tail' = [e24, e26, e36, e46], 'Rest' = [e24, e26, e46]],
|
|
346
|
+
[select_item(e36, [e24, e26, e36, e46], [e24, e26, e46])]).
|
|
347
|
+
step(select_item(e36, [e24, e26, e36, e46], [e24, e26, e46]),
|
|
348
|
+
rule(19),
|
|
349
|
+
['Item' = e36, 'Head' = e24, 'Tail' = [e26, e36, e46], 'Rest' = [e26, e46]],
|
|
350
|
+
[select_item(e36, [e26, e36, e46], [e26, e46])]).
|
|
351
|
+
step(select_item(e36, [e26, e36, e46], [e26, e46]),
|
|
352
|
+
rule(19),
|
|
353
|
+
['Item' = e36, 'Head' = e26, 'Tail' = [e36, e46], 'Rest' = [e46]],
|
|
354
|
+
[select_item(e36, [e36, e46], [e46])]).
|
|
355
|
+
step(select_item(e36, [e36, e46], [e46]), fact(18), ['Item' = e36, 'Rest' = [e46]], []).
|
|
356
|
+
step(dfs_euler(v6, [v6, v3, v1, v5, v4, v3, v2, v1], [e16, e24, e26, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
357
|
+
rule(28),
|
|
358
|
+
['Current' = v6,
|
|
359
|
+
'Visited' = [v6, v3, v1, v5, v4, v3, v2, v1],
|
|
360
|
+
'Remaining' = [e16, e24, e26, e46],
|
|
361
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
362
|
+
'Next' = v2,
|
|
363
|
+
'Edge' = e26,
|
|
364
|
+
'Newremaining' = [e16, e24, e46]],
|
|
365
|
+
[adjacent_by_edge(v6, v2, e26),
|
|
366
|
+
select_item(e26, [e16, e24, e26, e46], [e16, e24, e46]),
|
|
367
|
+
dfs_euler(v2, [v2, v6, v3, v1, v5, v4, v3, v2, v1], [e16, e24, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
368
|
+
step(adjacent_by_edge(v6, v2, e26),
|
|
369
|
+
rule(17),
|
|
370
|
+
['V' = v6, 'U' = v2, 'E' = e26],
|
|
371
|
+
[edge(e26, v2, v6)]).
|
|
372
|
+
step(edge(e26, v2, v6), fact(7), [], []).
|
|
373
|
+
step(select_item(e26, [e16, e24, e26, e46], [e16, e24, e46]),
|
|
374
|
+
rule(19),
|
|
375
|
+
['Item' = e26, 'Head' = e16, 'Tail' = [e24, e26, e46], 'Rest' = [e24, e46]],
|
|
376
|
+
[select_item(e26, [e24, e26, e46], [e24, e46])]).
|
|
377
|
+
step(select_item(e26, [e24, e26, e46], [e24, e46]),
|
|
378
|
+
rule(19),
|
|
379
|
+
['Item' = e26, 'Head' = e24, 'Tail' = [e26, e46], 'Rest' = [e46]],
|
|
380
|
+
[select_item(e26, [e26, e46], [e46])]).
|
|
381
|
+
step(select_item(e26, [e26, e46], [e46]), fact(18), ['Item' = e26, 'Rest' = [e46]], []).
|
|
382
|
+
step(dfs_euler(v2, [v2, v6, v3, v1, v5, v4, v3, v2, v1], [e16, e24, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
383
|
+
rule(28),
|
|
384
|
+
['Current' = v2,
|
|
385
|
+
'Visited' = [v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
386
|
+
'Remaining' = [e16, e24, e46],
|
|
387
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
388
|
+
'Next' = v4,
|
|
389
|
+
'Edge' = e24,
|
|
390
|
+
'Newremaining' = [e16, e46]],
|
|
391
|
+
[adjacent_by_edge(v2, v4, e24),
|
|
392
|
+
select_item(e24, [e16, e24, e46], [e16, e46]),
|
|
393
|
+
dfs_euler(v4, [v4, v2, v6, v3, v1, v5, v4, v3, v2, v1], [e16, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
394
|
+
step(adjacent_by_edge(v2, v4, e24),
|
|
395
|
+
rule(16),
|
|
396
|
+
['V' = v2, 'U' = v4, 'E' = e24],
|
|
397
|
+
[edge(e24, v2, v4)]).
|
|
398
|
+
step(edge(e24, v2, v4), fact(6), [], []).
|
|
399
|
+
step(select_item(e24, [e16, e24, e46], [e16, e46]),
|
|
400
|
+
rule(19),
|
|
401
|
+
['Item' = e24, 'Head' = e16, 'Tail' = [e24, e46], 'Rest' = [e46]],
|
|
402
|
+
[select_item(e24, [e24, e46], [e46])]).
|
|
403
|
+
step(select_item(e24, [e24, e46], [e46]), fact(18), ['Item' = e24, 'Rest' = [e46]], []).
|
|
404
|
+
step(dfs_euler(v4, [v4, v2, v6, v3, v1, v5, v4, v3, v2, v1], [e16, e46], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
405
|
+
rule(28),
|
|
406
|
+
['Current' = v4,
|
|
407
|
+
'Visited' = [v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
408
|
+
'Remaining' = [e16, e46],
|
|
409
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
410
|
+
'Next' = v6,
|
|
411
|
+
'Edge' = e46,
|
|
412
|
+
'Newremaining' = [e16]],
|
|
413
|
+
[adjacent_by_edge(v4, v6, e46),
|
|
414
|
+
select_item(e46, [e16, e46], [e16]),
|
|
415
|
+
dfs_euler(v6, [v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1], [e16], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
416
|
+
step(adjacent_by_edge(v4, v6, e46),
|
|
417
|
+
rule(16),
|
|
418
|
+
['V' = v4, 'U' = v6, 'E' = e46],
|
|
419
|
+
[edge(e46, v4, v6)]).
|
|
420
|
+
step(edge(e46, v4, v6), fact(11), [], []).
|
|
421
|
+
step(select_item(e46, [e16, e46], [e16]),
|
|
422
|
+
rule(19),
|
|
423
|
+
['Item' = e46, 'Head' = e16, 'Tail' = [e46], 'Rest' = []],
|
|
424
|
+
[select_item(e46, [e46], [])]).
|
|
425
|
+
step(select_item(e46, [e46], []), fact(18), ['Item' = e46, 'Rest' = []], []).
|
|
426
|
+
step(dfs_euler(v6, [v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1], [e16], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
427
|
+
rule(28),
|
|
428
|
+
['Current' = v6,
|
|
429
|
+
'Visited' = [v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
430
|
+
'Remaining' = [e16],
|
|
431
|
+
'Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1],
|
|
432
|
+
'Next' = v1,
|
|
433
|
+
'Edge' = e16,
|
|
434
|
+
'Newremaining' = []],
|
|
435
|
+
[adjacent_by_edge(v6, v1, e16),
|
|
436
|
+
select_item(e16, [e16], []),
|
|
437
|
+
dfs_euler(v1, [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1], [], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1])]).
|
|
438
|
+
step(adjacent_by_edge(v6, v1, e16),
|
|
439
|
+
rule(17),
|
|
440
|
+
['V' = v6, 'U' = v1, 'E' = e16],
|
|
441
|
+
[edge(e16, v1, v6)]).
|
|
442
|
+
step(edge(e16, v1, v6), fact(4), [], []).
|
|
443
|
+
step(select_item(e16, [e16], []), fact(18), ['Item' = e16, 'Rest' = []], []).
|
|
444
|
+
step(dfs_euler(v1, [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1], [], [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]),
|
|
445
|
+
fact(27),
|
|
446
|
+
['Path' = [v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1]],
|
|
447
|
+
[]).
|
|
448
|
+
step(reverse([v1, v6, v4, v2, v6, v3, v1, v5, v4, v3, v2, v1], [v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1]),
|
|
449
|
+
builtin,
|
|
450
|
+
[],
|
|
451
|
+
[]).
|
|
452
|
+
step(edgeCount(eulerian_path_case, 11),
|
|
453
|
+
rule(31),
|
|
454
|
+
['Count' = 11, 'Edges' = [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]],
|
|
455
|
+
[all_edges([e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46]),
|
|
456
|
+
length([e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], 11)]).
|
|
457
|
+
step(length([e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46], 11), builtin, [], []).
|