eyeprolog 1.6.19 → 1.6.21

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.
Files changed (99) hide show
  1. package/examples/check/access-control-policy.pl +2 -1
  2. package/examples/check/attributed-variables.pl +3 -1
  3. package/examples/check/binomial-vandermonde.pl +2 -1
  4. package/examples/check/blocks-world-planning.pl +13 -2
  5. package/examples/check/catalan-convolution.pl +2 -1
  6. package/examples/check/cdcl-sat-solver.pl +2 -1
  7. package/examples/check/chart-parser.pl +4 -1
  8. package/examples/check/clinical-trial-screening.pl +3 -1
  9. package/examples/check/clpb-boolean-circuit.pl +5 -1
  10. package/examples/check/clpb-cardinality.pl +3 -1
  11. package/examples/check/clpb-feature-model.pl +5 -1
  12. package/examples/check/clpz-resource-allocation.pl +1 -1
  13. package/examples/check/combinatorics-findall-sort.pl +1 -1
  14. package/examples/check/context-schema-audit.pl +2 -1
  15. package/examples/check/continued-fraction-sqrt2.pl +1 -1
  16. package/examples/check/critical-path-schedule.pl +12 -2
  17. package/examples/check/d3-group.pl +1 -1
  18. package/examples/check/data-negotiation.pl +1 -1
  19. package/examples/check/dcg-command-parser.pl +4 -2
  20. package/examples/check/dcg-expression-language.pl +6 -2
  21. package/examples/check/deep-taxonomy-1000.pl +6 -1
  22. package/examples/check/deep-taxonomy-10000.pl +6 -1
  23. package/examples/check/deep-taxonomy-100000.pl +6 -1
  24. package/examples/check/defeasible-reasoning.pl +5 -1
  25. package/examples/check/delfour.pl +2 -1
  26. package/examples/check/dijkstra-findall-sort.pl +11 -1
  27. package/examples/check/dijkstra.pl +17 -1
  28. package/examples/check/dog.pl +1 -1
  29. package/examples/check/donald-gerald-robert.pl +1 -1
  30. package/examples/check/enigma1225.pl +1 -1
  31. package/examples/check/equality-saturation.pl +2 -1
  32. package/examples/check/eulerian-path.pl +3 -1
  33. package/examples/check/evidence-demand-authority.pl +14 -0
  34. package/examples/check/explainable-ev-depot-configuration.pl +1 -1
  35. package/examples/check/flandor.pl +2 -1
  36. package/examples/check/four-color-map.pl +2 -1
  37. package/examples/check/gdpr-compliance.pl +4 -1
  38. package/examples/check/graph-reachability.pl +7 -1
  39. package/examples/check/hamiltonian-path.pl +408 -1
  40. package/examples/check/integer-partitions.pl +1 -1
  41. package/examples/check/intuitionistic-logic-kripke.pl +4 -1
  42. package/examples/check/iso-control-and-errors.pl +3 -1
  43. package/examples/check/iso-dynamic-database.pl +4 -4
  44. package/examples/check/iso-extension-pipeline-audit.pl +5 -2
  45. package/examples/check/iso-extensions.pl +5 -3
  46. package/examples/check/iso-grouped-solutions.pl +5 -3
  47. package/examples/check/iso-operators.pl +1 -1
  48. package/examples/check/iso-term-io.pl +13 -1
  49. package/examples/check/job-shop-scheduling.pl +2 -1
  50. package/examples/check/json.pl +2 -1
  51. package/examples/check/knapsack-optimization.pl +2 -1
  52. package/examples/check/knights-tour-warnsdorff.pl +24 -1
  53. package/examples/check/knuth-bendix-completion.pl +5 -2
  54. package/examples/check/lee.pl +15 -1
  55. package/examples/check/linear-logic-resources.pl +1 -1
  56. package/examples/check/map-four-color-search.pl +27 -1
  57. package/examples/check/markov-logic-network.pl +10 -2
  58. package/examples/check/matrix-chain-order.pl +7 -1
  59. package/examples/check/missionaries-cannibals.pl +12 -2
  60. package/examples/check/modal-logic-kripke.pl +2 -1
  61. package/examples/check/observability-log-correlation.pl +1 -1
  62. package/examples/check/odrl-dpv-healthcare-risk-ranked.pl +1 -1
  63. package/examples/check/odrl-dpv-risk-ranked.pl +1 -1
  64. package/examples/check/odrl-policy-reasoning.pl +40 -2
  65. package/examples/check/partial-evaluator.pl +7 -1
  66. package/examples/check/path-discovery.pl +7 -1
  67. package/examples/check/pell-equation.pl +1 -1
  68. package/examples/check/prime-range.pl +3 -2
  69. package/examples/check/propositional-dynamic-logic.pl +7 -2
  70. package/examples/check/quine-mccluskey.pl +21 -3
  71. package/examples/check/rdf12-annotated-claims.pl +1 -1
  72. package/examples/check/register-allocation.pl +2 -1
  73. package/examples/check/reified-conditionals.pl +4 -1
  74. package/examples/check/riemann-hypothesis.pl +4 -1
  75. package/examples/check/sat-solver-dpll.pl +1 -1
  76. package/examples/check/sbom-vulnerability-response.pl +4 -1
  77. package/examples/check/scientific-evidence-graph.pl +2 -1
  78. package/examples/check/send-more-money.pl +1 -1
  79. package/examples/check/sieve.pl +1 -1
  80. package/examples/check/snaf.pl +1 -1
  81. package/examples/check/stable-marriage.pl +2 -2
  82. package/examples/check/stirling-bell-numbers.pl +4 -1
  83. package/examples/check/superdense-coding.pl +8 -1
  84. package/examples/check/symbiotic-knowledge-graph.pl +14 -2
  85. package/examples/check/term-tools.pl +1 -1
  86. package/examples/check/totient-summatory.pl +4 -1
  87. package/examples/check/universal-vs-existential-termination.pl +1 -1
  88. package/examples/check/vanilla-meta-interpreter.pl +2 -1
  89. package/examples/check/weighted-interval-scheduling.pl +9 -2
  90. package/examples/check/wolf-goat-cabbage.pl +12 -1
  91. package/examples/check/workplace-compliance.pl +2 -1
  92. package/examples/evidence-demand-authority.pl +103 -0
  93. package/examples/output/evidence-demand-authority.pl +4 -0
  94. package/examples/proof/evidence-demand-authority.pl +53 -0
  95. package/package.json +1 -1
  96. package/playground.html +1 -0
  97. package/src/check-proof.js +18 -13
  98. package/src/cli.js +3 -1
  99. package/the-art-of-eyeprolog.md +276 -243
package/examples/check/hamiltonian-path.pl CHANGED
@@ -3,7 +3,414 @@ condition('C2', well_founded, ok, 688).
3
3
  condition('C3', justification, ok, 688).
4
4
  condition('C4', coverage, ok, 2184).
5
5
  condition('C5', re_decision, ok, 0).
6
- obligation(absent, theory_scoped, 408).
6
+ obligation(absent, theory_scoped, \+ member(v2, [v1])).
7
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v2])).
8
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v2, v3])).
9
+ obligation(absent, theory_scoped, \+ member(v4, [v1, v2, v3, v6])).
10
+ obligation(absent, theory_scoped, \+ member(v5, [v1, v2, v3, v6, v4])).
11
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v2])).
12
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v2, v6])).
13
+ obligation(absent, theory_scoped, \+ member(v4, [v1, v2, v6, v3])).
14
+ obligation(absent, theory_scoped, \+ member(v5, [v1, v2, v6, v3, v4])).
15
+ obligation(absent, theory_scoped, \+ member(v3, [v1])).
16
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v3])).
17
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v3, v2])).
18
+ obligation(absent, theory_scoped, \+ member(v4, [v1, v3, v2, v6])).
19
+ obligation(absent, theory_scoped, \+ member(v5, [v1, v3, v2, v6, v4])).
20
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v3])).
21
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v3, v6])).
22
+ obligation(absent, theory_scoped, \+ member(v4, [v1, v3, v6, v2])).
23
+ obligation(absent, theory_scoped, \+ member(v5, [v1, v3, v6, v2, v4])).
24
+ obligation(absent, theory_scoped, \+ member(v5, [v1])).
25
+ obligation(absent, theory_scoped, \+ member(v4, [v1, v5])).
26
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v5, v4])).
27
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v5, v4, v2])).
28
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v5, v4, v2, v3])).
29
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v5, v4, v2])).
30
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v5, v4, v2, v6])).
31
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v5, v4])).
32
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v5, v4, v3])).
33
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v5, v4, v3, v2])).
34
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v5, v4, v3])).
35
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v5, v4, v3, v6])).
36
+ obligation(absent, theory_scoped, \+ member(v6, [v1, v5, v4])).
37
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v5, v4, v6])).
38
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v5, v4, v6, v2])).
39
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v5, v4, v6])).
40
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v5, v4, v6, v3])).
41
+ obligation(absent, theory_scoped, \+ member(v6, [v1])).
42
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v6])).
43
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v6, v2])).
44
+ obligation(absent, theory_scoped, \+ member(v4, [v1, v6, v2, v3])).
45
+ obligation(absent, theory_scoped, \+ member(v5, [v1, v6, v2, v3, v4])).
46
+ obligation(absent, theory_scoped, \+ member(v3, [v1, v6])).
47
+ obligation(absent, theory_scoped, \+ member(v2, [v1, v6, v3])).
48
+ obligation(absent, theory_scoped, \+ member(v4, [v1, v6, v3, v2])).
49
+ obligation(absent, theory_scoped, \+ member(v5, [v1, v6, v3, v2, v4])).
50
+ obligation(absent, theory_scoped, \+ member(v1, [v2])).
51
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v1])).
52
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v1, v3])).
53
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v1, v3, v6])).
54
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v1, v3, v6, v4])).
55
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v1])).
56
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v1, v5])).
57
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v1, v5, v4])).
58
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v1, v5, v4, v3])).
59
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v1, v5, v4])).
60
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v1, v5, v4, v6])).
61
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v1])).
62
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v1, v6])).
63
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v1, v6, v3])).
64
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v1, v6, v3, v4])).
65
+ obligation(absent, theory_scoped, \+ member(v3, [v2])).
66
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v3])).
67
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v3, v1])).
68
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v3, v1, v5])).
69
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v3, v1, v5, v4])).
70
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v3, v1])).
71
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v3, v1, v6])).
72
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v3, v1, v6, v4])).
73
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v3])).
74
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v3, v4])).
75
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v3, v4, v5])).
76
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v3, v4, v5, v1])).
77
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v3, v4])).
78
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v3, v4, v6])).
79
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v3, v4, v6, v1])).
80
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v3])).
81
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v3, v6])).
82
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v3, v6, v1])).
83
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v3, v6, v1, v5])).
84
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v3, v6])).
85
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v3, v6, v4])).
86
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v3, v6, v4, v5])).
87
+ obligation(absent, theory_scoped, \+ member(v4, [v2])).
88
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v4])).
89
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v4, v3])).
90
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v4, v3, v6])).
91
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v4, v3, v6, v1])).
92
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v4])).
93
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v4, v5])).
94
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v4, v5, v1])).
95
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v4, v5, v1, v3])).
96
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v4, v5, v1])).
97
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v4, v5, v1, v6])).
98
+ obligation(absent, theory_scoped, \+ member(v6, [v2, v4])).
99
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v4, v6])).
100
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v4, v6, v3])).
101
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v4, v6, v3, v1])).
102
+ obligation(absent, theory_scoped, \+ member(v6, [v2])).
103
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v6])).
104
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v6, v1])).
105
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v6, v1, v3])).
106
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v6, v1, v3, v4])).
107
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v6, v1])).
108
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v6, v1, v5])).
109
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v6, v1, v5, v4])).
110
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v6])).
111
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v6, v3])).
112
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v6, v3, v1])).
113
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v6, v3, v1, v5])).
114
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v6, v3])).
115
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v6, v3, v4])).
116
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v6, v3, v4, v5])).
117
+ obligation(absent, theory_scoped, \+ member(v4, [v2, v6])).
118
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v6, v4])).
119
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v6, v4, v3])).
120
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v6, v4, v3, v1])).
121
+ obligation(absent, theory_scoped, \+ member(v5, [v2, v6, v4])).
122
+ obligation(absent, theory_scoped, \+ member(v1, [v2, v6, v4, v5])).
123
+ obligation(absent, theory_scoped, \+ member(v3, [v2, v6, v4, v5, v1])).
124
+ obligation(absent, theory_scoped, \+ member(v1, [v3])).
125
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v1])).
126
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v1, v2])).
127
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v1, v2, v6])).
128
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v1, v2, v6, v4])).
129
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v1])).
130
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v1, v5])).
131
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v1, v5, v4])).
132
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v1, v5, v4, v2])).
133
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v1, v5, v4])).
134
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v1, v5, v4, v6])).
135
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v1])).
136
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v1, v6])).
137
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v1, v6, v2])).
138
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v1, v6, v2, v4])).
139
+ obligation(absent, theory_scoped, \+ member(v2, [v3])).
140
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v2])).
141
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v2, v1])).
142
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v2, v1, v5])).
143
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v2, v1, v5, v4])).
144
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v2, v1])).
145
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v2, v1, v6])).
146
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v2, v1, v6, v4])).
147
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v2])).
148
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v2, v4])).
149
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v2, v4, v5])).
150
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v2, v4, v5, v1])).
151
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v2, v4])).
152
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v2, v4, v6])).
153
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v2, v4, v6, v1])).
154
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v2])).
155
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v2, v6])).
156
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v2, v6, v1])).
157
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v2, v6, v1, v5])).
158
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v2, v6])).
159
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v2, v6, v4])).
160
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v2, v6, v4, v5])).
161
+ obligation(absent, theory_scoped, \+ member(v4, [v3])).
162
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v4])).
163
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v4, v2])).
164
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v4, v2, v6])).
165
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v4, v2, v6, v1])).
166
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v4])).
167
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v4, v5])).
168
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v4, v5, v1])).
169
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v4, v5, v1, v2])).
170
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v4, v5, v1])).
171
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v4, v5, v1, v6])).
172
+ obligation(absent, theory_scoped, \+ member(v6, [v3, v4])).
173
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v4, v6])).
174
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v4, v6, v2])).
175
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v4, v6, v2, v1])).
176
+ obligation(absent, theory_scoped, \+ member(v6, [v3])).
177
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v6])).
178
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v6, v1])).
179
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v6, v1, v2])).
180
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v6, v1, v2, v4])).
181
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v6, v1])).
182
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v6, v1, v5])).
183
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v6, v1, v5, v4])).
184
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v6])).
185
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v6, v2])).
186
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v6, v2, v1])).
187
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v6, v2, v1, v5])).
188
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v6, v2])).
189
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v6, v2, v4])).
190
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v6, v2, v4, v5])).
191
+ obligation(absent, theory_scoped, \+ member(v4, [v3, v6])).
192
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v6, v4])).
193
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v6, v4, v2])).
194
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v6, v4, v2, v1])).
195
+ obligation(absent, theory_scoped, \+ member(v5, [v3, v6, v4])).
196
+ obligation(absent, theory_scoped, \+ member(v1, [v3, v6, v4, v5])).
197
+ obligation(absent, theory_scoped, \+ member(v2, [v3, v6, v4, v5, v1])).
198
+ obligation(absent, theory_scoped, \+ member(v2, [v4])).
199
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v2])).
200
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v2, v3])).
201
+ obligation(absent, theory_scoped, \+ member(v1, [v4, v2, v3, v6])).
202
+ obligation(absent, theory_scoped, \+ member(v5, [v4, v2, v3, v6, v1])).
203
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v2])).
204
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v2, v6])).
205
+ obligation(absent, theory_scoped, \+ member(v1, [v4, v2, v6, v3])).
206
+ obligation(absent, theory_scoped, \+ member(v5, [v4, v2, v6, v3, v1])).
207
+ obligation(absent, theory_scoped, \+ member(v3, [v4])).
208
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v3])).
209
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v3, v2])).
210
+ obligation(absent, theory_scoped, \+ member(v1, [v4, v3, v2, v6])).
211
+ obligation(absent, theory_scoped, \+ member(v5, [v4, v3, v2, v6, v1])).
212
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v3])).
213
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v3, v6])).
214
+ obligation(absent, theory_scoped, \+ member(v1, [v4, v3, v6, v2])).
215
+ obligation(absent, theory_scoped, \+ member(v5, [v4, v3, v6, v2, v1])).
216
+ obligation(absent, theory_scoped, \+ member(v5, [v4])).
217
+ obligation(absent, theory_scoped, \+ member(v1, [v4, v5])).
218
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v5, v1])).
219
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v5, v1, v2])).
220
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v5, v1, v2, v3])).
221
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v5, v1, v2])).
222
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v5, v1, v2, v6])).
223
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v5, v1])).
224
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v5, v1, v3])).
225
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v5, v1, v3, v2])).
226
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v5, v1, v3])).
227
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v5, v1, v3, v6])).
228
+ obligation(absent, theory_scoped, \+ member(v6, [v4, v5, v1])).
229
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v5, v1, v6])).
230
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v5, v1, v6, v2])).
231
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v5, v1, v6])).
232
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v5, v1, v6, v3])).
233
+ obligation(absent, theory_scoped, \+ member(v6, [v4])).
234
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v6])).
235
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v6, v2])).
236
+ obligation(absent, theory_scoped, \+ member(v1, [v4, v6, v2, v3])).
237
+ obligation(absent, theory_scoped, \+ member(v5, [v4, v6, v2, v3, v1])).
238
+ obligation(absent, theory_scoped, \+ member(v3, [v4, v6])).
239
+ obligation(absent, theory_scoped, \+ member(v2, [v4, v6, v3])).
240
+ obligation(absent, theory_scoped, \+ member(v1, [v4, v6, v3, v2])).
241
+ obligation(absent, theory_scoped, \+ member(v5, [v4, v6, v3, v2, v1])).
242
+ obligation(absent, theory_scoped, \+ member(v1, [v5])).
243
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1])).
244
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v2])).
245
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v2, v3])).
246
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v2, v3, v4])).
247
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v2, v3])).
248
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v2, v3, v6])).
249
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v2])).
250
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v2, v4])).
251
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v2, v4, v3])).
252
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v2, v4])).
253
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v2, v4, v6])).
254
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v2])).
255
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v2, v6])).
256
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v2, v6, v3])).
257
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v2, v6])).
258
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v2, v6, v4])).
259
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1])).
260
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v3])).
261
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v3, v2])).
262
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v3, v2, v4])).
263
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v3, v2])).
264
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v3, v2, v6])).
265
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v3])).
266
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v3, v4])).
267
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v3, v4, v2])).
268
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v3, v4])).
269
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v3, v4, v6])).
270
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1, v3])).
271
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v3, v6])).
272
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v3, v6, v2])).
273
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v3, v6])).
274
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v3, v6, v4])).
275
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v1])).
276
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v6])).
277
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v6, v2])).
278
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v6, v2, v3])).
279
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v6, v2])).
280
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v6, v2, v4])).
281
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v6])).
282
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v6, v3])).
283
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v6, v3, v2])).
284
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v6, v3])).
285
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v6, v3, v4])).
286
+ obligation(absent, theory_scoped, \+ member(v4, [v5, v1, v6])).
287
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v6, v4])).
288
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v6, v4, v2])).
289
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v1, v6, v4])).
290
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v1, v6, v4, v3])).
291
+ obligation(absent, theory_scoped, \+ member(v4, [v5])).
292
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4])).
293
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v2])).
294
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v2, v1])).
295
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v2, v1, v3])).
296
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v2, v1])).
297
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v2, v1, v6])).
298
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v2])).
299
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v2, v3])).
300
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v2, v3, v1])).
301
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v2, v3])).
302
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v2, v3, v6])).
303
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v2])).
304
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v2, v6])).
305
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v2, v6, v1])).
306
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v2, v6])).
307
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v2, v6, v3])).
308
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4])).
309
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v3])).
310
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v3, v1])).
311
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v3, v1, v2])).
312
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v3, v1])).
313
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v3, v1, v6])).
314
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v3])).
315
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v3, v2])).
316
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v3, v2, v1])).
317
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v3, v2])).
318
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v3, v2, v6])).
319
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4, v3])).
320
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v3, v6])).
321
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v3, v6, v1])).
322
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v3, v6])).
323
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v3, v6, v2])).
324
+ obligation(absent, theory_scoped, \+ member(v6, [v5, v4])).
325
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v6])).
326
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v6, v1])).
327
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v6, v1, v2])).
328
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v6, v1])).
329
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v6, v1, v3])).
330
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v6])).
331
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v6, v2])).
332
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v6, v2, v1])).
333
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v6, v2])).
334
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v6, v2, v3])).
335
+ obligation(absent, theory_scoped, \+ member(v3, [v5, v4, v6])).
336
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v6, v3])).
337
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v6, v3, v1])).
338
+ obligation(absent, theory_scoped, \+ member(v2, [v5, v4, v6, v3])).
339
+ obligation(absent, theory_scoped, \+ member(v1, [v5, v4, v6, v3, v2])).
340
+ obligation(absent, theory_scoped, \+ member(v1, [v6])).
341
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v1])).
342
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v1, v2])).
343
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v1, v2, v3])).
344
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v1, v2, v3, v4])).
345
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v1])).
346
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v1, v3])).
347
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v1, v3, v2])).
348
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v1, v3, v2, v4])).
349
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v1])).
350
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v1, v5])).
351
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v1, v5, v4])).
352
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v1, v5, v4, v2])).
353
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v1, v5, v4])).
354
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v1, v5, v4, v3])).
355
+ obligation(absent, theory_scoped, \+ member(v2, [v6])).
356
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v2])).
357
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v2, v1])).
358
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v2, v1, v3])).
359
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v2, v1, v3, v4])).
360
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v2, v1])).
361
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v2, v1, v5])).
362
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v2, v1, v5, v4])).
363
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v2])).
364
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v2, v3])).
365
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v2, v3, v1])).
366
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v2, v3, v1, v5])).
367
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v2, v3])).
368
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v2, v3, v4])).
369
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v2, v3, v4, v5])).
370
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v2])).
371
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v2, v4])).
372
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v2, v4, v3])).
373
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v2, v4, v3, v1])).
374
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v2, v4])).
375
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v2, v4, v5])).
376
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v2, v4, v5, v1])).
377
+ obligation(absent, theory_scoped, \+ member(v3, [v6])).
378
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v3])).
379
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v3, v1])).
380
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v3, v1, v2])).
381
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v3, v1, v2, v4])).
382
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v3, v1])).
383
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v3, v1, v5])).
384
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v3, v1, v5, v4])).
385
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v3])).
386
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v3, v2])).
387
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v3, v2, v1])).
388
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v3, v2, v1, v5])).
389
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v3, v2])).
390
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v3, v2, v4])).
391
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v3, v2, v4, v5])).
392
+ obligation(absent, theory_scoped, \+ member(v4, [v6, v3])).
393
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v3, v4])).
394
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v3, v4, v2])).
395
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v3, v4, v2, v1])).
396
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v3, v4])).
397
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v3, v4, v5])).
398
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v3, v4, v5, v1])).
399
+ obligation(absent, theory_scoped, \+ member(v4, [v6])).
400
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v4])).
401
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v4, v2])).
402
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v4, v2, v3])).
403
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v4, v2, v3, v1])).
404
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v4])).
405
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v4, v3])).
406
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v4, v3, v2])).
407
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v4, v3, v2, v1])).
408
+ obligation(absent, theory_scoped, \+ member(v5, [v6, v4])).
409
+ obligation(absent, theory_scoped, \+ member(v1, [v6, v4, v5])).
410
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v4, v5, v1])).
411
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v4, v5, v1, v2])).
412
+ obligation(absent, theory_scoped, \+ member(v3, [v6, v4, v5, v1])).
413
+ obligation(absent, theory_scoped, \+ member(v2, [v6, v4, v5, v1, v3])).
7
414
  steps(688).
8
415
  verified(280).
9
416
  recomputed(0).
package/examples/check/integer-partitions.pl CHANGED
@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 476).
3
3
  condition('C3', justification, ok, 476).
4
4
  condition('C4', coverage, ok, 975).
5
5
  condition('C5', re_decision, ok, 307).
6
- obligation(builtin, theory_scoped, 1).
6
+ obligation(builtin, theory_scoped, sumall(Expression, (between(1, 8, N), partition_count(N, Expression)), 66)).
7
7
  steps(476).
8
8
  verified(168).
9
9
  recomputed(307).
package/examples/check/intuitionistic-logic-kripke.pl CHANGED
@@ -3,7 +3,10 @@ condition('C2', well_founded, ok, 19).
3
3
  condition('C3', justification, ok, 19).
4
4
  condition('C4', coverage, ok, 20).
5
5
  condition('C5', re_decision, ok, 0).
6
- obligation(absent, theory_scoped, 4).
6
+ obligation(absent, theory_scoped, \+ bad_implication(root, atom(p), or(atom(p), atom(q)))).
7
+ obligation(absent, theory_scoped, \+ bad_implication(root, neg(or(atom(p), atom(q))), bottom)).
8
+ obligation(absent, theory_scoped, \+ forces(root, or(atom(p), atom(q)))).
9
+ obligation(absent, theory_scoped, \+ forces(root, or(atom(p), neg(atom(p))))).
7
10
  steps(19).
8
11
  verified(15).
9
12
  recomputed(0).
package/examples/check/iso-control-and-errors.pl CHANGED
@@ -3,7 +3,9 @@ condition('C2', well_founded, ok, 16).
3
3
  condition('C3', justification, ok, 16).
4
4
  condition('C4', coverage, ok, 17).
5
5
  condition('C5', re_decision, ok, 2).
6
- obligation(builtin, theory_scoped, 3).
6
+ obligation(builtin, theory_scoped, call(route(antwerp, ghent)) -> connected = connected ; connected = disconnected).
7
+ obligation(builtin, theory_scoped, call(route(antwerp, paris)) -> disconnected = connected ; disconnected = disconnected).
8
+ obligation(builtin, theory_scoped, catch((require_route(antwerp, paris), rejected = accepted), no_route(antwerp, paris), rejected = rejected)).
7
9
  steps(16).
8
10
  verified(11).
9
11
  recomputed(1).
package/examples/check/iso-dynamic-database.pl CHANGED
@@ -3,10 +3,10 @@ condition('C2', well_founded, ok, 9).
3
3
  condition('C3', justification, ok, 9).
4
4
  condition('C4', coverage, ok, 9).
5
5
  condition('C5', re_decision, ok, 1).
6
- obligation(asserted, theory_scoped, 1).
7
- obligation(collected, theory_scoped, 1).
8
- obligation(absent, theory_scoped, 1).
9
- obligation(builtin, reflective, 1).
6
+ obligation(asserted, theory_scoped, task(check_power, urgent)).
7
+ obligation(collected, theory_scoped, findall(task(Task, Priority), task(Task, Priority), [task(check_power, urgent), task(check_network, normal), task(archive_logs, low)])).
8
+ obligation(absent, theory_scoped, \+ task(old_probe, obsolete)).
9
+ obligation(builtin, reflective, current_predicate(task / 2)).
10
10
  steps(9).
11
11
  verified(4).
12
12
  recomputed(0).
package/examples/check/iso-extension-pipeline-audit.pl CHANGED
@@ -3,8 +3,11 @@ condition('C2', well_founded, ok, 8).
3
3
  condition('C3', justification, ok, 8).
4
4
  condition('C4', coverage, ok, 8).
5
5
  condition('C5', re_decision, ok, 1).
6
- obligation(builtin, theory_scoped, 4).
7
- obligation(collected, theory_scoped, 1).
6
+ obligation(builtin, theory_scoped, countall(stage(__anon0, __anon1), 5)).
7
+ obligation(builtin, theory_scoped, countall(transition(__anon2, __anon3, __anon4), 4)).
8
+ obligation(collected, theory_scoped, findall(stage(Index, Name, outgoing(Outgoing)), (cfor(0, 4, Index), stage(Index, Name), countall(transition(Index, __anon5, __anon6), Outgoing)), [stage(0, receive, outgoing(1)), stage(1, parse, outgoing(1)), stage(2, validate, outgoing(1)), stage(3, reason, outgoing(1)), stage(4, publish, outgoing(0))])).
9
+ obligation(builtin, theory_scoped, findall(step(Index, From, To), transition(Index, From, To), [step(0, receive, parse), step(1, parse, validate), step(2, validate, reason), step(3, reason, publish), complete], [complete])).
10
+ obligation(builtin, theory_scoped, forall(transition(Index, From, To), transition_is_well_formed(Index, From, To))).
8
11
  steps(8).
9
12
  verified(2).
10
13
  recomputed(1).
package/examples/check/iso-extensions.pl CHANGED
@@ -3,9 +3,11 @@ condition('C2', well_founded, ok, 12).
3
3
  condition('C3', justification, ok, 12).
4
4
  condition('C4', coverage, ok, 12).
5
5
  condition('C5', re_decision, ok, 1).
6
- obligation(builtin, theory_scoped, 3).
7
- obligation(collected, theory_scoped, 1).
8
- obligation(absent, theory_scoped, 1).
6
+ obligation(builtin, theory_scoped, forall(color(Color), atom(Color))).
7
+ obligation(collected, theory_scoped, findall(N - S, (cfor(1, 3, N), succ(N, S)), [1 - 2, 2 - 3, 3 - 4])).
8
+ obligation(builtin, theory_scoped, findall(Template, color(Template), [red, green, blue, done], [done])).
9
+ obligation(absent, theory_scoped, \+ variant(tree(X, X), tree(__anon0, _Y))).
10
+ obligation(builtin, theory_scoped, countall(color(__anon1), 3)).
9
11
  steps(12).
10
12
  verified(6).
11
13
  recomputed(1).
package/examples/check/iso-grouped-solutions.pl CHANGED
@@ -3,9 +3,11 @@ condition('C2', well_founded, ok, 21).
3
3
  condition('C3', justification, ok, 21).
4
4
  condition('C4', coverage, ok, 22).
5
5
  condition('C5', re_decision, ok, 4).
6
- obligation(collected, theory_scoped, 1).
7
- obligation(builtin, theory_scoped, 3).
8
- obligation(builtin, reflective, 1).
6
+ obligation(collected, theory_scoped, findall(Amount, sale(__anon0, __anon1, Amount), [7, 7, 5, 9])).
7
+ obligation(builtin, theory_scoped, bagof(Amount, Seller ^ sale(north, Seller, Amount), [7, 7, 5])).
8
+ obligation(builtin, theory_scoped, bagof(Amount, Seller ^ sale(south, Seller, Amount), [9])).
9
+ obligation(builtin, theory_scoped, setof(Region, Seller ^ Amount ^ sale(Region, Seller, Amount), [north, south])).
10
+ obligation(builtin, reflective, clause(sale(north, ada, 7), true)).
9
11
  steps(21).
10
12
  verified(12).
11
13
  recomputed(4).
package/examples/check/iso-operators.pl CHANGED
@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 9).
3
3
  condition('C3', justification, ok, 9).
4
4
  condition('C4', coverage, ok, 9).
5
5
  condition('C5', re_decision, ok, 2).
6
- obligation(builtin, reflective, 1).
6
+ obligation(builtin, reflective, current_op(600, xfx, reports)).
7
7
  steps(9).
8
8
  verified(6).
9
9
  recomputed(2).
package/examples/check/iso-term-io.pl CHANGED
@@ -3,7 +3,19 @@ condition('C2', well_founded, ok, 20).
3
3
  condition('C3', justification, ok, 20).
4
4
  condition('C4', coverage, ok, 22).
5
5
  condition('C5', re_decision, ok, 3).
6
- obligation(builtin, stateful, 13).
6
+ obligation(builtin, stateful, open('/tmp/eyeprolog-iso-term-io-example.pl', read, '$stream'(1), [])).
7
+ obligation(builtin, stateful, read('$stream'(1), event(sensor_7, online))).
8
+ obligation(builtin, stateful, close('$stream'(1))).
9
+ obligation(builtin, stateful, open('/tmp/eyeprolog-iso-term-io-example.pl', read, '$stream'(2), [])).
10
+ obligation(builtin, stateful, read('$stream'(2), event(sensor_7, online))).
11
+ obligation(builtin, stateful, read_term('$stream'(2), rule(_read_3_0, _read_3_0, _read_3_1), [variables([_read_3_0, _read_3_1]), variable_names(['_A' = _read_3_0, '_B' = _read_3_1]), singletons(['_B' = _read_3_1])])).
12
+ obligation(builtin, stateful, close('$stream'(2))).
13
+ obligation(builtin, stateful, open('/tmp/eyeprolog-iso-term-io-example.pl', read, '$stream'(4), [eof_action(eof_code)])).
14
+ obligation(builtin, stateful, read('$stream'(4), event(sensor_7, online))).
15
+ obligation(builtin, stateful, read('$stream'(4), rule(_read_5_0, _read_5_0, _read_5_1))).
16
+ obligation(builtin, stateful, read('$stream'(4), end_of_file)).
17
+ obligation(builtin, stateful, at_end_of_stream('$stream'(4))).
18
+ obligation(builtin, stateful, close('$stream'(4))).
7
19
  steps(20).
8
20
  verified(4).
9
21
  recomputed(3).
package/examples/check/job-shop-scheduling.pl CHANGED
@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 6).
3
3
  condition('C3', justification, ok, 6).
4
4
  condition('C4', coverage, ok, 7).
5
5
  condition('C5', re_decision, ok, 0).
6
- obligation(builtin, theory_scoped, 2).
6
+ obligation(builtin, theory_scoped, aggregate_min(9, [op(j1_mill, 0, 3), op(j1_lathe, 3, 5), op(j2_lathe, 0, 2), op(j2_mill, 5, 9), op(j3_mill, 3, 5), op(j3_lathe, 5, 8)], feasible_schedule(9, [op(j1_mill, 0, 3), op(j1_lathe, 3, 5), op(j2_lathe, 0, 2), op(j2_mill, 5, 9), op(j3_mill, 3, 5), op(j3_lathe, 5, 8)]), 9, [op(j1_mill, 0, 3), op(j1_lathe, 3, 5), op(j2_lathe, 0, 2), op(j2_mill, 5, 9), op(j3_mill, 3, 5), op(j3_lathe, 5, 8)])).
7
+ obligation(builtin, theory_scoped, countall(feasible_schedule(_makespan, _schedule), 35)).
7
8
  steps(6).
8
9
  verified(4).
9
10
  recomputed(0).
package/examples/check/json.pl CHANGED
@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 5).
3
3
  condition('C3', justification, ok, 5).
4
4
  condition('C4', coverage, ok, 5).
5
5
  condition('C5', re_decision, ok, 1).
6
- obligation(builtin, theory_scoped, 2).
6
+ obligation(builtin, theory_scoped, phrase(json_chars(pairs([string("name") - string("Ada"), string("active") - boolean(true), string("scores") - list([number(3), number(5), number(8)]), string("emoji") - string("😀")])), "{\"name\":\"Ada\",\"active\":true,\"scores\":[3,5,8],\"emoji\":\"\\uD83D\\uDE00\"}")).
7
+ obligation(builtin, theory_scoped, phrase(json_chars(pairs([string("project") - string("EyeProlog"), string("ok") - boolean(true)])), "{\"project\":\"EyeProlog\",\"ok\":true}")).
7
8
  steps(5).
8
9
  verified(2).
9
10
  recomputed(0).
package/examples/check/knapsack-optimization.pl CHANGED
@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 7).
3
3
  condition('C3', justification, ok, 7).
4
4
  condition('C4', coverage, ok, 9).
5
5
  condition('C5', re_decision, ok, 0).
6
- obligation(builtin, theory_scoped, 2).
6
+ obligation(builtin, theory_scoped, aggregate_max(40, pack([atlas, battery, camera, medkit, sensor], 15), feasible_pack([atlas, battery, camera, medkit, sensor], 15, 40), 40, pack([atlas, battery, camera, medkit, sensor], 15))).
7
+ obligation(builtin, theory_scoped, countall(feasible_pack(_pack, _weight, _value), 113)).
7
8
  steps(7).
8
9
  verified(5).
9
10
  recomputed(0).
package/examples/check/knights-tour-warnsdorff.pl CHANGED
@@ -3,7 +3,30 @@ condition('C2', well_founded, ok, 105).
3
3
  condition('C3', justification, ok, 105).
4
4
  condition('C4', coverage, ok, 105).
5
5
  condition('C5', re_decision, ok, 53).
6
- obligation(collected, theory_scoped, 24).
6
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(1, 1), Next), \+ member(Next, [p(1, 1)]), degree(Next, [p(1, 1)], Degree)), [5 - p(2, 3), 5 - p(3, 2)])).
7
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(2, 3), Next), \+ member(Next, [p(2, 3), p(1, 1)]), degree(Next, [p(2, 3), p(1, 1)], Degree)), [3 - p(3, 5), 3 - p(4, 4), 1 - p(1, 5), 3 - p(3, 1), 3 - p(4, 2)])).
8
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(1, 5), Next), \+ member(Next, [p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(1, 5), p(2, 3), p(1, 1)], Degree)), [5 - p(3, 4)])).
9
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(3, 4), Next), \+ member(Next, [p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [1 - p(5, 5), 2 - p(4, 2), 3 - p(5, 3), 3 - p(2, 2), 3 - p(1, 3)])).
10
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(5, 5), Next), \+ member(Next, [p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [5 - p(4, 3)])).
11
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(4, 3), Next), \+ member(Next, [p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(3, 5), 3 - p(2, 4), 1 - p(5, 1), 2 - p(3, 1), 2 - p(2, 2)])).
12
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(5, 1), Next), \+ member(Next, [p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [4 - p(3, 2)])).
13
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(3, 2), Next), \+ member(Next, [p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(4, 4), 2 - p(5, 3), 2 - p(2, 4), 2 - p(1, 3)])).
14
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(4, 4), Next), \+ member(Next, [p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(2, 5), 2 - p(5, 2)])).
15
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(2, 5), Next), \+ member(Next, [p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [7 - p(3, 3), 1 - p(1, 3)])).
16
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(1, 3), Next), \+ member(Next, [p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(2, 1)])).
17
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(2, 1), Next), \+ member(Next, [p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [6 - p(3, 3), 1 - p(4, 2)])).
18
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(4, 2), Next), \+ member(Next, [p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(5, 4)])).
19
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(5, 4), Next), \+ member(Next, [p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [1 - p(3, 5), 5 - p(3, 3)])).
20
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(3, 5), Next), \+ member(Next, [p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(1, 4)])).
21
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(1, 4), Next), \+ member(Next, [p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [1 - p(2, 2), 4 - p(3, 3)])).
22
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(2, 2), Next), \+ member(Next, [p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(4, 1)])).
23
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(4, 1), Next), \+ member(Next, [p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [1 - p(5, 3), 3 - p(3, 3)])).
24
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(5, 3), Next), \+ member(Next, [p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(4, 5)])).
25
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(4, 5), Next), \+ member(Next, [p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(3, 3), 1 - p(2, 4)])).
26
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(2, 4), Next), \+ member(Next, [p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [2 - p(1, 2)])).
27
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(1, 2), Next), \+ member(Next, [p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [1 - p(3, 3), 1 - p(3, 1)])).
28
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(3, 3), Next), \+ member(Next, [p(3, 3), p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(3, 3), p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [1 - p(5, 2)])).
29
+ obligation(collected, theory_scoped, findall(Degree - Next, (knight_move(p(5, 2), Next), \+ member(Next, [p(5, 2), p(3, 3), p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(Next, [p(5, 2), p(3, 3), p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], Degree)), [0 - p(3, 1)])).
7
30
  steps(105).
8
31
  verified(28).
9
32
  recomputed(53).