
Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [f154/5]
1. non_recursive  : [exit_location/1]
2. recursive  : [f160/5]
3. recursive  : [f166/5]
4. recursive  : [f172/5]
5. recursive  : [f180/5]
6. recursive  : [f186/5]
7. recursive  : [f192/5]
8. recursive  : [f198/5]
9. recursive  : [f206/5]
10. recursive  : [f212/5]
11. recursive  : [f218/5]
12. recursive  : [f224/5]
13. recursive  : [f232/5]
14. recursive  : [f238/5]
15. recursive  : [f244/5]
16. recursive  : [f250/5]
17. recursive  : [f258/5]
18. recursive  : [f264/5]
19. recursive  : [f270/5]
20. recursive  : [f276/5]
21. recursive  : [f284/5]
22. recursive  : [f290/5]
23. recursive  : [f296/5]
24. recursive  : [f302/5]
25. recursive  : [f310/6]
26. recursive  : [f316/6]
27. recursive  : [f322/6]
28. recursive  : [f328/6]
29. recursive  : [f336/6]
30. recursive  : [f342/6]
31. recursive  : [f348/6]
32. recursive  : [f354/6]
33. recursive  : [f362/6]
34. recursive  : [f368/6]
35. recursive  : [f374/6]
36. recursive  : [f380/6]
37. recursive  : [f388/6]
38. recursive  : [f394/6]
39. recursive  : [f400/6]
40. recursive  : [f406/6]
41. recursive  : [f414/6]
42. recursive  : [f420/6]
43. recursive  : [f426/6]
44. recursive  : [f432/6]
45. recursive  : [f440/6]
46. recursive  : [f446/6]
47. recursive  : [f452/6]
48. recursive  : [f458/6]
49. recursive  : [f466/5]
50. recursive  : [f472/5]
51. recursive  : [f478/5]
52. recursive  : [f484/5]
53. recursive  : [f492/5]
54. recursive  : [f498/5]
55. recursive  : [f504/5]
56. recursive  : [f510/5]
57. recursive  : [f518/5]
58. recursive  : [f524/5]
59. recursive  : [f530/5]
60. recursive  : [f536/5]
61. recursive  : [f544/5]
62. recursive  : [f550/5]
63. recursive  : [f556/5]
64. recursive  : [f562/5]
65. recursive  : [f570/5]
66. recursive  : [f576/5]
67. recursive  : [f582/5]
68. recursive  : [f588/5]
69. recursive  : [f596/5]
70. recursive  : [f602/5]
71. recursive  : [f608/5]
72. recursive  : [f614/5]
73. recursive  : [f622/5]
74. recursive  : [f628/5]
75. recursive  : [f634/5]
76. recursive  : [f640/5]
77. recursive  : [f648/5]
78. recursive  : [f654/5]
79. recursive  : [f660/5]
80. recursive  : [f666/5]
81. recursive  : [f674/5]
82. recursive  : [f680/5]
83. recursive  : [f686/5]
84. recursive  : [f692/5]
85. recursive  : [f700/6]
86. recursive  : [f706/6]
87. recursive  : [f712/6]
88. recursive  : [f718/6]
89. recursive  : [f726/6]
90. recursive  : [f732/6]
91. recursive  : [f738/6]
92. recursive  : [f744/6]
93. recursive  : [f752/6]
94. recursive  : [f758/6]
95. recursive  : [f764/6]
96. recursive  : [f770/6]
97. recursive  : [f778/6]
98. recursive  : [f784/6]
99. recursive  : [f790/6]
100. recursive  : [f796/6]
101. recursive  : [f804/6]
102. recursive  : [f810/6]
103. recursive  : [f816/6]
104. recursive  : [f822/6]
105. recursive  : [f830/6]
106. recursive  : [f836/6]
107. recursive  : [f842/6]
108. recursive  : [f848/6]
109. recursive  : [f856/6]
110. recursive  : [f862/6]
111. recursive  : [f868/6]
112. recursive  : [f874/6]
113. recursive  : [f882/6]
114. recursive  : [f888/6]
115. recursive  : [f894/6]
116. recursive  : [f900/6]
117. recursive  : [f908/6]
118. recursive  : [f914/6]
119. recursive  : [f920/6]
120. recursive  : [f926/6]
121. non_recursive  : [f934/4]
122. non_recursive  : [f926_loop_cont/5]
123. non_recursive  : [f920_loop_cont/5]
124. non_recursive  : [f914_loop_cont/5]
125. non_recursive  : [f908_loop_cont/5]
126. non_recursive  : [f900_loop_cont/5]
127. non_recursive  : [f894_loop_cont/5]
128. non_recursive  : [f888_loop_cont/5]
129. non_recursive  : [f882_loop_cont/5]
130. non_recursive  : [f874_loop_cont/5]
131. non_recursive  : [f868_loop_cont/5]
132. non_recursive  : [f862_loop_cont/5]
133. non_recursive  : [f856_loop_cont/5]
134. non_recursive  : [f848_loop_cont/5]
135. non_recursive  : [f842_loop_cont/5]
136. non_recursive  : [f836_loop_cont/5]
137. non_recursive  : [f830_loop_cont/5]
138. non_recursive  : [f822_loop_cont/5]
139. non_recursive  : [f816_loop_cont/5]
140. non_recursive  : [f810_loop_cont/5]
141. non_recursive  : [f804_loop_cont/5]
142. non_recursive  : [f796_loop_cont/5]
143. non_recursive  : [f790_loop_cont/5]
144. non_recursive  : [f784_loop_cont/5]
145. non_recursive  : [f778_loop_cont/5]
146. non_recursive  : [f770_loop_cont/5]
147. non_recursive  : [f764_loop_cont/5]
148. non_recursive  : [f758_loop_cont/5]
149. non_recursive  : [f752_loop_cont/5]
150. non_recursive  : [f744_loop_cont/5]
151. non_recursive  : [f738_loop_cont/5]
152. non_recursive  : [f732_loop_cont/5]
153. non_recursive  : [f726_loop_cont/5]
154. non_recursive  : [f718_loop_cont/5]
155. non_recursive  : [f712_loop_cont/5]
156. non_recursive  : [f706_loop_cont/5]
157. non_recursive  : [f700_loop_cont/5]
158. non_recursive  : [f692_loop_cont/5]
159. non_recursive  : [f686_loop_cont/5]
160. non_recursive  : [f680_loop_cont/5]
161. non_recursive  : [f674_loop_cont/5]
162. non_recursive  : [f666_loop_cont/5]
163. non_recursive  : [f660_loop_cont/5]
164. non_recursive  : [f654_loop_cont/5]
165. non_recursive  : [f648_loop_cont/5]
166. non_recursive  : [f640_loop_cont/5]
167. non_recursive  : [f634_loop_cont/5]
168. non_recursive  : [f628_loop_cont/5]
169. non_recursive  : [f622_loop_cont/5]
170. non_recursive  : [f614_loop_cont/5]
171. non_recursive  : [f608_loop_cont/5]
172. non_recursive  : [f602_loop_cont/5]
173. non_recursive  : [f596_loop_cont/5]
174. non_recursive  : [f588_loop_cont/5]
175. non_recursive  : [f582_loop_cont/5]
176. non_recursive  : [f576_loop_cont/5]
177. non_recursive  : [f570_loop_cont/5]
178. non_recursive  : [f562_loop_cont/5]
179. non_recursive  : [f556_loop_cont/5]
180. non_recursive  : [f550_loop_cont/5]
181. non_recursive  : [f544_loop_cont/5]
182. non_recursive  : [f536_loop_cont/5]
183. non_recursive  : [f530_loop_cont/5]
184. non_recursive  : [f524_loop_cont/5]
185. non_recursive  : [f518_loop_cont/5]
186. non_recursive  : [f510_loop_cont/5]
187. non_recursive  : [f504_loop_cont/5]
188. non_recursive  : [f498_loop_cont/5]
189. non_recursive  : [f492_loop_cont/5]
190. non_recursive  : [f484_loop_cont/5]
191. non_recursive  : [f478_loop_cont/5]
192. non_recursive  : [f472_loop_cont/5]
193. non_recursive  : [f466_loop_cont/5]
194. non_recursive  : [f458_loop_cont/5]
195. non_recursive  : [f452_loop_cont/5]
196. non_recursive  : [f446_loop_cont/5]
197. non_recursive  : [f440_loop_cont/5]
198. non_recursive  : [f432_loop_cont/5]
199. non_recursive  : [f426_loop_cont/5]
200. non_recursive  : [f420_loop_cont/5]
201. non_recursive  : [f414_loop_cont/5]
202. non_recursive  : [f406_loop_cont/5]
203. non_recursive  : [f400_loop_cont/5]
204. non_recursive  : [f394_loop_cont/5]
205. non_recursive  : [f388_loop_cont/5]
206. non_recursive  : [f380_loop_cont/5]
207. non_recursive  : [f374_loop_cont/5]
208. non_recursive  : [f368_loop_cont/5]
209. non_recursive  : [f362_loop_cont/5]
210. non_recursive  : [f354_loop_cont/5]
211. non_recursive  : [f348_loop_cont/5]
212. non_recursive  : [f342_loop_cont/5]
213. non_recursive  : [f336_loop_cont/5]
214. non_recursive  : [f328_loop_cont/5]
215. non_recursive  : [f322_loop_cont/5]
216. non_recursive  : [f316_loop_cont/5]
217. non_recursive  : [f310_loop_cont/5]
218. non_recursive  : [f302_loop_cont/5]
219. non_recursive  : [f296_loop_cont/5]
220. non_recursive  : [f290_loop_cont/5]
221. non_recursive  : [f284_loop_cont/5]
222. non_recursive  : [f276_loop_cont/5]
223. non_recursive  : [f270_loop_cont/5]
224. non_recursive  : [f264_loop_cont/5]
225. non_recursive  : [f258_loop_cont/5]
226. non_recursive  : [f250_loop_cont/5]
227. non_recursive  : [f244_loop_cont/5]
228. non_recursive  : [f238_loop_cont/5]
229. non_recursive  : [f232_loop_cont/5]
230. non_recursive  : [f224_loop_cont/5]
231. non_recursive  : [f218_loop_cont/5]
232. non_recursive  : [f212_loop_cont/5]
233. non_recursive  : [f206_loop_cont/5]
234. non_recursive  : [f198_loop_cont/5]
235. non_recursive  : [f192_loop_cont/5]
236. non_recursive  : [f186_loop_cont/5]
237. non_recursive  : [f180_loop_cont/5]
238. non_recursive  : [f172_loop_cont/5]
239. non_recursive  : [f166_loop_cont/5]
240. non_recursive  : [f160_loop_cont/5]
241. non_recursive  : [f154_loop_cont/5]
242. non_recursive  : [f0/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f154/5
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f160/5
3. SCC is partially evaluated into f166/5
4. SCC is partially evaluated into f172/5
5. SCC is partially evaluated into f180/5
6. SCC is partially evaluated into f186/5
7. SCC is partially evaluated into f192/5
8. SCC is partially evaluated into f198/5
9. SCC is partially evaluated into f206/5
10. SCC is partially evaluated into f212/5
11. SCC is partially evaluated into f218/5
12. SCC is partially evaluated into f224/5
13. SCC is partially evaluated into f232/5
14. SCC is partially evaluated into f238/5
15. SCC is partially evaluated into f244/5
16. SCC is partially evaluated into f250/5
17. SCC is partially evaluated into f258/5
18. SCC is partially evaluated into f264/5
19. SCC is partially evaluated into f270/5
20. SCC is partially evaluated into f276/5
21. SCC is partially evaluated into f284/5
22. SCC is partially evaluated into f290/5
23. SCC is partially evaluated into f296/5
24. SCC is partially evaluated into f302/5
25. SCC is partially evaluated into f310/6
26. SCC is partially evaluated into f316/6
27. SCC is partially evaluated into f322/6
28. SCC is partially evaluated into f328/6
29. SCC is partially evaluated into f336/6
30. SCC is partially evaluated into f342/6
31. SCC is partially evaluated into f348/6
32. SCC is partially evaluated into f354/6
33. SCC is partially evaluated into f362/6
34. SCC is partially evaluated into f368/6
35. SCC is partially evaluated into f374/6
36. SCC is partially evaluated into f380/6
37. SCC is partially evaluated into f388/6
38. SCC is partially evaluated into f394/6
39. SCC is partially evaluated into f400/6
40. SCC is partially evaluated into f406/6
41. SCC is partially evaluated into f414/6
42. SCC is partially evaluated into f420/6
43. SCC is partially evaluated into f426/6
44. SCC is partially evaluated into f432/6
45. SCC is partially evaluated into f440/6
46. SCC is partially evaluated into f446/6
47. SCC is partially evaluated into f452/6
48. SCC is partially evaluated into f458/6
49. SCC is partially evaluated into f466/5
50. SCC is partially evaluated into f472/5
51. SCC is partially evaluated into f478/5
52. SCC is partially evaluated into f484/5
53. SCC is partially evaluated into f492/5
54. SCC is partially evaluated into f498/5
55. SCC is partially evaluated into f504/5
56. SCC is partially evaluated into f510/5
57. SCC is partially evaluated into f518/5
58. SCC is partially evaluated into f524/5
59. SCC is partially evaluated into f530/5
60. SCC is partially evaluated into f536/5
61. SCC is partially evaluated into f544/5
62. SCC is partially evaluated into f550/5
63. SCC is partially evaluated into f556/5
64. SCC is partially evaluated into f562/5
65. SCC is partially evaluated into f570/5
66. SCC is partially evaluated into f576/5
67. SCC is partially evaluated into f582/5
68. SCC is partially evaluated into f588/5
69. SCC is partially evaluated into f596/5
70. SCC is partially evaluated into f602/5
71. SCC is partially evaluated into f608/5
72. SCC is partially evaluated into f614/5
73. SCC is partially evaluated into f622/5
74. SCC is partially evaluated into f628/5
75. SCC is partially evaluated into f634/5
76. SCC is partially evaluated into f640/5
77. SCC is partially evaluated into f648/5
78. SCC is partially evaluated into f654/5
79. SCC is partially evaluated into f660/5
80. SCC is partially evaluated into f666/5
81. SCC is partially evaluated into f674/5
82. SCC is partially evaluated into f680/5
83. SCC is partially evaluated into f686/5
84. SCC is partially evaluated into f692/5
85. SCC is partially evaluated into f700/6
86. SCC is partially evaluated into f706/6
87. SCC is partially evaluated into f712/6
88. SCC is partially evaluated into f718/6
89. SCC is partially evaluated into f726/6
90. SCC is partially evaluated into f732/6
91. SCC is partially evaluated into f738/6
92. SCC is partially evaluated into f744/6
93. SCC is partially evaluated into f752/6
94. SCC is partially evaluated into f758/6
95. SCC is partially evaluated into f764/6
96. SCC is partially evaluated into f770/6
97. SCC is partially evaluated into f778/6
98. SCC is partially evaluated into f784/6
99. SCC is partially evaluated into f790/6
100. SCC is partially evaluated into f796/6
101. SCC is partially evaluated into f804/6
102. SCC is partially evaluated into f810/6
103. SCC is partially evaluated into f816/6
104. SCC is partially evaluated into f822/6
105. SCC is partially evaluated into f830/6
106. SCC is partially evaluated into f836/6
107. SCC is partially evaluated into f842/6
108. SCC is partially evaluated into f848/6
109. SCC is partially evaluated into f856/6
110. SCC is partially evaluated into f862/6
111. SCC is partially evaluated into f868/6
112. SCC is partially evaluated into f874/6
113. SCC is partially evaluated into f882/6
114. SCC is partially evaluated into f888/6
115. SCC is partially evaluated into f894/6
116. SCC is partially evaluated into f900/6
117. SCC is partially evaluated into f908/6
118. SCC is partially evaluated into f914/6
119. SCC is partially evaluated into f920/6
120. SCC is partially evaluated into f926/6
121. SCC is completely evaluated into other SCCs
122. SCC is partially evaluated into f926_loop_cont/5
123. SCC is partially evaluated into f920_loop_cont/5
124. SCC is partially evaluated into f914_loop_cont/5
125. SCC is partially evaluated into f908_loop_cont/5
126. SCC is partially evaluated into f900_loop_cont/5
127. SCC is partially evaluated into f894_loop_cont/5
128. SCC is partially evaluated into f888_loop_cont/5
129. SCC is partially evaluated into f882_loop_cont/5
130. SCC is partially evaluated into f874_loop_cont/5
131. SCC is partially evaluated into f868_loop_cont/5
132. SCC is partially evaluated into f862_loop_cont/5
133. SCC is partially evaluated into f856_loop_cont/5
134. SCC is partially evaluated into f848_loop_cont/5
135. SCC is partially evaluated into f842_loop_cont/5
136. SCC is partially evaluated into f836_loop_cont/5
137. SCC is partially evaluated into f830_loop_cont/5
138. SCC is partially evaluated into f822_loop_cont/5
139. SCC is partially evaluated into f816_loop_cont/5
140. SCC is partially evaluated into f810_loop_cont/5
141. SCC is partially evaluated into f804_loop_cont/5
142. SCC is partially evaluated into f796_loop_cont/5
143. SCC is partially evaluated into f790_loop_cont/5
144. SCC is partially evaluated into f784_loop_cont/5
145. SCC is partially evaluated into f778_loop_cont/5
146. SCC is partially evaluated into f770_loop_cont/5
147. SCC is partially evaluated into f764_loop_cont/5
148. SCC is partially evaluated into f758_loop_cont/5
149. SCC is partially evaluated into f752_loop_cont/5
150. SCC is partially evaluated into f744_loop_cont/5
151. SCC is partially evaluated into f738_loop_cont/5
152. SCC is partially evaluated into f732_loop_cont/5
153. SCC is partially evaluated into f726_loop_cont/5
154. SCC is partially evaluated into f718_loop_cont/5
155. SCC is partially evaluated into f712_loop_cont/5
156. SCC is partially evaluated into f706_loop_cont/5
157. SCC is partially evaluated into f700_loop_cont/5
158. SCC is partially evaluated into f692_loop_cont/5
159. SCC is partially evaluated into f686_loop_cont/5
160. SCC is partially evaluated into f680_loop_cont/5
161. SCC is partially evaluated into f674_loop_cont/5
162. SCC is partially evaluated into f666_loop_cont/5
163. SCC is partially evaluated into f660_loop_cont/5
164. SCC is partially evaluated into f654_loop_cont/5
165. SCC is partially evaluated into f648_loop_cont/5
166. SCC is partially evaluated into f640_loop_cont/5
167. SCC is partially evaluated into f634_loop_cont/5
168. SCC is partially evaluated into f628_loop_cont/5
169. SCC is partially evaluated into f622_loop_cont/5
170. SCC is partially evaluated into f614_loop_cont/5
171. SCC is partially evaluated into f608_loop_cont/5
172. SCC is partially evaluated into f602_loop_cont/5
173. SCC is partially evaluated into f596_loop_cont/5
174. SCC is partially evaluated into f588_loop_cont/5
175. SCC is partially evaluated into f582_loop_cont/5
176. SCC is partially evaluated into f576_loop_cont/5
177. SCC is partially evaluated into f570_loop_cont/5
178. SCC is partially evaluated into f562_loop_cont/5
179. SCC is partially evaluated into f556_loop_cont/5
180. SCC is partially evaluated into f550_loop_cont/5
181. SCC is partially evaluated into f544_loop_cont/5
182. SCC is partially evaluated into f536_loop_cont/5
183. SCC is partially evaluated into f530_loop_cont/5
184. SCC is partially evaluated into f524_loop_cont/5
185. SCC is partially evaluated into f518_loop_cont/5
186. SCC is partially evaluated into f510_loop_cont/5
187. SCC is partially evaluated into f504_loop_cont/5
188. SCC is partially evaluated into f498_loop_cont/5
189. SCC is partially evaluated into f492_loop_cont/5
190. SCC is partially evaluated into f484_loop_cont/5
191. SCC is partially evaluated into f478_loop_cont/5
192. SCC is partially evaluated into f472_loop_cont/5
193. SCC is partially evaluated into f466_loop_cont/5
194. SCC is partially evaluated into f458_loop_cont/5
195. SCC is partially evaluated into f452_loop_cont/5
196. SCC is partially evaluated into f446_loop_cont/5
197. SCC is partially evaluated into f440_loop_cont/5
198. SCC is partially evaluated into f432_loop_cont/5
199. SCC is partially evaluated into f426_loop_cont/5
200. SCC is partially evaluated into f420_loop_cont/5
201. SCC is partially evaluated into f414_loop_cont/5
202. SCC is partially evaluated into f406_loop_cont/5
203. SCC is partially evaluated into f400_loop_cont/5
204. SCC is partially evaluated into f394_loop_cont/5
205. SCC is partially evaluated into f388_loop_cont/5
206. SCC is partially evaluated into f380_loop_cont/5
207. SCC is partially evaluated into f374_loop_cont/5
208. SCC is partially evaluated into f368_loop_cont/5
209. SCC is partially evaluated into f362_loop_cont/5
210. SCC is partially evaluated into f354_loop_cont/5
211. SCC is partially evaluated into f348_loop_cont/5
212. SCC is partially evaluated into f342_loop_cont/5
213. SCC is partially evaluated into f336_loop_cont/5
214. SCC is partially evaluated into f328_loop_cont/5
215. SCC is partially evaluated into f322_loop_cont/5
216. SCC is partially evaluated into f316_loop_cont/5
217. SCC is partially evaluated into f310_loop_cont/5
218. SCC is partially evaluated into f302_loop_cont/5
219. SCC is partially evaluated into f296_loop_cont/5
220. SCC is partially evaluated into f290_loop_cont/5
221. SCC is partially evaluated into f284_loop_cont/5
222. SCC is partially evaluated into f276_loop_cont/5
223. SCC is partially evaluated into f270_loop_cont/5
224. SCC is partially evaluated into f264_loop_cont/5
225. SCC is partially evaluated into f258_loop_cont/5
226. SCC is partially evaluated into f250_loop_cont/5
227. SCC is partially evaluated into f244_loop_cont/5
228. SCC is partially evaluated into f238_loop_cont/5
229. SCC is partially evaluated into f232_loop_cont/5
230. SCC is partially evaluated into f224_loop_cont/5
231. SCC is partially evaluated into f218_loop_cont/5
232. SCC is partially evaluated into f212_loop_cont/5
233. SCC is partially evaluated into f206_loop_cont/5
234. SCC is partially evaluated into f198_loop_cont/5
235. SCC is partially evaluated into f192_loop_cont/5
236. SCC is partially evaluated into f186_loop_cont/5
237. SCC is partially evaluated into f180_loop_cont/5
238. SCC is partially evaluated into f172_loop_cont/5
239. SCC is partially evaluated into f166_loop_cont/5
240. SCC is partially evaluated into f160_loop_cont/5
241. SCC is partially evaluated into f154_loop_cont/5
242. SCC is partially evaluated into f0/4

Control-Flow Refinement of Cost Relations
=====================================

### Specialization of cost equations f154/5 
* CE 3 is refined into CE [602] 
* CE 4 is refined into CE [603] 
* CE 2 is refined into CE [604] 


### Cost equations --> "Loop" of f154/5 
* CEs [604] --> Loop 602 
* CEs [602] --> Loop 603 
* CEs [603] --> Loop 604 

### Ranking functions of CR f154(A,C,D,E,F) 
* RF of phase [602]: [-C+3]

#### Partial ranking functions of CR f154(A,C,D,E,F) 
* Partial RF of phase [602]:
  - RF of loop [602:1]:
    -C+3


### Specialization of cost equations f160/5 
* CE 8 is refined into CE [605] 
* CE 9 is refined into CE [606] 
* CE 7 is refined into CE [607] 


### Cost equations --> "Loop" of f160/5 
* CEs [607] --> Loop 605 
* CEs [605] --> Loop 606 
* CEs [606] --> Loop 607 

### Ranking functions of CR f160(A,C,D,E,F) 
* RF of phase [605]: [-C+4]

#### Partial ranking functions of CR f160(A,C,D,E,F) 
* Partial RF of phase [605]:
  - RF of loop [605:1]:
    -C+4


### Specialization of cost equations f166/5 
* CE 13 is refined into CE [608] 
* CE 14 is refined into CE [609] 
* CE 12 is refined into CE [610] 


### Cost equations --> "Loop" of f166/5 
* CEs [610] --> Loop 608 
* CEs [608] --> Loop 609 
* CEs [609] --> Loop 610 

### Ranking functions of CR f166(A,C,D,E,F) 
* RF of phase [608]: [-C+3]

#### Partial ranking functions of CR f166(A,C,D,E,F) 
* Partial RF of phase [608]:
  - RF of loop [608:1]:
    -C+3


### Specialization of cost equations f172/5 
* CE 18 is refined into CE [611] 
* CE 19 is refined into CE [612] 
* CE 17 is refined into CE [613] 


### Cost equations --> "Loop" of f172/5 
* CEs [613] --> Loop 611 
* CEs [611] --> Loop 612 
* CEs [612] --> Loop 613 

### Ranking functions of CR f172(A,C,D,E,F) 
* RF of phase [611]: [-C+4]

#### Partial ranking functions of CR f172(A,C,D,E,F) 
* Partial RF of phase [611]:
  - RF of loop [611:1]:
    -C+4


### Specialization of cost equations f180/5 
* CE 23 is refined into CE [614] 
* CE 24 is refined into CE [615] 
* CE 22 is refined into CE [616] 


### Cost equations --> "Loop" of f180/5 
* CEs [616] --> Loop 614 
* CEs [614] --> Loop 615 
* CEs [615] --> Loop 616 

### Ranking functions of CR f180(A,C,D,E,F) 
* RF of phase [614]: [-C+2]

#### Partial ranking functions of CR f180(A,C,D,E,F) 
* Partial RF of phase [614]:
  - RF of loop [614:1]:
    -C+2


### Specialization of cost equations f186/5 
* CE 28 is refined into CE [617] 
* CE 29 is refined into CE [618] 
* CE 27 is refined into CE [619] 


### Cost equations --> "Loop" of f186/5 
* CEs [619] --> Loop 617 
* CEs [617] --> Loop 618 
* CEs [618] --> Loop 619 

### Ranking functions of CR f186(A,C,D,E,F) 
* RF of phase [617]: [-C+3]

#### Partial ranking functions of CR f186(A,C,D,E,F) 
* Partial RF of phase [617]:
  - RF of loop [617:1]:
    -C+3


### Specialization of cost equations f192/5 
* CE 33 is refined into CE [620] 
* CE 34 is refined into CE [621] 
* CE 32 is refined into CE [622] 


### Cost equations --> "Loop" of f192/5 
* CEs [622] --> Loop 620 
* CEs [620] --> Loop 621 
* CEs [621] --> Loop 622 

### Ranking functions of CR f192(A,C,D,E,F) 
* RF of phase [620]: [-C+2]

#### Partial ranking functions of CR f192(A,C,D,E,F) 
* Partial RF of phase [620]:
  - RF of loop [620:1]:
    -C+2


### Specialization of cost equations f198/5 
* CE 38 is refined into CE [623] 
* CE 39 is refined into CE [624] 
* CE 37 is refined into CE [625] 


### Cost equations --> "Loop" of f198/5 
* CEs [625] --> Loop 623 
* CEs [623] --> Loop 624 
* CEs [624] --> Loop 625 

### Ranking functions of CR f198(A,C,D,E,F) 
* RF of phase [623]: [-C+3]

#### Partial ranking functions of CR f198(A,C,D,E,F) 
* Partial RF of phase [623]:
  - RF of loop [623:1]:
    -C+3


### Specialization of cost equations f206/5 
* CE 43 is refined into CE [626] 
* CE 44 is refined into CE [627] 
* CE 42 is refined into CE [628] 


### Cost equations --> "Loop" of f206/5 
* CEs [628] --> Loop 626 
* CEs [626] --> Loop 627 
* CEs [627] --> Loop 628 

### Ranking functions of CR f206(A,C,D,E,F) 
* RF of phase [626]: [-C-2]

#### Partial ranking functions of CR f206(A,C,D,E,F) 
* Partial RF of phase [626]:
  - RF of loop [626:1]:
    -C-2


### Specialization of cost equations f212/5 
* CE 48 is refined into CE [629] 
* CE 49 is refined into CE [630] 
* CE 47 is refined into CE [631] 


### Cost equations --> "Loop" of f212/5 
* CEs [631] --> Loop 629 
* CEs [629] --> Loop 630 
* CEs [630] --> Loop 631 

### Ranking functions of CR f212(A,C,D,E,F) 
* RF of phase [629]: [-C-1]

#### Partial ranking functions of CR f212(A,C,D,E,F) 
* Partial RF of phase [629]:
  - RF of loop [629:1]:
    -C-1


### Specialization of cost equations f218/5 
* CE 53 is refined into CE [632] 
* CE 54 is refined into CE [633] 
* CE 52 is refined into CE [634] 


### Cost equations --> "Loop" of f218/5 
* CEs [634] --> Loop 632 
* CEs [632] --> Loop 633 
* CEs [633] --> Loop 634 

### Ranking functions of CR f218(A,C,D,E,F) 
* RF of phase [632]: [-C-2]

#### Partial ranking functions of CR f218(A,C,D,E,F) 
* Partial RF of phase [632]:
  - RF of loop [632:1]:
    -C-2


### Specialization of cost equations f224/5 
* CE 58 is refined into CE [635] 
* CE 59 is refined into CE [636] 
* CE 57 is refined into CE [637] 


### Cost equations --> "Loop" of f224/5 
* CEs [637] --> Loop 635 
* CEs [635] --> Loop 636 
* CEs [636] --> Loop 637 

### Ranking functions of CR f224(A,C,D,E,F) 
* RF of phase [635]: [-C-1]

#### Partial ranking functions of CR f224(A,C,D,E,F) 
* Partial RF of phase [635]:
  - RF of loop [635:1]:
    -C-1


### Specialization of cost equations f232/5 
* CE 63 is refined into CE [638] 
* CE 64 is refined into CE [639] 
* CE 62 is refined into CE [640] 


### Cost equations --> "Loop" of f232/5 
* CEs [640] --> Loop 638 
* CEs [638] --> Loop 639 
* CEs [639] --> Loop 640 

### Ranking functions of CR f232(A,C,D,E,F) 
* RF of phase [638]: [-C-1]

#### Partial ranking functions of CR f232(A,C,D,E,F) 
* Partial RF of phase [638]:
  - RF of loop [638:1]:
    -C-1


### Specialization of cost equations f238/5 
* CE 68 is refined into CE [641] 
* CE 69 is refined into CE [642] 
* CE 67 is refined into CE [643] 


### Cost equations --> "Loop" of f238/5 
* CEs [643] --> Loop 641 
* CEs [641] --> Loop 642 
* CEs [642] --> Loop 643 

### Ranking functions of CR f238(A,C,D,E,F) 
* RF of phase [641]: [-C]

#### Partial ranking functions of CR f238(A,C,D,E,F) 
* Partial RF of phase [641]:
  - RF of loop [641:1]:
    -C


### Specialization of cost equations f244/5 
* CE 73 is refined into CE [644] 
* CE 74 is refined into CE [645] 
* CE 72 is refined into CE [646] 


### Cost equations --> "Loop" of f244/5 
* CEs [646] --> Loop 644 
* CEs [644] --> Loop 645 
* CEs [645] --> Loop 646 

### Ranking functions of CR f244(A,C,D,E,F) 
* RF of phase [644]: [-C-1]

#### Partial ranking functions of CR f244(A,C,D,E,F) 
* Partial RF of phase [644]:
  - RF of loop [644:1]:
    -C-1


### Specialization of cost equations f250/5 
* CE 78 is refined into CE [647] 
* CE 79 is refined into CE [648] 
* CE 77 is refined into CE [649] 


### Cost equations --> "Loop" of f250/5 
* CEs [649] --> Loop 647 
* CEs [647] --> Loop 648 
* CEs [648] --> Loop 649 

### Ranking functions of CR f250(A,C,D,E,F) 
* RF of phase [647]: [-C]

#### Partial ranking functions of CR f250(A,C,D,E,F) 
* Partial RF of phase [647]:
  - RF of loop [647:1]:
    -C


### Specialization of cost equations f258/5 
* CE 83 is refined into CE [650] 
* CE 84 is refined into CE [651] 
* CE 82 is refined into CE [652] 


### Cost equations --> "Loop" of f258/5 
* CEs [652] --> Loop 650 
* CEs [650] --> Loop 651 
* CEs [651] --> Loop 652 

### Ranking functions of CR f258(A,C,D,E,F) 
* RF of phase [650]: [-C]

#### Partial ranking functions of CR f258(A,C,D,E,F) 
* Partial RF of phase [650]:
  - RF of loop [650:1]:
    -C


### Specialization of cost equations f264/5 
* CE 88 is refined into CE [653] 
* CE 89 is refined into CE [654] 
* CE 87 is refined into CE [655] 


### Cost equations --> "Loop" of f264/5 
* CEs [655] --> Loop 653 
* CEs [653] --> Loop 654 
* CEs [654] --> Loop 655 

### Ranking functions of CR f264(A,C,D,E,F) 
* RF of phase [653]: [-C+1]

#### Partial ranking functions of CR f264(A,C,D,E,F) 
* Partial RF of phase [653]:
  - RF of loop [653:1]:
    -C+1


### Specialization of cost equations f270/5 
* CE 93 is refined into CE [656] 
* CE 94 is refined into CE [657] 
* CE 92 is refined into CE [658] 


### Cost equations --> "Loop" of f270/5 
* CEs [658] --> Loop 656 
* CEs [656] --> Loop 657 
* CEs [657] --> Loop 658 

### Ranking functions of CR f270(A,C,D,E,F) 
* RF of phase [656]: [-C]

#### Partial ranking functions of CR f270(A,C,D,E,F) 
* Partial RF of phase [656]:
  - RF of loop [656:1]:
    -C


### Specialization of cost equations f276/5 
* CE 98 is refined into CE [659] 
* CE 99 is refined into CE [660] 
* CE 97 is refined into CE [661] 


### Cost equations --> "Loop" of f276/5 
* CEs [661] --> Loop 659 
* CEs [659] --> Loop 660 
* CEs [660] --> Loop 661 

### Ranking functions of CR f276(A,C,D,E,F) 
* RF of phase [659]: [-C+1]

#### Partial ranking functions of CR f276(A,C,D,E,F) 
* Partial RF of phase [659]:
  - RF of loop [659:1]:
    -C+1


### Specialization of cost equations f284/5 
* CE 103 is refined into CE [662] 
* CE 104 is refined into CE [663] 
* CE 102 is refined into CE [664] 


### Cost equations --> "Loop" of f284/5 
* CEs [664] --> Loop 662 
* CEs [662] --> Loop 663 
* CEs [663] --> Loop 664 

### Ranking functions of CR f284(A,C,D,E,F) 
* RF of phase [662]: [-C+4]

#### Partial ranking functions of CR f284(A,C,D,E,F) 
* Partial RF of phase [662]:
  - RF of loop [662:1]:
    -C+4


### Specialization of cost equations f290/5 
* CE 108 is refined into CE [665] 
* CE 109 is refined into CE [666] 
* CE 107 is refined into CE [667] 


### Cost equations --> "Loop" of f290/5 
* CEs [667] --> Loop 665 
* CEs [665] --> Loop 666 
* CEs [666] --> Loop 667 

### Ranking functions of CR f290(A,C,D,E,F) 
* RF of phase [665]: [-C+5]

#### Partial ranking functions of CR f290(A,C,D,E,F) 
* Partial RF of phase [665]:
  - RF of loop [665:1]:
    -C+5


### Specialization of cost equations f296/5 
* CE 113 is refined into CE [668] 
* CE 114 is refined into CE [669] 
* CE 112 is refined into CE [670] 


### Cost equations --> "Loop" of f296/5 
* CEs [670] --> Loop 668 
* CEs [668] --> Loop 669 
* CEs [669] --> Loop 670 

### Ranking functions of CR f296(A,C,D,E,F) 
* RF of phase [668]: [-C+4]

#### Partial ranking functions of CR f296(A,C,D,E,F) 
* Partial RF of phase [668]:
  - RF of loop [668:1]:
    -C+4


### Specialization of cost equations f302/5 
* CE 118 is refined into CE [671] 
* CE 119 is refined into CE [672] 
* CE 117 is refined into CE [673] 


### Cost equations --> "Loop" of f302/5 
* CEs [673] --> Loop 671 
* CEs [671] --> Loop 672 
* CEs [672] --> Loop 673 

### Ranking functions of CR f302(A,C,D,E,F) 
* RF of phase [671]: [-C+5]

#### Partial ranking functions of CR f302(A,C,D,E,F) 
* Partial RF of phase [671]:
  - RF of loop [671:1]:
    -C+5


### Specialization of cost equations f310/6 
* CE 123 is refined into CE [674] 
* CE 124 is refined into CE [675] 
* CE 122 is refined into CE [676] 


### Cost equations --> "Loop" of f310/6 
* CEs [676] --> Loop 674 
* CEs [674] --> Loop 675 
* CEs [675] --> Loop 676 

### Ranking functions of CR f310(A,B,C,D,E,F) 
* RF of phase [674]: [-C+3]

#### Partial ranking functions of CR f310(A,B,C,D,E,F) 
* Partial RF of phase [674]:
  - RF of loop [674:1]:
    -C+3


### Specialization of cost equations f316/6 
* CE 128 is refined into CE [677] 
* CE 129 is refined into CE [678] 
* CE 127 is refined into CE [679] 


### Cost equations --> "Loop" of f316/6 
* CEs [679] --> Loop 677 
* CEs [677] --> Loop 678 
* CEs [678] --> Loop 679 

### Ranking functions of CR f316(A,B,C,D,E,F) 
* RF of phase [677]: [-C/2+2]

#### Partial ranking functions of CR f316(A,B,C,D,E,F) 
* Partial RF of phase [677]:
  - RF of loop [677:1]:
    -C/2+2


### Specialization of cost equations f322/6 
* CE 133 is refined into CE [680] 
* CE 134 is refined into CE [681] 
* CE 132 is refined into CE [682] 


### Cost equations --> "Loop" of f322/6 
* CEs [682] --> Loop 680 
* CEs [680] --> Loop 681 
* CEs [681] --> Loop 682 

### Ranking functions of CR f322(A,B,C,D,E,F) 
* RF of phase [680]: [-C+3]

#### Partial ranking functions of CR f322(A,B,C,D,E,F) 
* Partial RF of phase [680]:
  - RF of loop [680:1]:
    -C+3


### Specialization of cost equations f328/6 
* CE 138 is refined into CE [683] 
* CE 139 is refined into CE [684] 
* CE 137 is refined into CE [685] 


### Cost equations --> "Loop" of f328/6 
* CEs [685] --> Loop 683 
* CEs [683] --> Loop 684 
* CEs [684] --> Loop 685 

### Ranking functions of CR f328(A,B,C,D,E,F) 
* RF of phase [683]: [-C/2+2]

#### Partial ranking functions of CR f328(A,B,C,D,E,F) 
* Partial RF of phase [683]:
  - RF of loop [683:1]:
    -C/2+2


### Specialization of cost equations f336/6 
* CE 143 is refined into CE [686] 
* CE 144 is refined into CE [687] 
* CE 142 is refined into CE [688] 


### Cost equations --> "Loop" of f336/6 
* CEs [688] --> Loop 686 
* CEs [686] --> Loop 687 
* CEs [687] --> Loop 688 

### Ranking functions of CR f336(A,B,C,D,E,F) 
* RF of phase [686]: [-C/2+1]

#### Partial ranking functions of CR f336(A,B,C,D,E,F) 
* Partial RF of phase [686]:
  - RF of loop [686:1]:
    -C/2+1


### Specialization of cost equations f342/6 
* CE 148 is refined into CE [689] 
* CE 149 is refined into CE [690] 
* CE 147 is refined into CE [691] 


### Cost equations --> "Loop" of f342/6 
* CEs [691] --> Loop 689 
* CEs [689] --> Loop 690 
* CEs [690] --> Loop 691 

### Ranking functions of CR f342(A,B,C,D,E,F) 
* RF of phase [689]: [-C+3]

#### Partial ranking functions of CR f342(A,B,C,D,E,F) 
* Partial RF of phase [689]:
  - RF of loop [689:1]:
    -C+3


### Specialization of cost equations f348/6 
* CE 153 is refined into CE [692] 
* CE 154 is refined into CE [693] 
* CE 152 is refined into CE [694] 


### Cost equations --> "Loop" of f348/6 
* CEs [694] --> Loop 692 
* CEs [692] --> Loop 693 
* CEs [693] --> Loop 694 

### Ranking functions of CR f348(A,B,C,D,E,F) 
* RF of phase [692]: [-C/2+1]

#### Partial ranking functions of CR f348(A,B,C,D,E,F) 
* Partial RF of phase [692]:
  - RF of loop [692:1]:
    -C/2+1


### Specialization of cost equations f354/6 
* CE 158 is refined into CE [695] 
* CE 159 is refined into CE [696] 
* CE 157 is refined into CE [697] 


### Cost equations --> "Loop" of f354/6 
* CEs [697] --> Loop 695 
* CEs [695] --> Loop 696 
* CEs [696] --> Loop 697 

### Ranking functions of CR f354(A,B,C,D,E,F) 
* RF of phase [695]: [-C+3]

#### Partial ranking functions of CR f354(A,B,C,D,E,F) 
* Partial RF of phase [695]:
  - RF of loop [695:1]:
    -C+3


### Specialization of cost equations f362/6 
* CE 163 is refined into CE [698] 
* CE 164 is refined into CE [699] 
* CE 162 is refined into CE [700] 


### Cost equations --> "Loop" of f362/6 
* CEs [700] --> Loop 698 
* CEs [698] --> Loop 699 
* CEs [699] --> Loop 700 

### Ranking functions of CR f362(A,B,C,D,E,F) 
* RF of phase [698]: [-C/2-1]

#### Partial ranking functions of CR f362(A,B,C,D,E,F) 
* Partial RF of phase [698]:
  - RF of loop [698:1]:
    -C/2-1


### Specialization of cost equations f368/6 
* CE 168 is refined into CE [701] 
* CE 169 is refined into CE [702] 
* CE 167 is refined into CE [703] 


### Cost equations --> "Loop" of f368/6 
* CEs [703] --> Loop 701 
* CEs [701] --> Loop 702 
* CEs [702] --> Loop 703 

### Ranking functions of CR f368(A,B,C,D,E,F) 
* RF of phase [701]: [-C-1]

#### Partial ranking functions of CR f368(A,B,C,D,E,F) 
* Partial RF of phase [701]:
  - RF of loop [701:1]:
    -C-1


### Specialization of cost equations f374/6 
* CE 173 is refined into CE [704] 
* CE 174 is refined into CE [705] 
* CE 172 is refined into CE [706] 


### Cost equations --> "Loop" of f374/6 
* CEs [706] --> Loop 704 
* CEs [704] --> Loop 705 
* CEs [705] --> Loop 706 

### Ranking functions of CR f374(A,B,C,D,E,F) 
* RF of phase [704]: [-C/2-1]

#### Partial ranking functions of CR f374(A,B,C,D,E,F) 
* Partial RF of phase [704]:
  - RF of loop [704:1]:
    -C/2-1


### Specialization of cost equations f380/6 
* CE 178 is refined into CE [707] 
* CE 179 is refined into CE [708] 
* CE 177 is refined into CE [709] 


### Cost equations --> "Loop" of f380/6 
* CEs [709] --> Loop 707 
* CEs [707] --> Loop 708 
* CEs [708] --> Loop 709 

### Ranking functions of CR f380(A,B,C,D,E,F) 
* RF of phase [707]: [-C-1]

#### Partial ranking functions of CR f380(A,B,C,D,E,F) 
* Partial RF of phase [707]:
  - RF of loop [707:1]:
    -C-1


### Specialization of cost equations f388/6 
* CE 183 is refined into CE [710] 
* CE 184 is refined into CE [711] 
* CE 182 is refined into CE [712] 


### Cost equations --> "Loop" of f388/6 
* CEs [712] --> Loop 710 
* CEs [710] --> Loop 711 
* CEs [711] --> Loop 712 

### Ranking functions of CR f388(A,B,C,D,E,F) 
* RF of phase [710]: [-C-1]

#### Partial ranking functions of CR f388(A,B,C,D,E,F) 
* Partial RF of phase [710]:
  - RF of loop [710:1]:
    -C-1


### Specialization of cost equations f394/6 
* CE 188 is refined into CE [713] 
* CE 189 is refined into CE [714] 
* CE 187 is refined into CE [715] 


### Cost equations --> "Loop" of f394/6 
* CEs [715] --> Loop 713 
* CEs [713] --> Loop 714 
* CEs [714] --> Loop 715 

### Ranking functions of CR f394(A,B,C,D,E,F) 
* RF of phase [713]: [-C/2]

#### Partial ranking functions of CR f394(A,B,C,D,E,F) 
* Partial RF of phase [713]:
  - RF of loop [713:1]:
    -C/2


### Specialization of cost equations f400/6 
* CE 193 is refined into CE [716] 
* CE 194 is refined into CE [717] 
* CE 192 is refined into CE [718] 


### Cost equations --> "Loop" of f400/6 
* CEs [718] --> Loop 716 
* CEs [716] --> Loop 717 
* CEs [717] --> Loop 718 

### Ranking functions of CR f400(A,B,C,D,E,F) 
* RF of phase [716]: [-C-1]

#### Partial ranking functions of CR f400(A,B,C,D,E,F) 
* Partial RF of phase [716]:
  - RF of loop [716:1]:
    -C-1


### Specialization of cost equations f406/6 
* CE 198 is refined into CE [719] 
* CE 199 is refined into CE [720] 
* CE 197 is refined into CE [721] 


### Cost equations --> "Loop" of f406/6 
* CEs [721] --> Loop 719 
* CEs [719] --> Loop 720 
* CEs [720] --> Loop 721 

### Ranking functions of CR f406(A,B,C,D,E,F) 
* RF of phase [719]: [-C/2]

#### Partial ranking functions of CR f406(A,B,C,D,E,F) 
* Partial RF of phase [719]:
  - RF of loop [719:1]:
    -C/2


### Specialization of cost equations f414/6 
* CE 203 is refined into CE [722] 
* CE 204 is refined into CE [723] 
* CE 202 is refined into CE [724] 


### Cost equations --> "Loop" of f414/6 
* CEs [724] --> Loop 722 
* CEs [722] --> Loop 723 
* CEs [723] --> Loop 724 

### Ranking functions of CR f414(A,B,C,D,E,F) 
* RF of phase [722]: [-C/2]

#### Partial ranking functions of CR f414(A,B,C,D,E,F) 
* Partial RF of phase [722]:
  - RF of loop [722:1]:
    -C/2


### Specialization of cost equations f420/6 
* CE 208 is refined into CE [725] 
* CE 209 is refined into CE [726] 
* CE 207 is refined into CE [727] 


### Cost equations --> "Loop" of f420/6 
* CEs [727] --> Loop 725 
* CEs [725] --> Loop 726 
* CEs [726] --> Loop 727 

### Ranking functions of CR f420(A,B,C,D,E,F) 
* RF of phase [725]: [-C+1]

#### Partial ranking functions of CR f420(A,B,C,D,E,F) 
* Partial RF of phase [725]:
  - RF of loop [725:1]:
    -C+1


### Specialization of cost equations f426/6 
* CE 213 is refined into CE [728] 
* CE 214 is refined into CE [729] 
* CE 212 is refined into CE [730] 


### Cost equations --> "Loop" of f426/6 
* CEs [730] --> Loop 728 
* CEs [728] --> Loop 729 
* CEs [729] --> Loop 730 

### Ranking functions of CR f426(A,B,C,D,E,F) 
* RF of phase [728]: [-C/2]

#### Partial ranking functions of CR f426(A,B,C,D,E,F) 
* Partial RF of phase [728]:
  - RF of loop [728:1]:
    -C/2


### Specialization of cost equations f432/6 
* CE 218 is refined into CE [731] 
* CE 219 is refined into CE [732] 
* CE 217 is refined into CE [733] 


### Cost equations --> "Loop" of f432/6 
* CEs [733] --> Loop 731 
* CEs [731] --> Loop 732 
* CEs [732] --> Loop 733 

### Ranking functions of CR f432(A,B,C,D,E,F) 
* RF of phase [731]: [-C+1]

#### Partial ranking functions of CR f432(A,B,C,D,E,F) 
* Partial RF of phase [731]:
  - RF of loop [731:1]:
    -C+1


### Specialization of cost equations f440/6 
* CE 223 is refined into CE [734] 
* CE 224 is refined into CE [735] 
* CE 222 is refined into CE [736] 


### Cost equations --> "Loop" of f440/6 
* CEs [736] --> Loop 734 
* CEs [734] --> Loop 735 
* CEs [735] --> Loop 736 

### Ranking functions of CR f440(A,B,C,D,E,F) 
* RF of phase [734]: [-C/2+2]

#### Partial ranking functions of CR f440(A,B,C,D,E,F) 
* Partial RF of phase [734]:
  - RF of loop [734:1]:
    -C/2+2


### Specialization of cost equations f446/6 
* CE 228 is refined into CE [737] 
* CE 229 is refined into CE [738] 
* CE 227 is refined into CE [739] 


### Cost equations --> "Loop" of f446/6 
* CEs [739] --> Loop 737 
* CEs [737] --> Loop 738 
* CEs [738] --> Loop 739 

### Ranking functions of CR f446(A,B,C,D,E,F) 
* RF of phase [737]: [-C+5]

#### Partial ranking functions of CR f446(A,B,C,D,E,F) 
* Partial RF of phase [737]:
  - RF of loop [737:1]:
    -C+5


### Specialization of cost equations f452/6 
* CE 233 is refined into CE [740] 
* CE 234 is refined into CE [741] 
* CE 232 is refined into CE [742] 


### Cost equations --> "Loop" of f452/6 
* CEs [742] --> Loop 740 
* CEs [740] --> Loop 741 
* CEs [741] --> Loop 742 

### Ranking functions of CR f452(A,B,C,D,E,F) 
* RF of phase [740]: [-C/2+2]

#### Partial ranking functions of CR f452(A,B,C,D,E,F) 
* Partial RF of phase [740]:
  - RF of loop [740:1]:
    -C/2+2


### Specialization of cost equations f458/6 
* CE 238 is refined into CE [743] 
* CE 239 is refined into CE [744] 
* CE 237 is refined into CE [745] 


### Cost equations --> "Loop" of f458/6 
* CEs [745] --> Loop 743 
* CEs [743] --> Loop 744 
* CEs [744] --> Loop 745 

### Ranking functions of CR f458(A,B,C,D,E,F) 
* RF of phase [743]: [-C+5]

#### Partial ranking functions of CR f458(A,B,C,D,E,F) 
* Partial RF of phase [743]:
  - RF of loop [743:1]:
    -C+5


### Specialization of cost equations f466/5 
* CE 243 is refined into CE [746] 
* CE 244 is refined into CE [747] 
* CE 242 is refined into CE [748] 


### Cost equations --> "Loop" of f466/5 
* CEs [748] --> Loop 746 
* CEs [746] --> Loop 747 
* CEs [747] --> Loop 748 

### Ranking functions of CR f466(A,C,D,E,F) 
* RF of phase [746]: [C-2]

#### Partial ranking functions of CR f466(A,C,D,E,F) 
* Partial RF of phase [746]:
  - RF of loop [746:1]:
    C-2


### Specialization of cost equations f472/5 
* CE 248 is refined into CE [749] 
* CE 249 is refined into CE [750] 
* CE 247 is refined into CE [751] 


### Cost equations --> "Loop" of f472/5 
* CEs [751] --> Loop 749 
* CEs [749] --> Loop 750 
* CEs [750] --> Loop 751 

### Ranking functions of CR f472(A,C,D,E,F) 
* RF of phase [749]: [C-1]

#### Partial ranking functions of CR f472(A,C,D,E,F) 
* Partial RF of phase [749]:
  - RF of loop [749:1]:
    C-1


### Specialization of cost equations f478/5 
* CE 253 is refined into CE [752] 
* CE 254 is refined into CE [753] 
* CE 252 is refined into CE [754] 


### Cost equations --> "Loop" of f478/5 
* CEs [754] --> Loop 752 
* CEs [752] --> Loop 753 
* CEs [753] --> Loop 754 

### Ranking functions of CR f478(A,C,D,E,F) 
* RF of phase [752]: [C-2]

#### Partial ranking functions of CR f478(A,C,D,E,F) 
* Partial RF of phase [752]:
  - RF of loop [752:1]:
    C-2


### Specialization of cost equations f484/5 
* CE 258 is refined into CE [755] 
* CE 259 is refined into CE [756] 
* CE 257 is refined into CE [757] 


### Cost equations --> "Loop" of f484/5 
* CEs [757] --> Loop 755 
* CEs [755] --> Loop 756 
* CEs [756] --> Loop 757 

### Ranking functions of CR f484(A,C,D,E,F) 
* RF of phase [755]: [C-1]

#### Partial ranking functions of CR f484(A,C,D,E,F) 
* Partial RF of phase [755]:
  - RF of loop [755:1]:
    C-1


### Specialization of cost equations f492/5 
* CE 263 is refined into CE [758] 
* CE 264 is refined into CE [759] 
* CE 262 is refined into CE [760] 


### Cost equations --> "Loop" of f492/5 
* CEs [760] --> Loop 758 
* CEs [758] --> Loop 759 
* CEs [759] --> Loop 760 

### Ranking functions of CR f492(A,C,D,E,F) 
* RF of phase [758]: [C-1]

#### Partial ranking functions of CR f492(A,C,D,E,F) 
* Partial RF of phase [758]:
  - RF of loop [758:1]:
    C-1


### Specialization of cost equations f498/5 
* CE 268 is refined into CE [761] 
* CE 269 is refined into CE [762] 
* CE 267 is refined into CE [763] 


### Cost equations --> "Loop" of f498/5 
* CEs [763] --> Loop 761 
* CEs [761] --> Loop 762 
* CEs [762] --> Loop 763 

### Ranking functions of CR f498(A,C,D,E,F) 
* RF of phase [761]: [C]

#### Partial ranking functions of CR f498(A,C,D,E,F) 
* Partial RF of phase [761]:
  - RF of loop [761:1]:
    C


### Specialization of cost equations f504/5 
* CE 273 is refined into CE [764] 
* CE 274 is refined into CE [765] 
* CE 272 is refined into CE [766] 


### Cost equations --> "Loop" of f504/5 
* CEs [766] --> Loop 764 
* CEs [764] --> Loop 765 
* CEs [765] --> Loop 766 

### Ranking functions of CR f504(A,C,D,E,F) 
* RF of phase [764]: [C-1]

#### Partial ranking functions of CR f504(A,C,D,E,F) 
* Partial RF of phase [764]:
  - RF of loop [764:1]:
    C-1


### Specialization of cost equations f510/5 
* CE 278 is refined into CE [767] 
* CE 279 is refined into CE [768] 
* CE 277 is refined into CE [769] 


### Cost equations --> "Loop" of f510/5 
* CEs [769] --> Loop 767 
* CEs [767] --> Loop 768 
* CEs [768] --> Loop 769 

### Ranking functions of CR f510(A,C,D,E,F) 
* RF of phase [767]: [C]

#### Partial ranking functions of CR f510(A,C,D,E,F) 
* Partial RF of phase [767]:
  - RF of loop [767:1]:
    C


### Specialization of cost equations f518/5 
* CE 283 is refined into CE [770] 
* CE 284 is refined into CE [771] 
* CE 282 is refined into CE [772] 


### Cost equations --> "Loop" of f518/5 
* CEs [772] --> Loop 770 
* CEs [770] --> Loop 771 
* CEs [771] --> Loop 772 

### Ranking functions of CR f518(A,C,D,E,F) 
* RF of phase [770]: [C]

#### Partial ranking functions of CR f518(A,C,D,E,F) 
* Partial RF of phase [770]:
  - RF of loop [770:1]:
    C


### Specialization of cost equations f524/5 
* CE 288 is refined into CE [773] 
* CE 289 is refined into CE [774] 
* CE 287 is refined into CE [775] 


### Cost equations --> "Loop" of f524/5 
* CEs [775] --> Loop 773 
* CEs [773] --> Loop 774 
* CEs [774] --> Loop 775 

### Ranking functions of CR f524(A,C,D,E,F) 
* RF of phase [773]: [C+1]

#### Partial ranking functions of CR f524(A,C,D,E,F) 
* Partial RF of phase [773]:
  - RF of loop [773:1]:
    C+1


### Specialization of cost equations f530/5 
* CE 293 is refined into CE [776] 
* CE 294 is refined into CE [777] 
* CE 292 is refined into CE [778] 


### Cost equations --> "Loop" of f530/5 
* CEs [778] --> Loop 776 
* CEs [776] --> Loop 777 
* CEs [777] --> Loop 778 

### Ranking functions of CR f530(A,C,D,E,F) 
* RF of phase [776]: [C]

#### Partial ranking functions of CR f530(A,C,D,E,F) 
* Partial RF of phase [776]:
  - RF of loop [776:1]:
    C


### Specialization of cost equations f536/5 
* CE 298 is refined into CE [779] 
* CE 299 is refined into CE [780] 
* CE 297 is refined into CE [781] 


### Cost equations --> "Loop" of f536/5 
* CEs [781] --> Loop 779 
* CEs [779] --> Loop 780 
* CEs [780] --> Loop 781 

### Ranking functions of CR f536(A,C,D,E,F) 
* RF of phase [779]: [C+1]

#### Partial ranking functions of CR f536(A,C,D,E,F) 
* Partial RF of phase [779]:
  - RF of loop [779:1]:
    C+1


### Specialization of cost equations f544/5 
* CE 303 is refined into CE [782] 
* CE 304 is refined into CE [783] 
* CE 302 is refined into CE [784] 


### Cost equations --> "Loop" of f544/5 
* CEs [784] --> Loop 782 
* CEs [782] --> Loop 783 
* CEs [783] --> Loop 784 

### Ranking functions of CR f544(A,C,D,E,F) 
* RF of phase [782]: [C+1]

#### Partial ranking functions of CR f544(A,C,D,E,F) 
* Partial RF of phase [782]:
  - RF of loop [782:1]:
    C+1


### Specialization of cost equations f550/5 
* CE 308 is refined into CE [785] 
* CE 309 is refined into CE [786] 
* CE 307 is refined into CE [787] 


### Cost equations --> "Loop" of f550/5 
* CEs [787] --> Loop 785 
* CEs [785] --> Loop 786 
* CEs [786] --> Loop 787 

### Ranking functions of CR f550(A,C,D,E,F) 
* RF of phase [785]: [C+2]

#### Partial ranking functions of CR f550(A,C,D,E,F) 
* Partial RF of phase [785]:
  - RF of loop [785:1]:
    C+2


### Specialization of cost equations f556/5 
* CE 313 is refined into CE [788] 
* CE 314 is refined into CE [789] 
* CE 312 is refined into CE [790] 


### Cost equations --> "Loop" of f556/5 
* CEs [790] --> Loop 788 
* CEs [788] --> Loop 789 
* CEs [789] --> Loop 790 

### Ranking functions of CR f556(A,C,D,E,F) 
* RF of phase [788]: [C+1]

#### Partial ranking functions of CR f556(A,C,D,E,F) 
* Partial RF of phase [788]:
  - RF of loop [788:1]:
    C+1


### Specialization of cost equations f562/5 
* CE 318 is refined into CE [791] 
* CE 319 is refined into CE [792] 
* CE 317 is refined into CE [793] 


### Cost equations --> "Loop" of f562/5 
* CEs [793] --> Loop 791 
* CEs [791] --> Loop 792 
* CEs [792] --> Loop 793 

### Ranking functions of CR f562(A,C,D,E,F) 
* RF of phase [791]: [C+2]

#### Partial ranking functions of CR f562(A,C,D,E,F) 
* Partial RF of phase [791]:
  - RF of loop [791:1]:
    C+2


### Specialization of cost equations f570/5 
* CE 323 is refined into CE [794] 
* CE 324 is refined into CE [795] 
* CE 322 is refined into CE [796] 


### Cost equations --> "Loop" of f570/5 
* CEs [796] --> Loop 794 
* CEs [794] --> Loop 795 
* CEs [795] --> Loop 796 

### Ranking functions of CR f570(A,C,D,E,F) 
* RF of phase [794]: [C+2]

#### Partial ranking functions of CR f570(A,C,D,E,F) 
* Partial RF of phase [794]:
  - RF of loop [794:1]:
    C+2


### Specialization of cost equations f576/5 
* CE 328 is refined into CE [797] 
* CE 329 is refined into CE [798] 
* CE 327 is refined into CE [799] 


### Cost equations --> "Loop" of f576/5 
* CEs [799] --> Loop 797 
* CEs [797] --> Loop 798 
* CEs [798] --> Loop 799 

### Ranking functions of CR f576(A,C,D,E,F) 
* RF of phase [797]: [C+3]

#### Partial ranking functions of CR f576(A,C,D,E,F) 
* Partial RF of phase [797]:
  - RF of loop [797:1]:
    C+3


### Specialization of cost equations f582/5 
* CE 333 is refined into CE [800] 
* CE 334 is refined into CE [801] 
* CE 332 is refined into CE [802] 


### Cost equations --> "Loop" of f582/5 
* CEs [802] --> Loop 800 
* CEs [800] --> Loop 801 
* CEs [801] --> Loop 802 

### Ranking functions of CR f582(A,C,D,E,F) 
* RF of phase [800]: [C+2]

#### Partial ranking functions of CR f582(A,C,D,E,F) 
* Partial RF of phase [800]:
  - RF of loop [800:1]:
    C+2


### Specialization of cost equations f588/5 
* CE 338 is refined into CE [803] 
* CE 339 is refined into CE [804] 
* CE 337 is refined into CE [805] 


### Cost equations --> "Loop" of f588/5 
* CEs [805] --> Loop 803 
* CEs [803] --> Loop 804 
* CEs [804] --> Loop 805 

### Ranking functions of CR f588(A,C,D,E,F) 
* RF of phase [803]: [C+3]

#### Partial ranking functions of CR f588(A,C,D,E,F) 
* Partial RF of phase [803]:
  - RF of loop [803:1]:
    C+3


### Specialization of cost equations f596/5 
* CE 343 is refined into CE [806] 
* CE 344 is refined into CE [807] 
* CE 342 is refined into CE [808] 


### Cost equations --> "Loop" of f596/5 
* CEs [808] --> Loop 806 
* CEs [806] --> Loop 807 
* CEs [807] --> Loop 808 

### Ranking functions of CR f596(A,C,D,E,F) 
* RF of phase [806]: [C+3]

#### Partial ranking functions of CR f596(A,C,D,E,F) 
* Partial RF of phase [806]:
  - RF of loop [806:1]:
    C+3


### Specialization of cost equations f602/5 
* CE 348 is refined into CE [809] 
* CE 349 is refined into CE [810] 
* CE 347 is refined into CE [811] 


### Cost equations --> "Loop" of f602/5 
* CEs [811] --> Loop 809 
* CEs [809] --> Loop 810 
* CEs [810] --> Loop 811 

### Ranking functions of CR f602(A,C,D,E,F) 
* RF of phase [809]: [C+4]

#### Partial ranking functions of CR f602(A,C,D,E,F) 
* Partial RF of phase [809]:
  - RF of loop [809:1]:
    C+4


### Specialization of cost equations f608/5 
* CE 353 is refined into CE [812] 
* CE 354 is refined into CE [813] 
* CE 352 is refined into CE [814] 


### Cost equations --> "Loop" of f608/5 
* CEs [814] --> Loop 812 
* CEs [812] --> Loop 813 
* CEs [813] --> Loop 814 

### Ranking functions of CR f608(A,C,D,E,F) 
* RF of phase [812]: [C+3]

#### Partial ranking functions of CR f608(A,C,D,E,F) 
* Partial RF of phase [812]:
  - RF of loop [812:1]:
    C+3


### Specialization of cost equations f614/5 
* CE 358 is refined into CE [815] 
* CE 359 is refined into CE [816] 
* CE 357 is refined into CE [817] 


### Cost equations --> "Loop" of f614/5 
* CEs [817] --> Loop 815 
* CEs [815] --> Loop 816 
* CEs [816] --> Loop 817 

### Ranking functions of CR f614(A,C,D,E,F) 
* RF of phase [815]: [C+4]

#### Partial ranking functions of CR f614(A,C,D,E,F) 
* Partial RF of phase [815]:
  - RF of loop [815:1]:
    C+4


### Specialization of cost equations f622/5 
* CE 363 is refined into CE [818] 
* CE 364 is refined into CE [819] 
* CE 362 is refined into CE [820] 


### Cost equations --> "Loop" of f622/5 
* CEs [820] --> Loop 818 
* CEs [818] --> Loop 819 
* CEs [819] --> Loop 820 

### Ranking functions of CR f622(A,C,D,E,F) 
* RF of phase [818]: [C+5]

#### Partial ranking functions of CR f622(A,C,D,E,F) 
* Partial RF of phase [818]:
  - RF of loop [818:1]:
    C+5


### Specialization of cost equations f628/5 
* CE 368 is refined into CE [821] 
* CE 369 is refined into CE [822] 
* CE 367 is refined into CE [823] 


### Cost equations --> "Loop" of f628/5 
* CEs [823] --> Loop 821 
* CEs [821] --> Loop 822 
* CEs [822] --> Loop 823 

### Ranking functions of CR f628(A,C,D,E,F) 
* RF of phase [821]: [C+6]

#### Partial ranking functions of CR f628(A,C,D,E,F) 
* Partial RF of phase [821]:
  - RF of loop [821:1]:
    C+6


### Specialization of cost equations f634/5 
* CE 373 is refined into CE [824] 
* CE 374 is refined into CE [825] 
* CE 372 is refined into CE [826] 


### Cost equations --> "Loop" of f634/5 
* CEs [826] --> Loop 824 
* CEs [824] --> Loop 825 
* CEs [825] --> Loop 826 

### Ranking functions of CR f634(A,C,D,E,F) 
* RF of phase [824]: [C+5]

#### Partial ranking functions of CR f634(A,C,D,E,F) 
* Partial RF of phase [824]:
  - RF of loop [824:1]:
    C+5


### Specialization of cost equations f640/5 
* CE 378 is refined into CE [827] 
* CE 379 is refined into CE [828] 
* CE 377 is refined into CE [829] 


### Cost equations --> "Loop" of f640/5 
* CEs [829] --> Loop 827 
* CEs [827] --> Loop 828 
* CEs [828] --> Loop 829 

### Ranking functions of CR f640(A,C,D,E,F) 
* RF of phase [827]: [C+6]

#### Partial ranking functions of CR f640(A,C,D,E,F) 
* Partial RF of phase [827]:
  - RF of loop [827:1]:
    C+6


### Specialization of cost equations f648/5 
* CE 383 is refined into CE [830] 
* CE 384 is refined into CE [831] 
* CE 382 is refined into CE [832] 


### Cost equations --> "Loop" of f648/5 
* CEs [832] --> Loop 830 
* CEs [830] --> Loop 831 
* CEs [831] --> Loop 832 

### Ranking functions of CR f648(A,C,D,E,F) 
* RF of phase [830]: [C+7]

#### Partial ranking functions of CR f648(A,C,D,E,F) 
* Partial RF of phase [830]:
  - RF of loop [830:1]:
    C+7


### Specialization of cost equations f654/5 
* CE 388 is refined into CE [833] 
* CE 389 is refined into CE [834] 
* CE 387 is refined into CE [835] 


### Cost equations --> "Loop" of f654/5 
* CEs [835] --> Loop 833 
* CEs [833] --> Loop 834 
* CEs [834] --> Loop 835 

### Ranking functions of CR f654(A,C,D,E,F) 
* RF of phase [833]: [C+8]

#### Partial ranking functions of CR f654(A,C,D,E,F) 
* Partial RF of phase [833]:
  - RF of loop [833:1]:
    C+8


### Specialization of cost equations f660/5 
* CE 393 is refined into CE [836] 
* CE 394 is refined into CE [837] 
* CE 392 is refined into CE [838] 


### Cost equations --> "Loop" of f660/5 
* CEs [838] --> Loop 836 
* CEs [836] --> Loop 837 
* CEs [837] --> Loop 838 

### Ranking functions of CR f660(A,C,D,E,F) 
* RF of phase [836]: [C+7]

#### Partial ranking functions of CR f660(A,C,D,E,F) 
* Partial RF of phase [836]:
  - RF of loop [836:1]:
    C+7


### Specialization of cost equations f666/5 
* CE 398 is refined into CE [839] 
* CE 399 is refined into CE [840] 
* CE 397 is refined into CE [841] 


### Cost equations --> "Loop" of f666/5 
* CEs [841] --> Loop 839 
* CEs [839] --> Loop 840 
* CEs [840] --> Loop 841 

### Ranking functions of CR f666(A,C,D,E,F) 
* RF of phase [839]: [C+8]

#### Partial ranking functions of CR f666(A,C,D,E,F) 
* Partial RF of phase [839]:
  - RF of loop [839:1]:
    C+8


### Specialization of cost equations f674/5 
* CE 403 is refined into CE [842] 
* CE 404 is refined into CE [843] 
* CE 402 is refined into CE [844] 


### Cost equations --> "Loop" of f674/5 
* CEs [844] --> Loop 842 
* CEs [842] --> Loop 843 
* CEs [843] --> Loop 844 

### Ranking functions of CR f674(A,C,D,E,F) 
* RF of phase [842]: [C+8]

#### Partial ranking functions of CR f674(A,C,D,E,F) 
* Partial RF of phase [842]:
  - RF of loop [842:1]:
    C+8


### Specialization of cost equations f680/5 
* CE 408 is refined into CE [845] 
* CE 409 is refined into CE [846] 
* CE 407 is refined into CE [847] 


### Cost equations --> "Loop" of f680/5 
* CEs [847] --> Loop 845 
* CEs [845] --> Loop 846 
* CEs [846] --> Loop 847 

### Ranking functions of CR f680(A,C,D,E,F) 
* RF of phase [845]: [C+9]

#### Partial ranking functions of CR f680(A,C,D,E,F) 
* Partial RF of phase [845]:
  - RF of loop [845:1]:
    C+9


### Specialization of cost equations f686/5 
* CE 413 is refined into CE [848] 
* CE 414 is refined into CE [849] 
* CE 412 is refined into CE [850] 


### Cost equations --> "Loop" of f686/5 
* CEs [850] --> Loop 848 
* CEs [848] --> Loop 849 
* CEs [849] --> Loop 850 

### Ranking functions of CR f686(A,C,D,E,F) 
* RF of phase [848]: [C+8]

#### Partial ranking functions of CR f686(A,C,D,E,F) 
* Partial RF of phase [848]:
  - RF of loop [848:1]:
    C+8


### Specialization of cost equations f692/5 
* CE 418 is refined into CE [851] 
* CE 419 is refined into CE [852] 
* CE 417 is refined into CE [853] 


### Cost equations --> "Loop" of f692/5 
* CEs [853] --> Loop 851 
* CEs [851] --> Loop 852 
* CEs [852] --> Loop 853 

### Ranking functions of CR f692(A,C,D,E,F) 
* RF of phase [851]: [C+9]

#### Partial ranking functions of CR f692(A,C,D,E,F) 
* Partial RF of phase [851]:
  - RF of loop [851:1]:
    C+9


### Specialization of cost equations f700/6 
* CE 423 is refined into CE [854] 
* CE 424 is refined into CE [855] 
* CE 422 is refined into CE [856] 


### Cost equations --> "Loop" of f700/6 
* CEs [856] --> Loop 854 
* CEs [854] --> Loop 855 
* CEs [855] --> Loop 856 

### Ranking functions of CR f700(A,B,C,D,E,F) 
* RF of phase [854]: [C/2-1]

#### Partial ranking functions of CR f700(A,B,C,D,E,F) 
* Partial RF of phase [854]:
  - RF of loop [854:1]:
    C/2-1


### Specialization of cost equations f706/6 
* CE 428 is refined into CE [857] 
* CE 429 is refined into CE [858] 
* CE 427 is refined into CE [859] 


### Cost equations --> "Loop" of f706/6 
* CEs [859] --> Loop 857 
* CEs [857] --> Loop 858 
* CEs [858] --> Loop 859 

### Ranking functions of CR f706(A,B,C,D,E,F) 
* RF of phase [857]: [C-1]

#### Partial ranking functions of CR f706(A,B,C,D,E,F) 
* Partial RF of phase [857]:
  - RF of loop [857:1]:
    C-1


### Specialization of cost equations f712/6 
* CE 433 is refined into CE [860] 
* CE 434 is refined into CE [861] 
* CE 432 is refined into CE [862] 


### Cost equations --> "Loop" of f712/6 
* CEs [862] --> Loop 860 
* CEs [860] --> Loop 861 
* CEs [861] --> Loop 862 

### Ranking functions of CR f712(A,B,C,D,E,F) 
* RF of phase [860]: [C/2-1]

#### Partial ranking functions of CR f712(A,B,C,D,E,F) 
* Partial RF of phase [860]:
  - RF of loop [860:1]:
    C/2-1


### Specialization of cost equations f718/6 
* CE 438 is refined into CE [863] 
* CE 439 is refined into CE [864] 
* CE 437 is refined into CE [865] 


### Cost equations --> "Loop" of f718/6 
* CEs [865] --> Loop 863 
* CEs [863] --> Loop 864 
* CEs [864] --> Loop 865 

### Ranking functions of CR f718(A,B,C,D,E,F) 
* RF of phase [863]: [C-1]

#### Partial ranking functions of CR f718(A,B,C,D,E,F) 
* Partial RF of phase [863]:
  - RF of loop [863:1]:
    C-1


### Specialization of cost equations f726/6 
* CE 443 is refined into CE [866] 
* CE 444 is refined into CE [867] 
* CE 442 is refined into CE [868] 


### Cost equations --> "Loop" of f726/6 
* CEs [868] --> Loop 866 
* CEs [866] --> Loop 867 
* CEs [867] --> Loop 868 

### Ranking functions of CR f726(A,B,C,D,E,F) 
* RF of phase [866]: [C-1]

#### Partial ranking functions of CR f726(A,B,C,D,E,F) 
* Partial RF of phase [866]:
  - RF of loop [866:1]:
    C-1


### Specialization of cost equations f732/6 
* CE 448 is refined into CE [869] 
* CE 449 is refined into CE [870] 
* CE 447 is refined into CE [871] 


### Cost equations --> "Loop" of f732/6 
* CEs [871] --> Loop 869 
* CEs [869] --> Loop 870 
* CEs [870] --> Loop 871 

### Ranking functions of CR f732(A,B,C,D,E,F) 
* RF of phase [869]: [C/2]

#### Partial ranking functions of CR f732(A,B,C,D,E,F) 
* Partial RF of phase [869]:
  - RF of loop [869:1]:
    C/2


### Specialization of cost equations f738/6 
* CE 453 is refined into CE [872] 
* CE 454 is refined into CE [873] 
* CE 452 is refined into CE [874] 


### Cost equations --> "Loop" of f738/6 
* CEs [874] --> Loop 872 
* CEs [872] --> Loop 873 
* CEs [873] --> Loop 874 

### Ranking functions of CR f738(A,B,C,D,E,F) 
* RF of phase [872]: [C-1]

#### Partial ranking functions of CR f738(A,B,C,D,E,F) 
* Partial RF of phase [872]:
  - RF of loop [872:1]:
    C-1


### Specialization of cost equations f744/6 
* CE 458 is refined into CE [875] 
* CE 459 is refined into CE [876] 
* CE 457 is refined into CE [877] 


### Cost equations --> "Loop" of f744/6 
* CEs [877] --> Loop 875 
* CEs [875] --> Loop 876 
* CEs [876] --> Loop 877 

### Ranking functions of CR f744(A,B,C,D,E,F) 
* RF of phase [875]: [C/2]

#### Partial ranking functions of CR f744(A,B,C,D,E,F) 
* Partial RF of phase [875]:
  - RF of loop [875:1]:
    C/2


### Specialization of cost equations f752/6 
* CE 463 is refined into CE [878] 
* CE 464 is refined into CE [879] 
* CE 462 is refined into CE [880] 


### Cost equations --> "Loop" of f752/6 
* CEs [880] --> Loop 878 
* CEs [878] --> Loop 879 
* CEs [879] --> Loop 880 

### Ranking functions of CR f752(A,B,C,D,E,F) 
* RF of phase [878]: [C/2]

#### Partial ranking functions of CR f752(A,B,C,D,E,F) 
* Partial RF of phase [878]:
  - RF of loop [878:1]:
    C/2


### Specialization of cost equations f758/6 
* CE 468 is refined into CE [881] 
* CE 469 is refined into CE [882] 
* CE 467 is refined into CE [883] 


### Cost equations --> "Loop" of f758/6 
* CEs [883] --> Loop 881 
* CEs [881] --> Loop 882 
* CEs [882] --> Loop 883 

### Ranking functions of CR f758(A,B,C,D,E,F) 
* RF of phase [881]: [C+1]

#### Partial ranking functions of CR f758(A,B,C,D,E,F) 
* Partial RF of phase [881]:
  - RF of loop [881:1]:
    C+1


### Specialization of cost equations f764/6 
* CE 473 is refined into CE [884] 
* CE 474 is refined into CE [885] 
* CE 472 is refined into CE [886] 


### Cost equations --> "Loop" of f764/6 
* CEs [886] --> Loop 884 
* CEs [884] --> Loop 885 
* CEs [885] --> Loop 886 

### Ranking functions of CR f764(A,B,C,D,E,F) 
* RF of phase [884]: [C/2]

#### Partial ranking functions of CR f764(A,B,C,D,E,F) 
* Partial RF of phase [884]:
  - RF of loop [884:1]:
    C/2


### Specialization of cost equations f770/6 
* CE 478 is refined into CE [887] 
* CE 479 is refined into CE [888] 
* CE 477 is refined into CE [889] 


### Cost equations --> "Loop" of f770/6 
* CEs [889] --> Loop 887 
* CEs [887] --> Loop 888 
* CEs [888] --> Loop 889 

### Ranking functions of CR f770(A,B,C,D,E,F) 
* RF of phase [887]: [C+1]

#### Partial ranking functions of CR f770(A,B,C,D,E,F) 
* Partial RF of phase [887]:
  - RF of loop [887:1]:
    C+1


### Specialization of cost equations f778/6 
* CE 483 is refined into CE [890] 
* CE 484 is refined into CE [891] 
* CE 482 is refined into CE [892] 


### Cost equations --> "Loop" of f778/6 
* CEs [892] --> Loop 890 
* CEs [890] --> Loop 891 
* CEs [891] --> Loop 892 

### Ranking functions of CR f778(A,B,C,D,E,F) 
* RF of phase [890]: [C+1]

#### Partial ranking functions of CR f778(A,B,C,D,E,F) 
* Partial RF of phase [890]:
  - RF of loop [890:1]:
    C+1


### Specialization of cost equations f784/6 
* CE 488 is refined into CE [893] 
* CE 489 is refined into CE [894] 
* CE 487 is refined into CE [895] 


### Cost equations --> "Loop" of f784/6 
* CEs [895] --> Loop 893 
* CEs [893] --> Loop 894 
* CEs [894] --> Loop 895 

### Ranking functions of CR f784(A,B,C,D,E,F) 
* RF of phase [893]: [C/2+1]

#### Partial ranking functions of CR f784(A,B,C,D,E,F) 
* Partial RF of phase [893]:
  - RF of loop [893:1]:
    C/2+1


### Specialization of cost equations f790/6 
* CE 493 is refined into CE [896] 
* CE 494 is refined into CE [897] 
* CE 492 is refined into CE [898] 


### Cost equations --> "Loop" of f790/6 
* CEs [898] --> Loop 896 
* CEs [896] --> Loop 897 
* CEs [897] --> Loop 898 

### Ranking functions of CR f790(A,B,C,D,E,F) 
* RF of phase [896]: [C+1]

#### Partial ranking functions of CR f790(A,B,C,D,E,F) 
* Partial RF of phase [896]:
  - RF of loop [896:1]:
    C+1


### Specialization of cost equations f796/6 
* CE 498 is refined into CE [899] 
* CE 499 is refined into CE [900] 
* CE 497 is refined into CE [901] 


### Cost equations --> "Loop" of f796/6 
* CEs [901] --> Loop 899 
* CEs [899] --> Loop 900 
* CEs [900] --> Loop 901 

### Ranking functions of CR f796(A,B,C,D,E,F) 
* RF of phase [899]: [C/2+1]

#### Partial ranking functions of CR f796(A,B,C,D,E,F) 
* Partial RF of phase [899]:
  - RF of loop [899:1]:
    C/2+1


### Specialization of cost equations f804/6 
* CE 503 is refined into CE [902] 
* CE 504 is refined into CE [903] 
* CE 502 is refined into CE [904] 


### Cost equations --> "Loop" of f804/6 
* CEs [904] --> Loop 902 
* CEs [902] --> Loop 903 
* CEs [903] --> Loop 904 

### Ranking functions of CR f804(A,B,C,D,E,F) 
* RF of phase [902]: [C/2+1]

#### Partial ranking functions of CR f804(A,B,C,D,E,F) 
* Partial RF of phase [902]:
  - RF of loop [902:1]:
    C/2+1


### Specialization of cost equations f810/6 
* CE 508 is refined into CE [905] 
* CE 509 is refined into CE [906] 
* CE 507 is refined into CE [907] 


### Cost equations --> "Loop" of f810/6 
* CEs [907] --> Loop 905 
* CEs [905] --> Loop 906 
* CEs [906] --> Loop 907 

### Ranking functions of CR f810(A,B,C,D,E,F) 
* RF of phase [905]: [C+3]

#### Partial ranking functions of CR f810(A,B,C,D,E,F) 
* Partial RF of phase [905]:
  - RF of loop [905:1]:
    C+3


### Specialization of cost equations f816/6 
* CE 513 is refined into CE [908] 
* CE 514 is refined into CE [909] 
* CE 512 is refined into CE [910] 


### Cost equations --> "Loop" of f816/6 
* CEs [910] --> Loop 908 
* CEs [908] --> Loop 909 
* CEs [909] --> Loop 910 

### Ranking functions of CR f816(A,B,C,D,E,F) 
* RF of phase [908]: [C/2+1]

#### Partial ranking functions of CR f816(A,B,C,D,E,F) 
* Partial RF of phase [908]:
  - RF of loop [908:1]:
    C/2+1


### Specialization of cost equations f822/6 
* CE 518 is refined into CE [911] 
* CE 519 is refined into CE [912] 
* CE 517 is refined into CE [913] 


### Cost equations --> "Loop" of f822/6 
* CEs [913] --> Loop 911 
* CEs [911] --> Loop 912 
* CEs [912] --> Loop 913 

### Ranking functions of CR f822(A,B,C,D,E,F) 
* RF of phase [911]: [C+3]

#### Partial ranking functions of CR f822(A,B,C,D,E,F) 
* Partial RF of phase [911]:
  - RF of loop [911:1]:
    C+3


### Specialization of cost equations f830/6 
* CE 523 is refined into CE [914] 
* CE 524 is refined into CE [915] 
* CE 522 is refined into CE [916] 


### Cost equations --> "Loop" of f830/6 
* CEs [916] --> Loop 914 
* CEs [914] --> Loop 915 
* CEs [915] --> Loop 916 

### Ranking functions of CR f830(A,B,C,D,E,F) 
* RF of phase [914]: [C+3]

#### Partial ranking functions of CR f830(A,B,C,D,E,F) 
* Partial RF of phase [914]:
  - RF of loop [914:1]:
    C+3


### Specialization of cost equations f836/6 
* CE 528 is refined into CE [917] 
* CE 529 is refined into CE [918] 
* CE 527 is refined into CE [919] 


### Cost equations --> "Loop" of f836/6 
* CEs [919] --> Loop 917 
* CEs [917] --> Loop 918 
* CEs [918] --> Loop 919 

### Ranking functions of CR f836(A,B,C,D,E,F) 
* RF of phase [917]: [C/2+2]

#### Partial ranking functions of CR f836(A,B,C,D,E,F) 
* Partial RF of phase [917]:
  - RF of loop [917:1]:
    C/2+2


### Specialization of cost equations f842/6 
* CE 533 is refined into CE [920] 
* CE 534 is refined into CE [921] 
* CE 532 is refined into CE [922] 


### Cost equations --> "Loop" of f842/6 
* CEs [922] --> Loop 920 
* CEs [920] --> Loop 921 
* CEs [921] --> Loop 922 

### Ranking functions of CR f842(A,B,C,D,E,F) 
* RF of phase [920]: [C+3]

#### Partial ranking functions of CR f842(A,B,C,D,E,F) 
* Partial RF of phase [920]:
  - RF of loop [920:1]:
    C+3


### Specialization of cost equations f848/6 
* CE 538 is refined into CE [923] 
* CE 539 is refined into CE [924] 
* CE 537 is refined into CE [925] 


### Cost equations --> "Loop" of f848/6 
* CEs [925] --> Loop 923 
* CEs [923] --> Loop 924 
* CEs [924] --> Loop 925 

### Ranking functions of CR f848(A,B,C,D,E,F) 
* RF of phase [923]: [C/2+2]

#### Partial ranking functions of CR f848(A,B,C,D,E,F) 
* Partial RF of phase [923]:
  - RF of loop [923:1]:
    C/2+2


### Specialization of cost equations f856/6 
* CE 543 is refined into CE [926] 
* CE 544 is refined into CE [927] 
* CE 542 is refined into CE [928] 


### Cost equations --> "Loop" of f856/6 
* CEs [928] --> Loop 926 
* CEs [926] --> Loop 927 
* CEs [927] --> Loop 928 

### Ranking functions of CR f856(A,B,C,D,E,F) 
* RF of phase [926]: [C+5]

#### Partial ranking functions of CR f856(A,B,C,D,E,F) 
* Partial RF of phase [926]:
  - RF of loop [926:1]:
    C+5


### Specialization of cost equations f862/6 
* CE 548 is refined into CE [929] 
* CE 549 is refined into CE [930] 
* CE 547 is refined into CE [931] 


### Cost equations --> "Loop" of f862/6 
* CEs [931] --> Loop 929 
* CEs [929] --> Loop 930 
* CEs [930] --> Loop 931 

### Ranking functions of CR f862(A,B,C,D,E,F) 
* RF of phase [929]: [C/2+3]

#### Partial ranking functions of CR f862(A,B,C,D,E,F) 
* Partial RF of phase [929]:
  - RF of loop [929:1]:
    C/2+3


### Specialization of cost equations f868/6 
* CE 553 is refined into CE [932] 
* CE 554 is refined into CE [933] 
* CE 552 is refined into CE [934] 


### Cost equations --> "Loop" of f868/6 
* CEs [934] --> Loop 932 
* CEs [932] --> Loop 933 
* CEs [933] --> Loop 934 

### Ranking functions of CR f868(A,B,C,D,E,F) 
* RF of phase [932]: [C+5]

#### Partial ranking functions of CR f868(A,B,C,D,E,F) 
* Partial RF of phase [932]:
  - RF of loop [932:1]:
    C+5


### Specialization of cost equations f874/6 
* CE 558 is refined into CE [935] 
* CE 559 is refined into CE [936] 
* CE 557 is refined into CE [937] 


### Cost equations --> "Loop" of f874/6 
* CEs [937] --> Loop 935 
* CEs [935] --> Loop 936 
* CEs [936] --> Loop 937 

### Ranking functions of CR f874(A,B,C,D,E,F) 
* RF of phase [935]: [C/2+3]

#### Partial ranking functions of CR f874(A,B,C,D,E,F) 
* Partial RF of phase [935]:
  - RF of loop [935:1]:
    C/2+3


### Specialization of cost equations f882/6 
* CE 563 is refined into CE [938] 
* CE 564 is refined into CE [939] 
* CE 562 is refined into CE [940] 


### Cost equations --> "Loop" of f882/6 
* CEs [940] --> Loop 938 
* CEs [938] --> Loop 939 
* CEs [939] --> Loop 940 

### Ranking functions of CR f882(A,B,C,D,E,F) 
* RF of phase [938]: [C+7]

#### Partial ranking functions of CR f882(A,B,C,D,E,F) 
* Partial RF of phase [938]:
  - RF of loop [938:1]:
    C+7


### Specialization of cost equations f888/6 
* CE 568 is refined into CE [941] 
* CE 569 is refined into CE [942] 
* CE 567 is refined into CE [943] 


### Cost equations --> "Loop" of f888/6 
* CEs [943] --> Loop 941 
* CEs [941] --> Loop 942 
* CEs [942] --> Loop 943 

### Ranking functions of CR f888(A,B,C,D,E,F) 
* RF of phase [941]: [C/2+4]

#### Partial ranking functions of CR f888(A,B,C,D,E,F) 
* Partial RF of phase [941]:
  - RF of loop [941:1]:
    C/2+4


### Specialization of cost equations f894/6 
* CE 573 is refined into CE [944] 
* CE 574 is refined into CE [945] 
* CE 572 is refined into CE [946] 


### Cost equations --> "Loop" of f894/6 
* CEs [946] --> Loop 944 
* CEs [944] --> Loop 945 
* CEs [945] --> Loop 946 

### Ranking functions of CR f894(A,B,C,D,E,F) 
* RF of phase [944]: [C+7]

#### Partial ranking functions of CR f894(A,B,C,D,E,F) 
* Partial RF of phase [944]:
  - RF of loop [944:1]:
    C+7


### Specialization of cost equations f900/6 
* CE 578 is refined into CE [947] 
* CE 579 is refined into CE [948] 
* CE 577 is refined into CE [949] 


### Cost equations --> "Loop" of f900/6 
* CEs [949] --> Loop 947 
* CEs [947] --> Loop 948 
* CEs [948] --> Loop 949 

### Ranking functions of CR f900(A,B,C,D,E,F) 
* RF of phase [947]: [C/2+4]

#### Partial ranking functions of CR f900(A,B,C,D,E,F) 
* Partial RF of phase [947]:
  - RF of loop [947:1]:
    C/2+4


### Specialization of cost equations f908/6 
* CE 583 is refined into CE [950] 
* CE 584 is refined into CE [951] 
* CE 582 is refined into CE [952] 


### Cost equations --> "Loop" of f908/6 
* CEs [952] --> Loop 950 
* CEs [950] --> Loop 951 
* CEs [951] --> Loop 952 

### Ranking functions of CR f908(A,B,C,D,E,F) 
* RF of phase [950]: [C/2+4]

#### Partial ranking functions of CR f908(A,B,C,D,E,F) 
* Partial RF of phase [950]:
  - RF of loop [950:1]:
    C/2+4


### Specialization of cost equations f914/6 
* CE 588 is refined into CE [953] 
* CE 589 is refined into CE [954] 
* CE 587 is refined into CE [955] 


### Cost equations --> "Loop" of f914/6 
* CEs [955] --> Loop 953 
* CEs [953] --> Loop 954 
* CEs [954] --> Loop 955 

### Ranking functions of CR f914(A,B,C,D,E,F) 
* RF of phase [953]: [C+9]

#### Partial ranking functions of CR f914(A,B,C,D,E,F) 
* Partial RF of phase [953]:
  - RF of loop [953:1]:
    C+9


### Specialization of cost equations f920/6 
* CE 593 is refined into CE [956] 
* CE 594 is refined into CE [957] 
* CE 592 is refined into CE [958] 


### Cost equations --> "Loop" of f920/6 
* CEs [958] --> Loop 956 
* CEs [956] --> Loop 957 
* CEs [957] --> Loop 958 

### Ranking functions of CR f920(A,B,C,D,E,F) 
* RF of phase [956]: [C/2+4]

#### Partial ranking functions of CR f920(A,B,C,D,E,F) 
* Partial RF of phase [956]:
  - RF of loop [956:1]:
    C/2+4


### Specialization of cost equations f926/6 
* CE 599 is refined into CE [959] 
* CE 598 is refined into CE [960] 
* CE 597 is refined into CE [961] 


### Cost equations --> "Loop" of f926/6 
* CEs [961] --> Loop 959 
* CEs [959] --> Loop 960 
* CEs [960] --> Loop 961 

### Ranking functions of CR f926(A,B,C,D,E,F) 
* RF of phase [959]: [C+9]

#### Partial ranking functions of CR f926(A,B,C,D,E,F) 
* Partial RF of phase [959]:
  - RF of loop [959:1]:
    C+9


### Specialization of cost equations f926_loop_cont/5 
* CE 601 is refined into CE [962] 
* CE 600 is refined into CE [963] 


### Cost equations --> "Loop" of f926_loop_cont/5 
* CEs [962] --> Loop 962 
* CEs [963] --> Loop 963 

### Ranking functions of CR f926_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f926_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f920_loop_cont/5 
* CE 596 is refined into CE [964,965,966,967] 
* CE 595 is refined into CE [968] 


### Cost equations --> "Loop" of f920_loop_cont/5 
* CEs [965,967] --> Loop 964 
* CEs [964] --> Loop 965 
* CEs [966] --> Loop 966 
* CEs [968] --> Loop 967 

### Ranking functions of CR f920_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f920_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f914_loop_cont/5 
* CE 591 is refined into CE [969,970,971,972,973,974] 
* CE 590 is refined into CE [975] 


### Cost equations --> "Loop" of f914_loop_cont/5 
* CEs [970,973,974] --> Loop 968 
* CEs [971,972] --> Loop 969 
* CEs [969] --> Loop 970 
* CEs [975] --> Loop 971 

### Ranking functions of CR f914_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f914_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f908_loop_cont/5 
* CE 586 is refined into CE [976,977,978,979,980,981] 
* CE 585 is refined into CE [982] 


### Cost equations --> "Loop" of f908_loop_cont/5 
* CEs [977,980,981] --> Loop 972 
* CEs [978,979] --> Loop 973 
* CEs [976] --> Loop 974 
* CEs [982] --> Loop 975 

### Ranking functions of CR f908_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f908_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f900_loop_cont/5 
* CE 581 is refined into CE [983,984,985,986,987,988] 
* CE 580 is refined into CE [989] 


### Cost equations --> "Loop" of f900_loop_cont/5 
* CEs [984,987,988] --> Loop 976 
* CEs [985,986] --> Loop 977 
* CEs [983] --> Loop 978 
* CEs [989] --> Loop 979 

### Ranking functions of CR f900_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f900_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f894_loop_cont/5 
* CE 576 is refined into CE [990,991,992,993,994,995] 
* CE 575 is refined into CE [996] 


### Cost equations --> "Loop" of f894_loop_cont/5 
* CEs [991,994,995] --> Loop 980 
* CEs [992,993] --> Loop 981 
* CEs [990] --> Loop 982 
* CEs [996] --> Loop 983 

### Ranking functions of CR f894_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f894_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f888_loop_cont/5 
* CE 571 is refined into CE [997,998,999,1000,1001,1002] 
* CE 570 is refined into CE [1003] 


### Cost equations --> "Loop" of f888_loop_cont/5 
* CEs [998,1001,1002] --> Loop 984 
* CEs [999,1000] --> Loop 985 
* CEs [997] --> Loop 986 
* CEs [1003] --> Loop 987 

### Ranking functions of CR f888_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f888_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f882_loop_cont/5 
* CE 566 is refined into CE [1004,1005,1006,1007,1008,1009] 
* CE 565 is refined into CE [1010] 


### Cost equations --> "Loop" of f882_loop_cont/5 
* CEs [1005,1008,1009] --> Loop 988 
* CEs [1006,1007] --> Loop 989 
* CEs [1004] --> Loop 990 
* CEs [1010] --> Loop 991 

### Ranking functions of CR f882_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f882_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f874_loop_cont/5 
* CE 561 is refined into CE [1011,1012,1013,1014,1015,1016] 
* CE 560 is refined into CE [1017] 


### Cost equations --> "Loop" of f874_loop_cont/5 
* CEs [1012,1015,1016] --> Loop 992 
* CEs [1013,1014] --> Loop 993 
* CEs [1011] --> Loop 994 
* CEs [1017] --> Loop 995 

### Ranking functions of CR f874_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f874_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f868_loop_cont/5 
* CE 556 is refined into CE [1018,1019,1020,1021,1022,1023] 
* CE 555 is refined into CE [1024] 


### Cost equations --> "Loop" of f868_loop_cont/5 
* CEs [1019,1022,1023] --> Loop 996 
* CEs [1020,1021] --> Loop 997 
* CEs [1018] --> Loop 998 
* CEs [1024] --> Loop 999 

### Ranking functions of CR f868_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f868_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f862_loop_cont/5 
* CE 551 is refined into CE [1025,1026,1027,1028,1029,1030] 
* CE 550 is refined into CE [1031] 


### Cost equations --> "Loop" of f862_loop_cont/5 
* CEs [1026,1029,1030] --> Loop 1000 
* CEs [1027,1028] --> Loop 1001 
* CEs [1025] --> Loop 1002 
* CEs [1031] --> Loop 1003 

### Ranking functions of CR f862_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f862_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f856_loop_cont/5 
* CE 546 is refined into CE [1032,1033,1034,1035,1036,1037] 
* CE 545 is refined into CE [1038] 


### Cost equations --> "Loop" of f856_loop_cont/5 
* CEs [1033,1036,1037] --> Loop 1004 
* CEs [1034,1035] --> Loop 1005 
* CEs [1032] --> Loop 1006 
* CEs [1038] --> Loop 1007 

### Ranking functions of CR f856_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f856_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f848_loop_cont/5 
* CE 541 is refined into CE [1039,1040,1041,1042,1043,1044] 
* CE 540 is refined into CE [1045] 


### Cost equations --> "Loop" of f848_loop_cont/5 
* CEs [1040,1043,1044] --> Loop 1008 
* CEs [1041,1042] --> Loop 1009 
* CEs [1039] --> Loop 1010 
* CEs [1045] --> Loop 1011 

### Ranking functions of CR f848_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f848_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f842_loop_cont/5 
* CE 536 is refined into CE [1046,1047,1048,1049,1050,1051] 
* CE 535 is refined into CE [1052] 


### Cost equations --> "Loop" of f842_loop_cont/5 
* CEs [1047,1050,1051] --> Loop 1012 
* CEs [1048,1049] --> Loop 1013 
* CEs [1046] --> Loop 1014 
* CEs [1052] --> Loop 1015 

### Ranking functions of CR f842_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f842_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f836_loop_cont/5 
* CE 531 is refined into CE [1053,1054,1055,1056,1057,1058] 
* CE 530 is refined into CE [1059] 


### Cost equations --> "Loop" of f836_loop_cont/5 
* CEs [1054,1057,1058] --> Loop 1016 
* CEs [1055,1056] --> Loop 1017 
* CEs [1053] --> Loop 1018 
* CEs [1059] --> Loop 1019 

### Ranking functions of CR f836_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f836_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f830_loop_cont/5 
* CE 526 is refined into CE [1060,1061,1062,1063,1064,1065] 
* CE 525 is refined into CE [1066] 


### Cost equations --> "Loop" of f830_loop_cont/5 
* CEs [1061,1064,1065] --> Loop 1020 
* CEs [1062,1063] --> Loop 1021 
* CEs [1060] --> Loop 1022 
* CEs [1066] --> Loop 1023 

### Ranking functions of CR f830_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f830_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f822_loop_cont/5 
* CE 521 is refined into CE [1067,1068,1069,1070,1071,1072] 
* CE 520 is refined into CE [1073] 


### Cost equations --> "Loop" of f822_loop_cont/5 
* CEs [1068,1071,1072] --> Loop 1024 
* CEs [1069,1070] --> Loop 1025 
* CEs [1067] --> Loop 1026 
* CEs [1073] --> Loop 1027 

### Ranking functions of CR f822_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f822_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f816_loop_cont/5 
* CE 516 is refined into CE [1074,1075,1076,1077,1078,1079] 
* CE 515 is refined into CE [1080] 


### Cost equations --> "Loop" of f816_loop_cont/5 
* CEs [1075,1078,1079] --> Loop 1028 
* CEs [1076,1077] --> Loop 1029 
* CEs [1074] --> Loop 1030 
* CEs [1080] --> Loop 1031 

### Ranking functions of CR f816_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f816_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f810_loop_cont/5 
* CE 511 is refined into CE [1081,1082,1083,1084,1085,1086] 
* CE 510 is refined into CE [1087] 


### Cost equations --> "Loop" of f810_loop_cont/5 
* CEs [1082,1085,1086] --> Loop 1032 
* CEs [1083,1084] --> Loop 1033 
* CEs [1081] --> Loop 1034 
* CEs [1087] --> Loop 1035 

### Ranking functions of CR f810_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f810_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f804_loop_cont/5 
* CE 506 is refined into CE [1088,1089,1090,1091,1092,1093] 
* CE 505 is refined into CE [1094] 


### Cost equations --> "Loop" of f804_loop_cont/5 
* CEs [1089,1092,1093] --> Loop 1036 
* CEs [1090,1091] --> Loop 1037 
* CEs [1088] --> Loop 1038 
* CEs [1094] --> Loop 1039 

### Ranking functions of CR f804_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f804_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f796_loop_cont/5 
* CE 501 is refined into CE [1095,1096,1097,1098,1099,1100] 
* CE 500 is refined into CE [1101] 


### Cost equations --> "Loop" of f796_loop_cont/5 
* CEs [1096,1099,1100] --> Loop 1040 
* CEs [1097,1098] --> Loop 1041 
* CEs [1095] --> Loop 1042 
* CEs [1101] --> Loop 1043 

### Ranking functions of CR f796_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f796_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f790_loop_cont/5 
* CE 496 is refined into CE [1102,1103,1104,1105,1106,1107] 
* CE 495 is refined into CE [1108] 


### Cost equations --> "Loop" of f790_loop_cont/5 
* CEs [1103,1106,1107] --> Loop 1044 
* CEs [1104,1105] --> Loop 1045 
* CEs [1102] --> Loop 1046 
* CEs [1108] --> Loop 1047 

### Ranking functions of CR f790_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f790_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f784_loop_cont/5 
* CE 491 is refined into CE [1109,1110,1111,1112,1113,1114] 
* CE 490 is refined into CE [1115] 


### Cost equations --> "Loop" of f784_loop_cont/5 
* CEs [1110,1113,1114] --> Loop 1048 
* CEs [1111,1112] --> Loop 1049 
* CEs [1109] --> Loop 1050 
* CEs [1115] --> Loop 1051 

### Ranking functions of CR f784_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f784_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f778_loop_cont/5 
* CE 486 is refined into CE [1116,1117,1118,1119,1120,1121] 
* CE 485 is refined into CE [1122] 


### Cost equations --> "Loop" of f778_loop_cont/5 
* CEs [1117,1120,1121] --> Loop 1052 
* CEs [1118,1119] --> Loop 1053 
* CEs [1116] --> Loop 1054 
* CEs [1122] --> Loop 1055 

### Ranking functions of CR f778_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f778_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f770_loop_cont/5 
* CE 481 is refined into CE [1123,1124,1125,1126,1127,1128] 
* CE 480 is refined into CE [1129] 


### Cost equations --> "Loop" of f770_loop_cont/5 
* CEs [1124,1127,1128] --> Loop 1056 
* CEs [1125,1126] --> Loop 1057 
* CEs [1123] --> Loop 1058 
* CEs [1129] --> Loop 1059 

### Ranking functions of CR f770_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f770_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f764_loop_cont/5 
* CE 476 is refined into CE [1130,1131,1132,1133,1134,1135] 
* CE 475 is refined into CE [1136] 


### Cost equations --> "Loop" of f764_loop_cont/5 
* CEs [1131,1134,1135] --> Loop 1060 
* CEs [1132,1133] --> Loop 1061 
* CEs [1130] --> Loop 1062 
* CEs [1136] --> Loop 1063 

### Ranking functions of CR f764_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f764_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f758_loop_cont/5 
* CE 471 is refined into CE [1137,1138,1139,1140,1141,1142] 
* CE 470 is refined into CE [1143] 


### Cost equations --> "Loop" of f758_loop_cont/5 
* CEs [1138,1141,1142] --> Loop 1064 
* CEs [1139,1140] --> Loop 1065 
* CEs [1137] --> Loop 1066 
* CEs [1143] --> Loop 1067 

### Ranking functions of CR f758_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f758_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f752_loop_cont/5 
* CE 466 is refined into CE [1144,1145,1146,1147,1148,1149] 
* CE 465 is refined into CE [1150] 


### Cost equations --> "Loop" of f752_loop_cont/5 
* CEs [1145,1148,1149] --> Loop 1068 
* CEs [1146,1147] --> Loop 1069 
* CEs [1144] --> Loop 1070 
* CEs [1150] --> Loop 1071 

### Ranking functions of CR f752_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f752_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f744_loop_cont/5 
* CE 461 is refined into CE [1151,1152,1153,1154,1155,1156] 
* CE 460 is refined into CE [1157] 


### Cost equations --> "Loop" of f744_loop_cont/5 
* CEs [1152,1155,1156] --> Loop 1072 
* CEs [1153,1154] --> Loop 1073 
* CEs [1151] --> Loop 1074 
* CEs [1157] --> Loop 1075 

### Ranking functions of CR f744_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f744_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f738_loop_cont/5 
* CE 456 is refined into CE [1158,1159,1160,1161,1162,1163] 
* CE 455 is refined into CE [1164] 


### Cost equations --> "Loop" of f738_loop_cont/5 
* CEs [1159,1162,1163] --> Loop 1076 
* CEs [1160,1161] --> Loop 1077 
* CEs [1158] --> Loop 1078 
* CEs [1164] --> Loop 1079 

### Ranking functions of CR f738_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f738_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f732_loop_cont/5 
* CE 451 is refined into CE [1165,1166,1167,1168,1169,1170] 
* CE 450 is refined into CE [1171] 


### Cost equations --> "Loop" of f732_loop_cont/5 
* CEs [1166,1169,1170] --> Loop 1080 
* CEs [1167,1168] --> Loop 1081 
* CEs [1165] --> Loop 1082 
* CEs [1171] --> Loop 1083 

### Ranking functions of CR f732_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f732_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f726_loop_cont/5 
* CE 446 is refined into CE [1172,1173,1174,1175,1176,1177] 
* CE 445 is refined into CE [1178] 


### Cost equations --> "Loop" of f726_loop_cont/5 
* CEs [1173,1176,1177] --> Loop 1084 
* CEs [1174,1175] --> Loop 1085 
* CEs [1172] --> Loop 1086 
* CEs [1178] --> Loop 1087 

### Ranking functions of CR f726_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f726_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f718_loop_cont/5 
* CE 441 is refined into CE [1179,1180,1181,1182,1183,1184] 
* CE 440 is refined into CE [1185] 


### Cost equations --> "Loop" of f718_loop_cont/5 
* CEs [1180,1183,1184] --> Loop 1088 
* CEs [1181,1182] --> Loop 1089 
* CEs [1179] --> Loop 1090 
* CEs [1185] --> Loop 1091 

### Ranking functions of CR f718_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f718_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f712_loop_cont/5 
* CE 436 is refined into CE [1186,1187,1188,1189,1190,1191] 
* CE 435 is refined into CE [1192] 


### Cost equations --> "Loop" of f712_loop_cont/5 
* CEs [1187,1190,1191] --> Loop 1092 
* CEs [1188,1189] --> Loop 1093 
* CEs [1186] --> Loop 1094 
* CEs [1192] --> Loop 1095 

### Ranking functions of CR f712_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f712_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f706_loop_cont/5 
* CE 431 is refined into CE [1193,1194,1195,1196,1197,1198] 
* CE 430 is refined into CE [1199] 


### Cost equations --> "Loop" of f706_loop_cont/5 
* CEs [1194,1197,1198] --> Loop 1096 
* CEs [1195,1196] --> Loop 1097 
* CEs [1193] --> Loop 1098 
* CEs [1199] --> Loop 1099 

### Ranking functions of CR f706_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f706_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f700_loop_cont/5 
* CE 426 is refined into CE [1200,1201,1202,1203,1204,1205] 
* CE 425 is refined into CE [1206] 


### Cost equations --> "Loop" of f700_loop_cont/5 
* CEs [1201,1204,1205] --> Loop 1100 
* CEs [1202,1203] --> Loop 1101 
* CEs [1200] --> Loop 1102 
* CEs [1206] --> Loop 1103 

### Ranking functions of CR f700_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f700_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f692_loop_cont/5 
* CE 421 is refined into CE [1207,1208,1209,1210,1211,1212] 
* CE 420 is refined into CE [1213] 


### Cost equations --> "Loop" of f692_loop_cont/5 
* CEs [1208,1211,1212] --> Loop 1104 
* CEs [1209,1210] --> Loop 1105 
* CEs [1207] --> Loop 1106 
* CEs [1213] --> Loop 1107 

### Ranking functions of CR f692_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f692_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f686_loop_cont/5 
* CE 416 is refined into CE [1214,1215,1216,1217,1218,1219] 
* CE 415 is refined into CE [1220] 


### Cost equations --> "Loop" of f686_loop_cont/5 
* CEs [1215,1218,1219] --> Loop 1108 
* CEs [1216,1217] --> Loop 1109 
* CEs [1214] --> Loop 1110 
* CEs [1220] --> Loop 1111 

### Ranking functions of CR f686_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f686_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f680_loop_cont/5 
* CE 411 is refined into CE [1221,1222,1223,1224,1225,1226] 
* CE 410 is refined into CE [1227] 


### Cost equations --> "Loop" of f680_loop_cont/5 
* CEs [1222,1225,1226] --> Loop 1112 
* CEs [1223,1224] --> Loop 1113 
* CEs [1221] --> Loop 1114 
* CEs [1227] --> Loop 1115 

### Ranking functions of CR f680_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f680_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f674_loop_cont/5 
* CE 406 is refined into CE [1228,1229,1230,1231,1232,1233] 
* CE 405 is refined into CE [1234] 


### Cost equations --> "Loop" of f674_loop_cont/5 
* CEs [1229,1232,1233] --> Loop 1116 
* CEs [1230,1231] --> Loop 1117 
* CEs [1228] --> Loop 1118 
* CEs [1234] --> Loop 1119 

### Ranking functions of CR f674_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f674_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f666_loop_cont/5 
* CE 401 is refined into CE [1235,1236,1237,1238,1239,1240] 
* CE 400 is refined into CE [1241] 


### Cost equations --> "Loop" of f666_loop_cont/5 
* CEs [1236,1239,1240] --> Loop 1120 
* CEs [1237,1238] --> Loop 1121 
* CEs [1235] --> Loop 1122 
* CEs [1241] --> Loop 1123 

### Ranking functions of CR f666_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f666_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f660_loop_cont/5 
* CE 396 is refined into CE [1242,1243,1244,1245,1246,1247] 
* CE 395 is refined into CE [1248] 


### Cost equations --> "Loop" of f660_loop_cont/5 
* CEs [1243,1246,1247] --> Loop 1124 
* CEs [1244,1245] --> Loop 1125 
* CEs [1242] --> Loop 1126 
* CEs [1248] --> Loop 1127 

### Ranking functions of CR f660_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f660_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f654_loop_cont/5 
* CE 391 is refined into CE [1249,1250,1251,1252,1253,1254] 
* CE 390 is refined into CE [1255] 


### Cost equations --> "Loop" of f654_loop_cont/5 
* CEs [1250,1253,1254] --> Loop 1128 
* CEs [1251,1252] --> Loop 1129 
* CEs [1249] --> Loop 1130 
* CEs [1255] --> Loop 1131 

### Ranking functions of CR f654_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f654_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f648_loop_cont/5 
* CE 386 is refined into CE [1256,1257,1258,1259,1260,1261] 
* CE 385 is refined into CE [1262] 


### Cost equations --> "Loop" of f648_loop_cont/5 
* CEs [1257,1260,1261] --> Loop 1132 
* CEs [1258,1259] --> Loop 1133 
* CEs [1256] --> Loop 1134 
* CEs [1262] --> Loop 1135 

### Ranking functions of CR f648_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f648_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f640_loop_cont/5 
* CE 381 is refined into CE [1263,1264,1265,1266,1267,1268] 
* CE 380 is refined into CE [1269] 


### Cost equations --> "Loop" of f640_loop_cont/5 
* CEs [1264,1267,1268] --> Loop 1136 
* CEs [1265,1266] --> Loop 1137 
* CEs [1263] --> Loop 1138 
* CEs [1269] --> Loop 1139 

### Ranking functions of CR f640_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f640_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f634_loop_cont/5 
* CE 376 is refined into CE [1270,1271,1272,1273,1274,1275] 
* CE 375 is refined into CE [1276] 


### Cost equations --> "Loop" of f634_loop_cont/5 
* CEs [1271,1274,1275] --> Loop 1140 
* CEs [1272,1273] --> Loop 1141 
* CEs [1270] --> Loop 1142 
* CEs [1276] --> Loop 1143 

### Ranking functions of CR f634_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f634_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f628_loop_cont/5 
* CE 371 is refined into CE [1277,1278,1279,1280,1281,1282] 
* CE 370 is refined into CE [1283] 


### Cost equations --> "Loop" of f628_loop_cont/5 
* CEs [1278,1281,1282] --> Loop 1144 
* CEs [1279,1280] --> Loop 1145 
* CEs [1277] --> Loop 1146 
* CEs [1283] --> Loop 1147 

### Ranking functions of CR f628_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f628_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f622_loop_cont/5 
* CE 366 is refined into CE [1284,1285,1286,1287,1288,1289] 
* CE 365 is refined into CE [1290] 


### Cost equations --> "Loop" of f622_loop_cont/5 
* CEs [1285,1288,1289] --> Loop 1148 
* CEs [1286,1287] --> Loop 1149 
* CEs [1284] --> Loop 1150 
* CEs [1290] --> Loop 1151 

### Ranking functions of CR f622_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f622_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f614_loop_cont/5 
* CE 361 is refined into CE [1291,1292,1293,1294,1295,1296] 
* CE 360 is refined into CE [1297] 


### Cost equations --> "Loop" of f614_loop_cont/5 
* CEs [1292,1295,1296] --> Loop 1152 
* CEs [1293,1294] --> Loop 1153 
* CEs [1291] --> Loop 1154 
* CEs [1297] --> Loop 1155 

### Ranking functions of CR f614_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f614_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f608_loop_cont/5 
* CE 356 is refined into CE [1298,1299,1300,1301,1302,1303] 
* CE 355 is refined into CE [1304] 


### Cost equations --> "Loop" of f608_loop_cont/5 
* CEs [1299,1302,1303] --> Loop 1156 
* CEs [1300,1301] --> Loop 1157 
* CEs [1298] --> Loop 1158 
* CEs [1304] --> Loop 1159 

### Ranking functions of CR f608_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f608_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f602_loop_cont/5 
* CE 351 is refined into CE [1305,1306,1307,1308,1309,1310] 
* CE 350 is refined into CE [1311] 


### Cost equations --> "Loop" of f602_loop_cont/5 
* CEs [1306,1309,1310] --> Loop 1160 
* CEs [1307,1308] --> Loop 1161 
* CEs [1305] --> Loop 1162 
* CEs [1311] --> Loop 1163 

### Ranking functions of CR f602_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f602_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f596_loop_cont/5 
* CE 346 is refined into CE [1312,1313,1314,1315,1316,1317] 
* CE 345 is refined into CE [1318] 


### Cost equations --> "Loop" of f596_loop_cont/5 
* CEs [1313,1316,1317] --> Loop 1164 
* CEs [1314,1315] --> Loop 1165 
* CEs [1312] --> Loop 1166 
* CEs [1318] --> Loop 1167 

### Ranking functions of CR f596_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f596_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f588_loop_cont/5 
* CE 341 is refined into CE [1319,1320,1321,1322,1323,1324] 
* CE 340 is refined into CE [1325] 


### Cost equations --> "Loop" of f588_loop_cont/5 
* CEs [1320,1323,1324] --> Loop 1168 
* CEs [1321,1322] --> Loop 1169 
* CEs [1319] --> Loop 1170 
* CEs [1325] --> Loop 1171 

### Ranking functions of CR f588_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f588_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f582_loop_cont/5 
* CE 336 is refined into CE [1326,1327,1328,1329,1330,1331] 
* CE 335 is refined into CE [1332] 


### Cost equations --> "Loop" of f582_loop_cont/5 
* CEs [1327,1330,1331] --> Loop 1172 
* CEs [1328,1329] --> Loop 1173 
* CEs [1326] --> Loop 1174 
* CEs [1332] --> Loop 1175 

### Ranking functions of CR f582_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f582_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f576_loop_cont/5 
* CE 331 is refined into CE [1333,1334,1335,1336,1337,1338] 
* CE 330 is refined into CE [1339] 


### Cost equations --> "Loop" of f576_loop_cont/5 
* CEs [1334,1337,1338] --> Loop 1176 
* CEs [1335,1336] --> Loop 1177 
* CEs [1333] --> Loop 1178 
* CEs [1339] --> Loop 1179 

### Ranking functions of CR f576_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f576_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f570_loop_cont/5 
* CE 326 is refined into CE [1340,1341,1342,1343,1344,1345] 
* CE 325 is refined into CE [1346] 


### Cost equations --> "Loop" of f570_loop_cont/5 
* CEs [1341,1344,1345] --> Loop 1180 
* CEs [1342,1343] --> Loop 1181 
* CEs [1340] --> Loop 1182 
* CEs [1346] --> Loop 1183 

### Ranking functions of CR f570_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f570_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f562_loop_cont/5 
* CE 321 is refined into CE [1347,1348,1349,1350,1351,1352] 
* CE 320 is refined into CE [1353] 


### Cost equations --> "Loop" of f562_loop_cont/5 
* CEs [1348,1351,1352] --> Loop 1184 
* CEs [1349,1350] --> Loop 1185 
* CEs [1347] --> Loop 1186 
* CEs [1353] --> Loop 1187 

### Ranking functions of CR f562_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f562_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f556_loop_cont/5 
* CE 316 is refined into CE [1354,1355,1356,1357,1358,1359] 
* CE 315 is refined into CE [1360] 


### Cost equations --> "Loop" of f556_loop_cont/5 
* CEs [1355,1358,1359] --> Loop 1188 
* CEs [1356,1357] --> Loop 1189 
* CEs [1354] --> Loop 1190 
* CEs [1360] --> Loop 1191 

### Ranking functions of CR f556_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f556_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f550_loop_cont/5 
* CE 311 is refined into CE [1361,1362,1363,1364,1365,1366] 
* CE 310 is refined into CE [1367] 


### Cost equations --> "Loop" of f550_loop_cont/5 
* CEs [1362,1365,1366] --> Loop 1192 
* CEs [1363,1364] --> Loop 1193 
* CEs [1361] --> Loop 1194 
* CEs [1367] --> Loop 1195 

### Ranking functions of CR f550_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f550_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f544_loop_cont/5 
* CE 306 is refined into CE [1368,1369,1370,1371,1372,1373] 
* CE 305 is refined into CE [1374] 


### Cost equations --> "Loop" of f544_loop_cont/5 
* CEs [1369,1372,1373] --> Loop 1196 
* CEs [1370,1371] --> Loop 1197 
* CEs [1368] --> Loop 1198 
* CEs [1374] --> Loop 1199 

### Ranking functions of CR f544_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f544_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f536_loop_cont/5 
* CE 301 is refined into CE [1375,1376,1377,1378,1379,1380] 
* CE 300 is refined into CE [1381] 


### Cost equations --> "Loop" of f536_loop_cont/5 
* CEs [1376,1379,1380] --> Loop 1200 
* CEs [1377,1378] --> Loop 1201 
* CEs [1375] --> Loop 1202 
* CEs [1381] --> Loop 1203 

### Ranking functions of CR f536_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f536_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f530_loop_cont/5 
* CE 296 is refined into CE [1382,1383,1384,1385,1386,1387] 
* CE 295 is refined into CE [1388] 


### Cost equations --> "Loop" of f530_loop_cont/5 
* CEs [1383,1386,1387] --> Loop 1204 
* CEs [1384,1385] --> Loop 1205 
* CEs [1382] --> Loop 1206 
* CEs [1388] --> Loop 1207 

### Ranking functions of CR f530_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f530_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f524_loop_cont/5 
* CE 291 is refined into CE [1389,1390,1391,1392,1393,1394] 
* CE 290 is refined into CE [1395] 


### Cost equations --> "Loop" of f524_loop_cont/5 
* CEs [1390,1393,1394] --> Loop 1208 
* CEs [1391,1392] --> Loop 1209 
* CEs [1389] --> Loop 1210 
* CEs [1395] --> Loop 1211 

### Ranking functions of CR f524_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f524_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f518_loop_cont/5 
* CE 286 is refined into CE [1396,1397,1398,1399,1400,1401] 
* CE 285 is refined into CE [1402] 


### Cost equations --> "Loop" of f518_loop_cont/5 
* CEs [1397,1400,1401] --> Loop 1212 
* CEs [1398,1399] --> Loop 1213 
* CEs [1396] --> Loop 1214 
* CEs [1402] --> Loop 1215 

### Ranking functions of CR f518_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f518_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f510_loop_cont/5 
* CE 281 is refined into CE [1403,1404,1405,1406,1407,1408] 
* CE 280 is refined into CE [1409] 


### Cost equations --> "Loop" of f510_loop_cont/5 
* CEs [1404,1407,1408] --> Loop 1216 
* CEs [1405,1406] --> Loop 1217 
* CEs [1403] --> Loop 1218 
* CEs [1409] --> Loop 1219 

### Ranking functions of CR f510_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f510_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f504_loop_cont/5 
* CE 276 is refined into CE [1410,1411,1412,1413,1414,1415] 
* CE 275 is refined into CE [1416] 


### Cost equations --> "Loop" of f504_loop_cont/5 
* CEs [1411,1414,1415] --> Loop 1220 
* CEs [1412,1413] --> Loop 1221 
* CEs [1410] --> Loop 1222 
* CEs [1416] --> Loop 1223 

### Ranking functions of CR f504_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f504_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f498_loop_cont/5 
* CE 271 is refined into CE [1417,1418,1419,1420,1421,1422] 
* CE 270 is refined into CE [1423] 


### Cost equations --> "Loop" of f498_loop_cont/5 
* CEs [1418,1421,1422] --> Loop 1224 
* CEs [1419,1420] --> Loop 1225 
* CEs [1417] --> Loop 1226 
* CEs [1423] --> Loop 1227 

### Ranking functions of CR f498_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f498_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f492_loop_cont/5 
* CE 266 is refined into CE [1424,1425,1426,1427,1428,1429] 
* CE 265 is refined into CE [1430] 


### Cost equations --> "Loop" of f492_loop_cont/5 
* CEs [1425,1428,1429] --> Loop 1228 
* CEs [1426,1427] --> Loop 1229 
* CEs [1424] --> Loop 1230 
* CEs [1430] --> Loop 1231 

### Ranking functions of CR f492_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f492_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f484_loop_cont/5 
* CE 261 is refined into CE [1431,1432,1433,1434,1435,1436] 
* CE 260 is refined into CE [1437] 


### Cost equations --> "Loop" of f484_loop_cont/5 
* CEs [1432,1435,1436] --> Loop 1232 
* CEs [1433,1434] --> Loop 1233 
* CEs [1431] --> Loop 1234 
* CEs [1437] --> Loop 1235 

### Ranking functions of CR f484_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f484_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f478_loop_cont/5 
* CE 256 is refined into CE [1438,1439,1440,1441,1442,1443] 
* CE 255 is refined into CE [1444] 


### Cost equations --> "Loop" of f478_loop_cont/5 
* CEs [1439,1442,1443] --> Loop 1236 
* CEs [1440,1441] --> Loop 1237 
* CEs [1438] --> Loop 1238 
* CEs [1444] --> Loop 1239 

### Ranking functions of CR f478_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f478_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f472_loop_cont/5 
* CE 251 is refined into CE [1445,1446,1447,1448,1449,1450] 
* CE 250 is refined into CE [1451] 


### Cost equations --> "Loop" of f472_loop_cont/5 
* CEs [1446,1449,1450] --> Loop 1240 
* CEs [1447,1448] --> Loop 1241 
* CEs [1445] --> Loop 1242 
* CEs [1451] --> Loop 1243 

### Ranking functions of CR f472_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f472_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f466_loop_cont/5 
* CE 246 is refined into CE [1452,1453,1454,1455,1456,1457] 
* CE 245 is refined into CE [1458] 


### Cost equations --> "Loop" of f466_loop_cont/5 
* CEs [1453,1456,1457] --> Loop 1244 
* CEs [1454,1455] --> Loop 1245 
* CEs [1452] --> Loop 1246 
* CEs [1458] --> Loop 1247 

### Ranking functions of CR f466_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f466_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f458_loop_cont/5 
* CE 241 is refined into CE [1459,1460,1461,1462,1463,1464] 
* CE 240 is refined into CE [1465] 


### Cost equations --> "Loop" of f458_loop_cont/5 
* CEs [1460,1463,1464] --> Loop 1248 
* CEs [1461,1462] --> Loop 1249 
* CEs [1459] --> Loop 1250 
* CEs [1465] --> Loop 1251 

### Ranking functions of CR f458_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f458_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f452_loop_cont/5 
* CE 236 is refined into CE [1466,1467,1468,1469,1470,1471] 
* CE 235 is refined into CE [1472] 


### Cost equations --> "Loop" of f452_loop_cont/5 
* CEs [1468,1469] --> Loop 1252 
* CEs [1467,1470,1471] --> Loop 1253 
* CEs [1466] --> Loop 1254 
* CEs [1472] --> Loop 1255 

### Ranking functions of CR f452_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f452_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f446_loop_cont/5 
* CE 231 is refined into CE [1473,1474,1475,1476,1477,1478] 
* CE 230 is refined into CE [1479] 


### Cost equations --> "Loop" of f446_loop_cont/5 
* CEs [1475,1476] --> Loop 1256 
* CEs [1474,1477,1478] --> Loop 1257 
* CEs [1473] --> Loop 1258 
* CEs [1479] --> Loop 1259 

### Ranking functions of CR f446_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f446_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f440_loop_cont/5 
* CE 226 is refined into CE [1480,1481,1482,1483,1484,1485] 
* CE 225 is refined into CE [1486] 


### Cost equations --> "Loop" of f440_loop_cont/5 
* CEs [1482,1483] --> Loop 1260 
* CEs [1481,1484,1485] --> Loop 1261 
* CEs [1480] --> Loop 1262 
* CEs [1486] --> Loop 1263 

### Ranking functions of CR f440_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f440_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f432_loop_cont/5 
* CE 221 is refined into CE [1487,1488,1489,1490,1491,1492] 
* CE 220 is refined into CE [1493] 


### Cost equations --> "Loop" of f432_loop_cont/5 
* CEs [1489,1490] --> Loop 1264 
* CEs [1488,1491,1492] --> Loop 1265 
* CEs [1487] --> Loop 1266 
* CEs [1493] --> Loop 1267 

### Ranking functions of CR f432_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f432_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f426_loop_cont/5 
* CE 216 is refined into CE [1494,1495,1496,1497,1498,1499] 
* CE 215 is refined into CE [1500] 


### Cost equations --> "Loop" of f426_loop_cont/5 
* CEs [1496,1497] --> Loop 1268 
* CEs [1495,1498,1499] --> Loop 1269 
* CEs [1494] --> Loop 1270 
* CEs [1500] --> Loop 1271 

### Ranking functions of CR f426_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f426_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f420_loop_cont/5 
* CE 211 is refined into CE [1501,1502,1503,1504,1505,1506] 
* CE 210 is refined into CE [1507] 


### Cost equations --> "Loop" of f420_loop_cont/5 
* CEs [1503,1504] --> Loop 1272 
* CEs [1502,1505,1506] --> Loop 1273 
* CEs [1501] --> Loop 1274 
* CEs [1507] --> Loop 1275 

### Ranking functions of CR f420_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f420_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f414_loop_cont/5 
* CE 206 is refined into CE [1508,1509,1510,1511,1512,1513] 
* CE 205 is refined into CE [1514] 


### Cost equations --> "Loop" of f414_loop_cont/5 
* CEs [1510,1511] --> Loop 1276 
* CEs [1509,1512,1513] --> Loop 1277 
* CEs [1508] --> Loop 1278 
* CEs [1514] --> Loop 1279 

### Ranking functions of CR f414_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f414_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f406_loop_cont/5 
* CE 201 is refined into CE [1515,1516,1517,1518,1519,1520] 
* CE 200 is refined into CE [1521] 


### Cost equations --> "Loop" of f406_loop_cont/5 
* CEs [1517,1518] --> Loop 1280 
* CEs [1516,1519,1520] --> Loop 1281 
* CEs [1515] --> Loop 1282 
* CEs [1521] --> Loop 1283 

### Ranking functions of CR f406_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f406_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f400_loop_cont/5 
* CE 196 is refined into CE [1522,1523,1524,1525,1526,1527] 
* CE 195 is refined into CE [1528] 


### Cost equations --> "Loop" of f400_loop_cont/5 
* CEs [1524,1525] --> Loop 1284 
* CEs [1523,1526,1527] --> Loop 1285 
* CEs [1522] --> Loop 1286 
* CEs [1528] --> Loop 1287 

### Ranking functions of CR f400_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f400_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f394_loop_cont/5 
* CE 191 is refined into CE [1529,1530,1531,1532,1533,1534] 
* CE 190 is refined into CE [1535] 


### Cost equations --> "Loop" of f394_loop_cont/5 
* CEs [1531,1532] --> Loop 1288 
* CEs [1530,1533,1534] --> Loop 1289 
* CEs [1529] --> Loop 1290 
* CEs [1535] --> Loop 1291 

### Ranking functions of CR f394_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f394_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f388_loop_cont/5 
* CE 186 is refined into CE [1536,1537,1538,1539,1540,1541] 
* CE 185 is refined into CE [1542] 


### Cost equations --> "Loop" of f388_loop_cont/5 
* CEs [1538,1539] --> Loop 1292 
* CEs [1537,1540,1541] --> Loop 1293 
* CEs [1536] --> Loop 1294 
* CEs [1542] --> Loop 1295 

### Ranking functions of CR f388_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f388_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f380_loop_cont/5 
* CE 181 is refined into CE [1543,1544,1545,1546,1547,1548] 
* CE 180 is refined into CE [1549] 


### Cost equations --> "Loop" of f380_loop_cont/5 
* CEs [1545,1546] --> Loop 1296 
* CEs [1544,1547,1548] --> Loop 1297 
* CEs [1543] --> Loop 1298 
* CEs [1549] --> Loop 1299 

### Ranking functions of CR f380_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f380_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f374_loop_cont/5 
* CE 176 is refined into CE [1550,1551,1552,1553,1554,1555] 
* CE 175 is refined into CE [1556] 


### Cost equations --> "Loop" of f374_loop_cont/5 
* CEs [1552,1553] --> Loop 1300 
* CEs [1551,1554,1555] --> Loop 1301 
* CEs [1550] --> Loop 1302 
* CEs [1556] --> Loop 1303 

### Ranking functions of CR f374_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f374_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f368_loop_cont/5 
* CE 171 is refined into CE [1557,1558,1559,1560,1561,1562] 
* CE 170 is refined into CE [1563] 


### Cost equations --> "Loop" of f368_loop_cont/5 
* CEs [1559,1560] --> Loop 1304 
* CEs [1558,1561,1562] --> Loop 1305 
* CEs [1557] --> Loop 1306 
* CEs [1563] --> Loop 1307 

### Ranking functions of CR f368_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f368_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f362_loop_cont/5 
* CE 166 is refined into CE [1564,1565,1566,1567,1568,1569] 
* CE 165 is refined into CE [1570] 


### Cost equations --> "Loop" of f362_loop_cont/5 
* CEs [1566,1567] --> Loop 1308 
* CEs [1565,1568,1569] --> Loop 1309 
* CEs [1564] --> Loop 1310 
* CEs [1570] --> Loop 1311 

### Ranking functions of CR f362_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f362_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f354_loop_cont/5 
* CE 161 is refined into CE [1571,1572,1573,1574,1575,1576] 
* CE 160 is refined into CE [1577] 


### Cost equations --> "Loop" of f354_loop_cont/5 
* CEs [1573,1574] --> Loop 1312 
* CEs [1572,1575,1576] --> Loop 1313 
* CEs [1571] --> Loop 1314 
* CEs [1577] --> Loop 1315 

### Ranking functions of CR f354_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f354_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f348_loop_cont/5 
* CE 156 is refined into CE [1578,1579,1580,1581,1582,1583] 
* CE 155 is refined into CE [1584] 


### Cost equations --> "Loop" of f348_loop_cont/5 
* CEs [1580,1581] --> Loop 1316 
* CEs [1579,1582,1583] --> Loop 1317 
* CEs [1578] --> Loop 1318 
* CEs [1584] --> Loop 1319 

### Ranking functions of CR f348_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f348_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f342_loop_cont/5 
* CE 151 is refined into CE [1585,1586,1587,1588,1589,1590] 
* CE 150 is refined into CE [1591] 


### Cost equations --> "Loop" of f342_loop_cont/5 
* CEs [1587,1588] --> Loop 1320 
* CEs [1586,1589,1590] --> Loop 1321 
* CEs [1585] --> Loop 1322 
* CEs [1591] --> Loop 1323 

### Ranking functions of CR f342_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f342_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f336_loop_cont/5 
* CE 146 is refined into CE [1592,1593,1594,1595,1596,1597] 
* CE 145 is refined into CE [1598] 


### Cost equations --> "Loop" of f336_loop_cont/5 
* CEs [1594,1595] --> Loop 1324 
* CEs [1593,1596,1597] --> Loop 1325 
* CEs [1592] --> Loop 1326 
* CEs [1598] --> Loop 1327 

### Ranking functions of CR f336_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f336_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f328_loop_cont/5 
* CE 141 is refined into CE [1599,1600,1601,1602,1603,1604] 
* CE 140 is refined into CE [1605] 


### Cost equations --> "Loop" of f328_loop_cont/5 
* CEs [1601,1602] --> Loop 1328 
* CEs [1600,1603,1604] --> Loop 1329 
* CEs [1599] --> Loop 1330 
* CEs [1605] --> Loop 1331 

### Ranking functions of CR f328_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f328_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f322_loop_cont/5 
* CE 136 is refined into CE [1606,1607,1608,1609,1610,1611] 
* CE 135 is refined into CE [1612] 


### Cost equations --> "Loop" of f322_loop_cont/5 
* CEs [1608,1609] --> Loop 1332 
* CEs [1607,1610,1611] --> Loop 1333 
* CEs [1606] --> Loop 1334 
* CEs [1612] --> Loop 1335 

### Ranking functions of CR f322_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f322_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f316_loop_cont/5 
* CE 131 is refined into CE [1613,1614,1615,1616,1617,1618] 
* CE 130 is refined into CE [1619] 


### Cost equations --> "Loop" of f316_loop_cont/5 
* CEs [1615,1616] --> Loop 1336 
* CEs [1614,1617,1618] --> Loop 1337 
* CEs [1613] --> Loop 1338 
* CEs [1619] --> Loop 1339 

### Ranking functions of CR f316_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f316_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f310_loop_cont/5 
* CE 126 is refined into CE [1620,1621,1622,1623,1624,1625] 
* CE 125 is refined into CE [1626] 


### Cost equations --> "Loop" of f310_loop_cont/5 
* CEs [1622,1623] --> Loop 1340 
* CEs [1621,1624,1625] --> Loop 1341 
* CEs [1620] --> Loop 1342 
* CEs [1626] --> Loop 1343 

### Ranking functions of CR f310_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f310_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f302_loop_cont/5 
* CE 121 is refined into CE [1627,1628,1629,1630,1631,1632] 
* CE 120 is refined into CE [1633] 


### Cost equations --> "Loop" of f302_loop_cont/5 
* CEs [1629,1630] --> Loop 1344 
* CEs [1628,1631,1632] --> Loop 1345 
* CEs [1627] --> Loop 1346 
* CEs [1633] --> Loop 1347 

### Ranking functions of CR f302_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f302_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f296_loop_cont/5 
* CE 116 is refined into CE [1634,1635,1636,1637,1638,1639] 
* CE 115 is refined into CE [1640] 


### Cost equations --> "Loop" of f296_loop_cont/5 
* CEs [1636,1637] --> Loop 1348 
* CEs [1635,1638,1639] --> Loop 1349 
* CEs [1634] --> Loop 1350 
* CEs [1640] --> Loop 1351 

### Ranking functions of CR f296_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f296_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f290_loop_cont/5 
* CE 111 is refined into CE [1641,1642,1643,1644,1645,1646] 
* CE 110 is refined into CE [1647] 


### Cost equations --> "Loop" of f290_loop_cont/5 
* CEs [1643,1644] --> Loop 1352 
* CEs [1642,1645,1646] --> Loop 1353 
* CEs [1641] --> Loop 1354 
* CEs [1647] --> Loop 1355 

### Ranking functions of CR f290_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f290_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f284_loop_cont/5 
* CE 106 is refined into CE [1648,1649,1650,1651,1652,1653] 
* CE 105 is refined into CE [1654] 


### Cost equations --> "Loop" of f284_loop_cont/5 
* CEs [1650,1651] --> Loop 1356 
* CEs [1649,1652,1653] --> Loop 1357 
* CEs [1648] --> Loop 1358 
* CEs [1654] --> Loop 1359 

### Ranking functions of CR f284_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f284_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f276_loop_cont/5 
* CE 101 is refined into CE [1655,1656,1657,1658,1659,1660] 
* CE 100 is refined into CE [1661] 


### Cost equations --> "Loop" of f276_loop_cont/5 
* CEs [1657,1658] --> Loop 1360 
* CEs [1656,1659,1660] --> Loop 1361 
* CEs [1655] --> Loop 1362 
* CEs [1661] --> Loop 1363 

### Ranking functions of CR f276_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f276_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f270_loop_cont/5 
* CE 96 is refined into CE [1662,1663,1664,1665,1666,1667] 
* CE 95 is refined into CE [1668] 


### Cost equations --> "Loop" of f270_loop_cont/5 
* CEs [1664,1665] --> Loop 1364 
* CEs [1663,1666,1667] --> Loop 1365 
* CEs [1662] --> Loop 1366 
* CEs [1668] --> Loop 1367 

### Ranking functions of CR f270_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f270_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f264_loop_cont/5 
* CE 91 is refined into CE [1669,1670,1671,1672,1673,1674] 
* CE 90 is refined into CE [1675] 


### Cost equations --> "Loop" of f264_loop_cont/5 
* CEs [1671,1672] --> Loop 1368 
* CEs [1670,1673,1674] --> Loop 1369 
* CEs [1669] --> Loop 1370 
* CEs [1675] --> Loop 1371 

### Ranking functions of CR f264_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f264_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f258_loop_cont/5 
* CE 86 is refined into CE [1676,1677,1678,1679,1680,1681] 
* CE 85 is refined into CE [1682] 


### Cost equations --> "Loop" of f258_loop_cont/5 
* CEs [1678,1679] --> Loop 1372 
* CEs [1677,1680,1681] --> Loop 1373 
* CEs [1676] --> Loop 1374 
* CEs [1682] --> Loop 1375 

### Ranking functions of CR f258_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f258_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f250_loop_cont/5 
* CE 81 is refined into CE [1683,1684,1685,1686,1687,1688] 
* CE 80 is refined into CE [1689] 


### Cost equations --> "Loop" of f250_loop_cont/5 
* CEs [1685,1686] --> Loop 1376 
* CEs [1684,1687,1688] --> Loop 1377 
* CEs [1683] --> Loop 1378 
* CEs [1689] --> Loop 1379 

### Ranking functions of CR f250_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f250_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f244_loop_cont/5 
* CE 76 is refined into CE [1690,1691,1692,1693,1694,1695] 
* CE 75 is refined into CE [1696] 


### Cost equations --> "Loop" of f244_loop_cont/5 
* CEs [1692,1693] --> Loop 1380 
* CEs [1691,1694,1695] --> Loop 1381 
* CEs [1690] --> Loop 1382 
* CEs [1696] --> Loop 1383 

### Ranking functions of CR f244_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f244_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f238_loop_cont/5 
* CE 71 is refined into CE [1697,1698,1699,1700,1701,1702] 
* CE 70 is refined into CE [1703] 


### Cost equations --> "Loop" of f238_loop_cont/5 
* CEs [1699,1700] --> Loop 1384 
* CEs [1698,1701,1702] --> Loop 1385 
* CEs [1697] --> Loop 1386 
* CEs [1703] --> Loop 1387 

### Ranking functions of CR f238_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f238_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f232_loop_cont/5 
* CE 66 is refined into CE [1704,1705,1706,1707,1708,1709] 
* CE 65 is refined into CE [1710] 


### Cost equations --> "Loop" of f232_loop_cont/5 
* CEs [1706,1707] --> Loop 1388 
* CEs [1705,1708,1709] --> Loop 1389 
* CEs [1704] --> Loop 1390 
* CEs [1710] --> Loop 1391 

### Ranking functions of CR f232_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f232_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f224_loop_cont/5 
* CE 61 is refined into CE [1711,1712,1713,1714,1715,1716] 
* CE 60 is refined into CE [1717] 


### Cost equations --> "Loop" of f224_loop_cont/5 
* CEs [1713,1714] --> Loop 1392 
* CEs [1712,1715,1716] --> Loop 1393 
* CEs [1711] --> Loop 1394 
* CEs [1717] --> Loop 1395 

### Ranking functions of CR f224_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f224_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f218_loop_cont/5 
* CE 56 is refined into CE [1718,1719,1720,1721,1722,1723] 
* CE 55 is refined into CE [1724] 


### Cost equations --> "Loop" of f218_loop_cont/5 
* CEs [1720,1721] --> Loop 1396 
* CEs [1719,1722,1723] --> Loop 1397 
* CEs [1718] --> Loop 1398 
* CEs [1724] --> Loop 1399 

### Ranking functions of CR f218_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f218_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f212_loop_cont/5 
* CE 51 is refined into CE [1725,1726,1727,1728,1729,1730] 
* CE 50 is refined into CE [1731] 


### Cost equations --> "Loop" of f212_loop_cont/5 
* CEs [1727,1728] --> Loop 1400 
* CEs [1726,1729,1730] --> Loop 1401 
* CEs [1725] --> Loop 1402 
* CEs [1731] --> Loop 1403 

### Ranking functions of CR f212_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f212_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f206_loop_cont/5 
* CE 46 is refined into CE [1732,1733,1734,1735,1736,1737] 
* CE 45 is refined into CE [1738] 


### Cost equations --> "Loop" of f206_loop_cont/5 
* CEs [1734,1735] --> Loop 1404 
* CEs [1733,1736,1737] --> Loop 1405 
* CEs [1732] --> Loop 1406 
* CEs [1738] --> Loop 1407 

### Ranking functions of CR f206_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f206_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f198_loop_cont/5 
* CE 41 is refined into CE [1739,1740,1741,1742,1743,1744] 
* CE 40 is refined into CE [1745] 


### Cost equations --> "Loop" of f198_loop_cont/5 
* CEs [1741,1742] --> Loop 1408 
* CEs [1740,1743,1744] --> Loop 1409 
* CEs [1739] --> Loop 1410 
* CEs [1745] --> Loop 1411 

### Ranking functions of CR f198_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f198_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f192_loop_cont/5 
* CE 36 is refined into CE [1746,1747,1748,1749,1750,1751] 
* CE 35 is refined into CE [1752] 


### Cost equations --> "Loop" of f192_loop_cont/5 
* CEs [1748,1749] --> Loop 1412 
* CEs [1747,1750,1751] --> Loop 1413 
* CEs [1746] --> Loop 1414 
* CEs [1752] --> Loop 1415 

### Ranking functions of CR f192_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f192_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f186_loop_cont/5 
* CE 31 is refined into CE [1753,1754,1755,1756,1757,1758] 
* CE 30 is refined into CE [1759] 


### Cost equations --> "Loop" of f186_loop_cont/5 
* CEs [1755,1756] --> Loop 1416 
* CEs [1754,1757,1758] --> Loop 1417 
* CEs [1753] --> Loop 1418 
* CEs [1759] --> Loop 1419 

### Ranking functions of CR f186_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f186_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f180_loop_cont/5 
* CE 26 is refined into CE [1760,1761,1762,1763,1764,1765] 
* CE 25 is refined into CE [1766] 


### Cost equations --> "Loop" of f180_loop_cont/5 
* CEs [1762,1763] --> Loop 1420 
* CEs [1761,1764,1765] --> Loop 1421 
* CEs [1760] --> Loop 1422 
* CEs [1766] --> Loop 1423 

### Ranking functions of CR f180_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f180_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f172_loop_cont/5 
* CE 21 is refined into CE [1767,1768,1769,1770,1771,1772] 
* CE 20 is refined into CE [1773] 


### Cost equations --> "Loop" of f172_loop_cont/5 
* CEs [1769,1770] --> Loop 1424 
* CEs [1768,1771,1772] --> Loop 1425 
* CEs [1767] --> Loop 1426 
* CEs [1773] --> Loop 1427 

### Ranking functions of CR f172_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f172_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f166_loop_cont/5 
* CE 16 is refined into CE [1774,1775,1776,1777,1778,1779] 
* CE 15 is refined into CE [1780] 


### Cost equations --> "Loop" of f166_loop_cont/5 
* CEs [1776,1777] --> Loop 1428 
* CEs [1775,1778,1779] --> Loop 1429 
* CEs [1774] --> Loop 1430 
* CEs [1780] --> Loop 1431 

### Ranking functions of CR f166_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f166_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f160_loop_cont/5 
* CE 11 is refined into CE [1781,1782,1783,1784,1785,1786] 
* CE 10 is refined into CE [1787] 


### Cost equations --> "Loop" of f160_loop_cont/5 
* CEs [1783,1784] --> Loop 1432 
* CEs [1782,1785,1786] --> Loop 1433 
* CEs [1781] --> Loop 1434 
* CEs [1787] --> Loop 1435 

### Ranking functions of CR f160_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f160_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f154_loop_cont/5 
* CE 6 is refined into CE [1788,1789,1790,1791,1792,1793] 
* CE 5 is refined into CE [1794] 


### Cost equations --> "Loop" of f154_loop_cont/5 
* CEs [1790,1791] --> Loop 1436 
* CEs [1789,1792,1793] --> Loop 1437 
* CEs [1788] --> Loop 1438 
* CEs [1794] --> Loop 1439 

### Ranking functions of CR f154_loop_cont(A,B,C,D,E) 

#### Partial ranking functions of CR f154_loop_cont(A,B,C,D,E) 


### Specialization of cost equations f0/4 
* CE 1 is refined into CE [1795,1796,1797,1798] 


### Cost equations --> "Loop" of f0/4 
* CEs [1795,1796,1797,1798] --> Loop 1440 

### Ranking functions of CR f0(A,B,C,D) 

#### Partial ranking functions of CR f0(A,B,C,D) 


Computing Bounds
=====================================

#### Cost of chains of f154(A,C,D,E,F):
* Chain [[602],604]: 1*it(602)+0
  Such that:it(602) =< -C+3

  with precondition: [D=3,2>=C] 

* Chain [[602],603]: 1*it(602)+0
  Such that:it(602) =< -C+3

  with precondition: [D=122,F=0,2>=C] 

* Chain [604]: 0
  with precondition: [D=3] 


#### Cost of chains of f160(A,C,D,E,F):
* Chain [[605],607]: 1*it(605)+0
  Such that:it(605) =< -C+4

  with precondition: [D=3,3>=C] 

* Chain [[605],606]: 1*it(605)+0
  Such that:it(605) =< -C+4

  with precondition: [D=121,F=0,3>=C] 

* Chain [607]: 0
  with precondition: [D=3] 

* Chain [606]: 0
  with precondition: [D=121,F=0,E=A,C>=4] 


#### Cost of chains of f166(A,C,D,E,F):
* Chain [[608],610]: 1*it(608)+0
  Such that:it(608) =< -C+3

  with precondition: [D=3,2>=C] 

* Chain [[608],609]: 1*it(608)+0
  Such that:it(608) =< -C+3

  with precondition: [D=120,F=0,2>=C] 

* Chain [610]: 0
  with precondition: [D=3] 

* Chain [609]: 0
  with precondition: [D=120,F=0,E=A,C>=3] 


#### Cost of chains of f172(A,C,D,E,F):
* Chain [[611],613]: 1*it(611)+0
  Such that:it(611) =< -C+4

  with precondition: [D=3,3>=C] 

* Chain [[611],612]: 1*it(611)+0
  Such that:it(611) =< -C+4

  with precondition: [D=119,F=1,3>=C] 

* Chain [613]: 0
  with precondition: [D=3] 

* Chain [612]: 0
  with precondition: [D=119,F=1,E=A,C>=4] 


#### Cost of chains of f180(A,C,D,E,F):
* Chain [[614],616]: 1*it(614)+0
  Such that:it(614) =< -C+2

  with precondition: [D=3,1>=C] 

* Chain [[614],615]: 1*it(614)+0
  Such that:it(614) =< -C+2

  with precondition: [D=118,F=1,1>=C] 

* Chain [616]: 0
  with precondition: [D=3] 

* Chain [615]: 0
  with precondition: [D=118,F=1,E=A,C>=2] 


#### Cost of chains of f186(A,C,D,E,F):
* Chain [[617],619]: 1*it(617)+0
  Such that:it(617) =< -C+3

  with precondition: [D=3,2>=C] 

* Chain [[617],618]: 1*it(617)+0
  Such that:it(617) =< -C+3

  with precondition: [D=117,F=1,2>=C] 

* Chain [619]: 0
  with precondition: [D=3] 

* Chain [618]: 0
  with precondition: [D=117,F=1,E=A,C>=3] 


#### Cost of chains of f192(A,C,D,E,F):
* Chain [[620],622]: 1*it(620)+0
  Such that:it(620) =< -C+2

  with precondition: [D=3,1>=C] 

* Chain [[620],621]: 1*it(620)+0
  Such that:it(620) =< -C+2

  with precondition: [D=116,F=1,1>=C] 

* Chain [622]: 0
  with precondition: [D=3] 

* Chain [621]: 0
  with precondition: [D=116,F=1,E=A,C>=2] 


#### Cost of chains of f198(A,C,D,E,F):
* Chain [[623],625]: 1*it(623)+0
  Such that:it(623) =< -C+3

  with precondition: [D=3,2>=C] 

* Chain [[623],624]: 1*it(623)+0
  Such that:it(623) =< -C+3

  with precondition: [D=115,F+3=0,2>=C] 

* Chain [625]: 0
  with precondition: [D=3] 

* Chain [624]: 0
  with precondition: [D=115,F+3=0,E=A,C>=3] 


#### Cost of chains of f206(A,C,D,E,F):
* Chain [[626],628]: 1*it(626)+0
  Such that:it(626) =< -C

  with precondition: [D=3,0>=C+3] 

* Chain [[626],627]: 1*it(626)+0
  Such that:it(626) =< A/3+C/3-E/3+1
it(626) =< -C

  with precondition: [D=114,F+3=0,0>=C+3] 

* Chain [628]: 0
  with precondition: [D=3] 

* Chain [627]: 0
  with precondition: [D=114,F+3=0,E=A,C+2>=0] 


#### Cost of chains of f212(A,C,D,E,F):
* Chain [[629],631]: 1*it(629)+0
  Such that:it(629) =< -C

  with precondition: [D=3,0>=C+2] 

* Chain [[629],630]: 1*it(629)+0
  Such that:it(629) =< A/2+C/2-E/2+1
it(629) =< -C

  with precondition: [D=113,F+3=0,0>=C+2] 

* Chain [631]: 0
  with precondition: [D=3] 

* Chain [630]: 0
  with precondition: [D=113,F+3=0,E=A,C+1>=0] 


#### Cost of chains of f218(A,C,D,E,F):
* Chain [[632],634]: 1*it(632)+0
  Such that:it(632) =< -C

  with precondition: [D=3,0>=C+3] 

* Chain [[632],633]: 1*it(632)+0
  Such that:it(632) =< A/3+C/3-E/3+1
it(632) =< -C

  with precondition: [D=112,F+3=0,0>=C+3] 

* Chain [634]: 0
  with precondition: [D=3] 

* Chain [633]: 0
  with precondition: [D=112,F+3=0,E=A,C+2>=0] 


#### Cost of chains of f224(A,C,D,E,F):
* Chain [[635],637]: 1*it(635)+0
  Such that:it(635) =< -C

  with precondition: [D=3,0>=C+2] 

* Chain [[635],636]: 1*it(635)+0
  Such that:it(635) =< A/2+C/2-E/2+1
it(635) =< -C

  with precondition: [D=111,F+4=0,0>=C+2] 

* Chain [637]: 0
  with precondition: [D=3] 

* Chain [636]: 0
  with precondition: [D=111,F+4=0,E=A,C+1>=0] 


#### Cost of chains of f232(A,C,D,E,F):
* Chain [[638],640]: 1*it(638)+0
  Such that:it(638) =< -C

  with precondition: [D=3,0>=C+2] 

* Chain [[638],639]: 1*it(638)+0
  Such that:it(638) =< A/2+C/2-E/2+1
it(638) =< -C

  with precondition: [D=110,F+4=0,0>=C+2] 

* Chain [640]: 0
  with precondition: [D=3] 

* Chain [639]: 0
  with precondition: [D=110,F+4=0,E=A,C+1>=0] 


#### Cost of chains of f238(A,C,D,E,F):
* Chain [[641],643]: 1*it(641)+0
  Such that:it(641) =< -C

  with precondition: [D=3,0>=C+1] 

* Chain [[641],642]: 1*it(641)+0
  Such that:it(641) =< -C

  with precondition: [D=109,F+4=0,0>=C+1] 

* Chain [643]: 0
  with precondition: [D=3] 

* Chain [642]: 0
  with precondition: [D=109,F+4=0,E=A,C>=0] 


#### Cost of chains of f244(A,C,D,E,F):
* Chain [[644],646]: 1*it(644)+0
  Such that:it(644) =< -C

  with precondition: [D=3,0>=C+2] 

* Chain [[644],645]: 1*it(644)+0
  Such that:it(644) =< A/2+C/2-E/2+1
it(644) =< -C

  with precondition: [D=108,F+4=0,0>=C+2] 

* Chain [646]: 0
  with precondition: [D=3] 

* Chain [645]: 0
  with precondition: [D=108,F+4=0,E=A,C+1>=0] 


#### Cost of chains of f250(A,C,D,E,F):
* Chain [[647],649]: 1*it(647)+0
  Such that:it(647) =< -C

  with precondition: [D=3,0>=C+1] 

* Chain [[647],648]: 1*it(647)+0
  Such that:it(647) =< -C

  with precondition: [D=107,F+5=0,0>=C+1] 

* Chain [649]: 0
  with precondition: [D=3] 

* Chain [648]: 0
  with precondition: [D=107,F+5=0,E=A,C>=0] 


#### Cost of chains of f258(A,C,D,E,F):
* Chain [[650],652]: 1*it(650)+0
  Such that:it(650) =< -C

  with precondition: [D=3,0>=C+1] 

* Chain [[650],651]: 1*it(650)+0
  Such that:it(650) =< -C

  with precondition: [D=106,F+5=0,0>=C+1] 

* Chain [652]: 0
  with precondition: [D=3] 

* Chain [651]: 0
  with precondition: [D=106,F+5=0,E=A,C>=0] 


#### Cost of chains of f264(A,C,D,E,F):
* Chain [[653],655]: 1*it(653)+0
  Such that:it(653) =< -C+1

  with precondition: [D=3,0>=C] 

* Chain [[653],654]: 1*it(653)+0
  Such that:it(653) =< -C+1

  with precondition: [D=105,F+5=0,0>=C] 

* Chain [655]: 0
  with precondition: [D=3] 

* Chain [654]: 0
  with precondition: [D=105,F+5=0,E=A,C>=1] 


#### Cost of chains of f270(A,C,D,E,F):
* Chain [[656],658]: 1*it(656)+0
  Such that:it(656) =< -C

  with precondition: [D=3,0>=C+1] 

* Chain [[656],657]: 1*it(656)+0
  Such that:it(656) =< -C

  with precondition: [D=104,F+5=0,0>=C+1] 

* Chain [658]: 0
  with precondition: [D=3] 

* Chain [657]: 0
  with precondition: [D=104,F+5=0,E=A,C>=0] 


#### Cost of chains of f276(A,C,D,E,F):
* Chain [[659],661]: 1*it(659)+0
  Such that:it(659) =< -C+1

  with precondition: [D=3,0>=C] 

* Chain [[659],660]: 1*it(659)+0
  Such that:it(659) =< -C+1

  with precondition: [D=103,F+6=0,0>=C] 

* Chain [661]: 0
  with precondition: [D=3] 

* Chain [660]: 0
  with precondition: [D=103,F+6=0,E=A,C>=1] 


#### Cost of chains of f284(A,C,D,E,F):
* Chain [[662],664]: 1*it(662)+0
  Such that:it(662) =< -C+4

  with precondition: [D=3,3>=C] 

* Chain [[662],663]: 1*it(662)+0
  Such that:it(662) =< -C+4

  with precondition: [D=102,F+6=0,3>=C] 

* Chain [664]: 0
  with precondition: [D=3] 

* Chain [663]: 0
  with precondition: [D=102,F+6=0,E=A,C>=4] 


#### Cost of chains of f290(A,C,D,E,F):
* Chain [[665],667]: 1*it(665)+0
  Such that:it(665) =< -C+5

  with precondition: [D=3,4>=C] 

* Chain [[665],666]: 1*it(665)+0
  Such that:it(665) =< -C+5

  with precondition: [D=101,F+6=0,4>=C] 

* Chain [667]: 0
  with precondition: [D=3] 

* Chain [666]: 0
  with precondition: [D=101,F+6=0,E=A,C>=5] 


#### Cost of chains of f296(A,C,D,E,F):
* Chain [[668],670]: 1*it(668)+0
  Such that:it(668) =< -C+4

  with precondition: [D=3,3>=C] 

* Chain [[668],669]: 1*it(668)+0
  Such that:it(668) =< -C+4

  with precondition: [D=100,F+6=0,3>=C] 

* Chain [670]: 0
  with precondition: [D=3] 

* Chain [669]: 0
  with precondition: [D=100,F+6=0,E=A,C>=4] 


#### Cost of chains of f302(A,C,D,E,F):
* Chain [[671],673]: 1*it(671)+0
  Such that:it(671) =< -C+5

  with precondition: [D=3,4>=C] 

* Chain [[671],672]: 1*it(671)+0
  Such that:it(671) =< -C+5

  with precondition: [D=99,F=0,4>=C] 

* Chain [673]: 0
  with precondition: [D=3] 

* Chain [672]: 0
  with precondition: [D=99,F=0,E=A,C>=5] 


#### Cost of chains of f310(A,B,C,D,E,F):
* Chain [[674],676]: 1*it(674)+0
  Such that:it(674) =< -C+3

  with precondition: [B=2,D=3,2>=C] 

* Chain [[674],675]: 1*it(674)+0
  Such that:it(674) =< -C+3

  with precondition: [B=2,D=98,F=0,2>=C] 

* Chain [676]: 0
  with precondition: [B=2,D=3] 

* Chain [675]: 0
  with precondition: [B=2,D=98,F=0,E=A,C>=3] 


#### Cost of chains of f316(A,B,C,D,E,F):
* Chain [[677],679]: 1*it(677)+0
  Such that:it(677) =< -C/2+2

  with precondition: [B=2,D=3,3>=C] 

* Chain [[677],678]: 1*it(677)+0
  Such that:it(677) =< -C/2+2

  with precondition: [B=2,D=97,F=0,3>=C] 

* Chain [679]: 0
  with precondition: [B=2,D=3] 

* Chain [678]: 0
  with precondition: [B=2,D=97,F=0,E=A,C>=4] 


#### Cost of chains of f322(A,B,C,D,E,F):
* Chain [[680],682]: 1*it(680)+0
  Such that:it(680) =< -C+3

  with precondition: [B=2,D=3,2>=C] 

* Chain [[680],681]: 1*it(680)+0
  Such that:it(680) =< -C+3

  with precondition: [B=2,D=96,F=0,2>=C] 

* Chain [682]: 0
  with precondition: [B=2,D=3] 

* Chain [681]: 0
  with precondition: [B=2,D=96,F=0,E=A,C>=3] 


#### Cost of chains of f328(A,B,C,D,E,F):
* Chain [[683],685]: 1*it(683)+0
  Such that:it(683) =< -C/2+2

  with precondition: [B=2,D=3,3>=C] 

* Chain [[683],684]: 1*it(683)+0
  Such that:it(683) =< -C/2+2

  with precondition: [B=2,D=95,F=1,3>=C] 

* Chain [685]: 0
  with precondition: [B=2,D=3] 

* Chain [684]: 0
  with precondition: [B=2,D=95,F=1,E=A,C>=4] 


#### Cost of chains of f336(A,B,C,D,E,F):
* Chain [[686],688]: 1*it(686)+0
  Such that:it(686) =< -C/2+1

  with precondition: [B=2,D=3,1>=C] 

* Chain [[686],687]: 1*it(686)+0
  Such that:it(686) =< -C/2+1

  with precondition: [B=2,D=94,F=1,1>=C] 

* Chain [688]: 0
  with precondition: [B=2,D=3] 

* Chain [687]: 0
  with precondition: [B=2,D=94,F=1,E=A,C>=2] 


#### Cost of chains of f342(A,B,C,D,E,F):
* Chain [[689],691]: 1*it(689)+0
  Such that:it(689) =< -C+3

  with precondition: [B=2,D=3,2>=C] 

* Chain [[689],690]: 1*it(689)+0
  Such that:it(689) =< -C+3

  with precondition: [B=2,D=93,F=1,2>=C] 

* Chain [691]: 0
  with precondition: [B=2,D=3] 

* Chain [690]: 0
  with precondition: [B=2,D=93,F=1,E=A,C>=3] 


#### Cost of chains of f348(A,B,C,D,E,F):
* Chain [[692],694]: 1*it(692)+0
  Such that:it(692) =< -C/2+1

  with precondition: [B=2,D=3,1>=C] 

* Chain [[692],693]: 1*it(692)+0
  Such that:it(692) =< -C/2+1

  with precondition: [B=2,D=92,F=1,1>=C] 

* Chain [694]: 0
  with precondition: [B=2,D=3] 

* Chain [693]: 0
  with precondition: [B=2,D=92,F=1,E=A,C>=2] 


#### Cost of chains of f354(A,B,C,D,E,F):
* Chain [[695],697]: 1*it(695)+0
  Such that:it(695) =< -C+3

  with precondition: [B=2,D=3,2>=C] 

* Chain [[695],696]: 1*it(695)+0
  Such that:it(695) =< -C+3

  with precondition: [B=2,D=91,F+3=0,2>=C] 

* Chain [697]: 0
  with precondition: [B=2,D=3] 

* Chain [696]: 0
  with precondition: [B=2,D=91,F+3=0,E=A,C>=3] 


#### Cost of chains of f362(A,B,C,D,E,F):
* Chain [[698],700]: 1*it(698)+0
  Such that:it(698) =< -C/2

  with precondition: [B=2,D=3,0>=C+3] 

* Chain [[698],699]: 1*it(698)+0
  Such that:it(698) =< A/3+C/3-E/3+1
it(698) =< -C/2

  with precondition: [B=2,D=90,F+3=0,0>=C+3,A+C>=E,A+3*C+8>=E] 

* Chain [700]: 0
  with precondition: [B=2,D=3] 

* Chain [699]: 0
  with precondition: [B=2,D=90,F+3=0,E=A,C+2>=0] 


#### Cost of chains of f368(A,B,C,D,E,F):
* Chain [[701],703]: 1*it(701)+0
  Such that:it(701) =< -C

  with precondition: [B=2,D=3,0>=C+2] 

* Chain [[701],702]: 1*it(701)+0
  Such that:it(701) =< A+C-E+2
it(701) =< -C

  with precondition: [B=2,D=89,F+3=0,0>=C+2,2*A+5*C+9>=2*E,A+C>=E] 

* Chain [703]: 0
  with precondition: [B=2,D=3] 

* Chain [702]: 0
  with precondition: [B=2,D=89,F+3=0,E=A,C+1>=0] 


#### Cost of chains of f374(A,B,C,D,E,F):
* Chain [[704],706]: 1*it(704)+0
  Such that:it(704) =< -C/2

  with precondition: [B=2,D=3,0>=C+3] 

* Chain [[704],705]: 1*it(704)+0
  Such that:it(704) =< A/3+C/3-E/3+1
it(704) =< -C/2

  with precondition: [B=2,D=88,F+3=0,0>=C+3,A+C>=E,A+3*C+8>=E] 

* Chain [706]: 0
  with precondition: [B=2,D=3] 

* Chain [705]: 0
  with precondition: [B=2,D=88,F+3=0,E=A,C+2>=0] 


#### Cost of chains of f380(A,B,C,D,E,F):
* Chain [[707],709]: 1*it(707)+0
  Such that:it(707) =< -C

  with precondition: [B=2,D=3,0>=C+2] 

* Chain [[707],708]: 1*it(707)+0
  Such that:it(707) =< A+C-E+2
it(707) =< -C

  with precondition: [B=2,D=87,F+4=0,0>=C+2,2*A+5*C+9>=2*E,A+C>=E] 

* Chain [709]: 0
  with precondition: [B=2,D=3] 

* Chain [708]: 0
  with precondition: [B=2,D=87,F+4=0,E=A,C+1>=0] 


#### Cost of chains of f388(A,B,C,D,E,F):
* Chain [[710],712]: 1*it(710)+0
  Such that:it(710) =< -C

  with precondition: [B=2,D=3,0>=C+2] 

* Chain [[710],711]: 1*it(710)+0
  Such that:it(710) =< A+C-E+2
it(710) =< -C

  with precondition: [B=2,D=86,F+4=0,0>=C+2,2*A+5*C+9>=2*E,A+C>=E] 

* Chain [712]: 0
  with precondition: [B=2,D=3] 

* Chain [711]: 0
  with precondition: [B=2,D=86,F+4=0,E=A,C+1>=0] 


#### Cost of chains of f394(A,B,C,D,E,F):
* Chain [[713],715]: 1*it(713)+0
  Such that:it(713) =< -C/2

  with precondition: [B=2,D=3,0>=C+1] 

* Chain [[713],714]: 1*it(713)+0
  Such that:it(713) =< -C/2

  with precondition: [B=2,D=85,F+4=0,0>=C+1] 

* Chain [715]: 0
  with precondition: [B=2,D=3] 

* Chain [714]: 0
  with precondition: [B=2,D=85,F+4=0,E=A,C>=0] 


#### Cost of chains of f400(A,B,C,D,E,F):
* Chain [[716],718]: 1*it(716)+0
  Such that:it(716) =< -C

  with precondition: [B=2,D=3,0>=C+2] 

* Chain [[716],717]: 1*it(716)+0
  Such that:it(716) =< A+C-E+2
it(716) =< -C

  with precondition: [B=2,D=84,F+4=0,0>=C+2,2*A+5*C+9>=2*E,A+C>=E] 

* Chain [718]: 0
  with precondition: [B=2,D=3] 

* Chain [717]: 0
  with precondition: [B=2,D=84,F+4=0,E=A,C+1>=0] 


#### Cost of chains of f406(A,B,C,D,E,F):
* Chain [[719],721]: 1*it(719)+0
  Such that:it(719) =< -C/2

  with precondition: [B=2,D=3,0>=C+1] 

* Chain [[719],720]: 1*it(719)+0
  Such that:it(719) =< -C/2

  with precondition: [B=2,D=83,F+5=0,0>=C+1] 

* Chain [721]: 0
  with precondition: [B=2,D=3] 

* Chain [720]: 0
  with precondition: [B=2,D=83,F+5=0,E=A,C>=0] 


#### Cost of chains of f414(A,B,C,D,E,F):
* Chain [[722],724]: 1*it(722)+0
  Such that:it(722) =< -C/2

  with precondition: [B=2,D=3,0>=C+1] 

* Chain [[722],723]: 1*it(722)+0
  Such that:it(722) =< -C/2

  with precondition: [B=2,D=82,F+5=0,0>=C+1] 

* Chain [724]: 0
  with precondition: [B=2,D=3] 

* Chain [723]: 0
  with precondition: [B=2,D=82,F+5=0,E=A,C>=0] 


#### Cost of chains of f420(A,B,C,D,E,F):
* Chain [[725],727]: 1*it(725)+0
  Such that:it(725) =< -C+1

  with precondition: [B=2,D=3,0>=C] 

* Chain [[725],726]: 1*it(725)+0
  Such that:it(725) =< -C+1

  with precondition: [B=2,D=81,F+5=0,0>=C] 

* Chain [727]: 0
  with precondition: [B=2,D=3] 

* Chain [726]: 0
  with precondition: [B=2,D=81,F+5=0,E=A,C>=1] 


#### Cost of chains of f426(A,B,C,D,E,F):
* Chain [[728],730]: 1*it(728)+0
  Such that:it(728) =< -C/2

  with precondition: [B=2,D=3,0>=C+1] 

* Chain [[728],729]: 1*it(728)+0
  Such that:it(728) =< -C/2

  with precondition: [B=2,D=80,F+5=0,0>=C+1] 

* Chain [730]: 0
  with precondition: [B=2,D=3] 

* Chain [729]: 0
  with precondition: [B=2,D=80,F+5=0,E=A,C>=0] 


#### Cost of chains of f432(A,B,C,D,E,F):
* Chain [[731],733]: 1*it(731)+0
  Such that:it(731) =< -C+1

  with precondition: [B=2,D=3,0>=C] 

* Chain [[731],732]: 1*it(731)+0
  Such that:it(731) =< -C+1

  with precondition: [B=2,D=79,F+6=0,0>=C] 

* Chain [733]: 0
  with precondition: [B=2,D=3] 

* Chain [732]: 0
  with precondition: [B=2,D=79,F+6=0,E=A,C>=1] 


#### Cost of chains of f440(A,B,C,D,E,F):
* Chain [[734],736]: 1*it(734)+0
  Such that:it(734) =< -C/2+2

  with precondition: [B=2,D=3,3>=C] 

* Chain [[734],735]: 1*it(734)+0
  Such that:it(734) =< -C/2+2

  with precondition: [B=2,D=78,F+6=0,3>=C] 

* Chain [736]: 0
  with precondition: [B=2,D=3] 

* Chain [735]: 0
  with precondition: [B=2,D=78,F+6=0,E=A,C>=4] 


#### Cost of chains of f446(A,B,C,D,E,F):
* Chain [[737],739]: 1*it(737)+0
  Such that:it(737) =< -C+5

  with precondition: [B=2,D=3,4>=C] 

* Chain [[737],738]: 1*it(737)+0
  Such that:it(737) =< -C+5

  with precondition: [B=2,D=77,F+6=0,4>=C] 

* Chain [739]: 0
  with precondition: [B=2,D=3] 

* Chain [738]: 0
  with precondition: [B=2,D=77,F+6=0,E=A,C>=5] 


#### Cost of chains of f452(A,B,C,D,E,F):
* Chain [[740],742]: 1*it(740)+0
  Such that:it(740) =< -C/2+2

  with precondition: [B=2,D=3,3>=C] 

* Chain [[740],741]: 1*it(740)+0
  Such that:it(740) =< -C/2+2

  with precondition: [B=2,D=76,F+6=0,3>=C] 

* Chain [742]: 0
  with precondition: [B=2,D=3] 

* Chain [741]: 0
  with precondition: [B=2,D=76,F+6=0,E=A,C>=4] 


#### Cost of chains of f458(A,B,C,D,E,F):
* Chain [[743],745]: 1*it(743)+0
  Such that:it(743) =< -C+5

  with precondition: [B=2,D=3,4>=C] 

* Chain [[743],744]: 1*it(743)+0
  Such that:it(743) =< -C+5

  with precondition: [B=2,D=75,F=5,4>=C] 

* Chain [745]: 0
  with precondition: [B=2,D=3] 

* Chain [744]: 0
  with precondition: [B=2,D=75,F=5,E=A,C>=5] 


#### Cost of chains of f466(A,C,D,E,F):
* Chain [[746],748]: 1*it(746)+0
  Such that:it(746) =< C

  with precondition: [D=3,C>=3] 

* Chain [[746],747]: 1*it(746)+0
  Such that:it(746) =< -A/3-C/3+E/3+1
it(746) =< C

  with precondition: [D=74,F=5,C>=3] 

* Chain [748]: 0
  with precondition: [D=3] 

* Chain [747]: 0
  with precondition: [D=74,F=5,E=A,2>=C] 


#### Cost of chains of f472(A,C,D,E,F):
* Chain [[749],751]: 1*it(749)+0
  Such that:it(749) =< C

  with precondition: [D=3,C>=2] 

* Chain [[749],750]: 1*it(749)+0
  Such that:it(749) =< -A/2-C/2+E/2+1
it(749) =< C

  with precondition: [D=73,F=5,C>=2] 

* Chain [751]: 0
  with precondition: [D=3] 

* Chain [750]: 0
  with precondition: [D=73,F=5,E=A,1>=C] 


#### Cost of chains of f478(A,C,D,E,F):
* Chain [[752],754]: 1*it(752)+0
  Such that:it(752) =< C

  with precondition: [D=3,C>=3] 

* Chain [[752],753]: 1*it(752)+0
  Such that:it(752) =< -A/3-C/3+E/3+1
it(752) =< C

  with precondition: [D=72,F=5,C>=3] 

* Chain [754]: 0
  with precondition: [D=3] 

* Chain [753]: 0
  with precondition: [D=72,F=5,E=A,2>=C] 


#### Cost of chains of f484(A,C,D,E,F):
* Chain [[755],757]: 1*it(755)+0
  Such that:it(755) =< C

  with precondition: [D=3,C>=2] 

* Chain [[755],756]: 1*it(755)+0
  Such that:it(755) =< -A/2-C/2+E/2+1
it(755) =< C

  with precondition: [D=71,F=6,C>=2] 

* Chain [757]: 0
  with precondition: [D=3] 

* Chain [756]: 0
  with precondition: [D=71,F=6,E=A,1>=C] 


#### Cost of chains of f492(A,C,D,E,F):
* Chain [[758],760]: 1*it(758)+0
  Such that:it(758) =< C

  with precondition: [D=3,C>=2] 

* Chain [[758],759]: 1*it(758)+0
  Such that:it(758) =< -A/2-C/2+E/2+1
it(758) =< C

  with precondition: [D=70,F=6,C>=2] 

* Chain [760]: 0
  with precondition: [D=3] 

* Chain [759]: 0
  with precondition: [D=70,F=6,E=A,1>=C] 


#### Cost of chains of f498(A,C,D,E,F):
* Chain [[761],763]: 1*it(761)+0
  Such that:it(761) =< C

  with precondition: [D=3,C>=1] 

* Chain [[761],762]: 1*it(761)+0
  Such that:it(761) =< C

  with precondition: [D=69,F=6,C>=1] 

* Chain [763]: 0
  with precondition: [D=3] 

* Chain [762]: 0
  with precondition: [D=69,F=6,E=A,0>=C] 


#### Cost of chains of f504(A,C,D,E,F):
* Chain [[764],766]: 1*it(764)+0
  Such that:it(764) =< C

  with precondition: [D=3,C>=2] 

* Chain [[764],765]: 1*it(764)+0
  Such that:it(764) =< -A/2-C/2+E/2+1
it(764) =< C

  with precondition: [D=68,F=6,C>=2] 

* Chain [766]: 0
  with precondition: [D=3] 

* Chain [765]: 0
  with precondition: [D=68,F=6,E=A,1>=C] 


#### Cost of chains of f510(A,C,D,E,F):
* Chain [[767],769]: 1*it(767)+0
  Such that:it(767) =< C

  with precondition: [D=3,C>=1] 

* Chain [[767],768]: 1*it(767)+0
  Such that:it(767) =< C

  with precondition: [D=67,F=7,C>=1] 

* Chain [769]: 0
  with precondition: [D=3] 

* Chain [768]: 0
  with precondition: [D=67,F=7,E=A,0>=C] 


#### Cost of chains of f518(A,C,D,E,F):
* Chain [[770],772]: 1*it(770)+0
  Such that:it(770) =< C

  with precondition: [D=3,C>=1] 

* Chain [[770],771]: 1*it(770)+0
  Such that:it(770) =< C

  with precondition: [D=66,F=7,C>=1] 

* Chain [772]: 0
  with precondition: [D=3] 

* Chain [771]: 0
  with precondition: [D=66,F=7,E=A,0>=C] 


#### Cost of chains of f524(A,C,D,E,F):
* Chain [[773],775]: 1*it(773)+0
  Such that:it(773) =< C+1

  with precondition: [D=3,C>=0] 

* Chain [[773],774]: 1*it(773)+0
  Such that:it(773) =< C+1

  with precondition: [D=65,F=7,C>=0] 

* Chain [775]: 0
  with precondition: [D=3] 

* Chain [774]: 0
  with precondition: [D=65,F=7,E=A,0>=C+1] 


#### Cost of chains of f530(A,C,D,E,F):
* Chain [[776],778]: 1*it(776)+0
  Such that:it(776) =< C

  with precondition: [D=3,C>=1] 

* Chain [[776],777]: 1*it(776)+0
  Such that:it(776) =< C

  with precondition: [D=64,F=7,C>=1] 

* Chain [778]: 0
  with precondition: [D=3] 

* Chain [777]: 0
  with precondition: [D=64,F=7,E=A,0>=C] 


#### Cost of chains of f536(A,C,D,E,F):
* Chain [[779],781]: 1*it(779)+0
  Such that:it(779) =< C+1

  with precondition: [D=3,C>=0] 

* Chain [[779],780]: 1*it(779)+0
  Such that:it(779) =< C+1

  with precondition: [D=63,F=8,C>=0] 

* Chain [781]: 0
  with precondition: [D=3] 

* Chain [780]: 0
  with precondition: [D=63,F=8,E=A,0>=C+1] 


#### Cost of chains of f544(A,C,D,E,F):
* Chain [[782],784]: 1*it(782)+0
  Such that:it(782) =< C+1

  with precondition: [D=3,C>=0] 

* Chain [[782],783]: 1*it(782)+0
  Such that:it(782) =< C+1

  with precondition: [D=62,F=8,C>=0] 

* Chain [784]: 0
  with precondition: [D=3] 

* Chain [783]: 0
  with precondition: [D=62,F=8,E=A,0>=C+1] 


#### Cost of chains of f550(A,C,D,E,F):
* Chain [[785],787]: 1*it(785)+0
  Such that:it(785) =< C+2

  with precondition: [D=3,C+1>=0] 

* Chain [[785],786]: 1*it(785)+0
  Such that:it(785) =< C+2

  with precondition: [D=61,F=8,C+1>=0] 

* Chain [787]: 0
  with precondition: [D=3] 

* Chain [786]: 0
  with precondition: [D=61,F=8,E=A,0>=C+2] 


#### Cost of chains of f556(A,C,D,E,F):
* Chain [[788],790]: 1*it(788)+0
  Such that:it(788) =< C+1

  with precondition: [D=3,C>=0] 

* Chain [[788],789]: 1*it(788)+0
  Such that:it(788) =< C+1

  with precondition: [D=60,F=8,C>=0] 

* Chain [790]: 0
  with precondition: [D=3] 

* Chain [789]: 0
  with precondition: [D=60,F=8,E=A,0>=C+1] 


#### Cost of chains of f562(A,C,D,E,F):
* Chain [[791],793]: 1*it(791)+0
  Such that:it(791) =< C+2

  with precondition: [D=3,C+1>=0] 

* Chain [[791],792]: 1*it(791)+0
  Such that:it(791) =< C+2

  with precondition: [D=59,F=9,C+1>=0] 

* Chain [793]: 0
  with precondition: [D=3] 

* Chain [792]: 0
  with precondition: [D=59,F=9,E=A,0>=C+2] 


#### Cost of chains of f570(A,C,D,E,F):
* Chain [[794],796]: 1*it(794)+0
  Such that:it(794) =< C+2

  with precondition: [D=3,C+1>=0] 

* Chain [[794],795]: 1*it(794)+0
  Such that:it(794) =< C+2

  with precondition: [D=58,F=9,C+1>=0] 

* Chain [796]: 0
  with precondition: [D=3] 

* Chain [795]: 0
  with precondition: [D=58,F=9,E=A,0>=C+2] 


#### Cost of chains of f576(A,C,D,E,F):
* Chain [[797],799]: 1*it(797)+0
  Such that:it(797) =< C+3

  with precondition: [D=3,C+2>=0] 

* Chain [[797],798]: 1*it(797)+0
  Such that:it(797) =< C+3

  with precondition: [D=57,F=9,C+2>=0] 

* Chain [799]: 0
  with precondition: [D=3] 

* Chain [798]: 0
  with precondition: [D=57,F=9,E=A,0>=C+3] 


#### Cost of chains of f582(A,C,D,E,F):
* Chain [[800],802]: 1*it(800)+0
  Such that:it(800) =< C+2

  with precondition: [D=3,C+1>=0] 

* Chain [[800],801]: 1*it(800)+0
  Such that:it(800) =< C+2

  with precondition: [D=56,F=9,C+1>=0] 

* Chain [802]: 0
  with precondition: [D=3] 

* Chain [801]: 0
  with precondition: [D=56,F=9,E=A,0>=C+2] 


#### Cost of chains of f588(A,C,D,E,F):
* Chain [[803],805]: 1*it(803)+0
  Such that:it(803) =< C+3

  with precondition: [D=3,C+2>=0] 

* Chain [[803],804]: 1*it(803)+0
  Such that:it(803) =< C+3

  with precondition: [D=55,F=0,C+2>=0] 

* Chain [805]: 0
  with precondition: [D=3] 

* Chain [804]: 0
  with precondition: [D=55,F=0,E=A,0>=C+3] 


#### Cost of chains of f596(A,C,D,E,F):
* Chain [[806],808]: 1*it(806)+0
  Such that:it(806) =< C+3

  with precondition: [D=3,C+2>=0] 

* Chain [[806],807]: 1*it(806)+0
  Such that:it(806) =< C+3

  with precondition: [D=54,F=0,C+2>=0] 

* Chain [808]: 0
  with precondition: [D=3] 

* Chain [807]: 0
  with precondition: [D=54,F=0,E=A,0>=C+3] 


#### Cost of chains of f602(A,C,D,E,F):
* Chain [[809],811]: 1*it(809)+0
  Such that:it(809) =< C+4

  with precondition: [D=3,C+3>=0] 

* Chain [[809],810]: 1*it(809)+0
  Such that:it(809) =< C+4

  with precondition: [D=53,F=0,C+3>=0] 

* Chain [811]: 0
  with precondition: [D=3] 

* Chain [810]: 0
  with precondition: [D=53,F=0,E=A,0>=C+4] 


#### Cost of chains of f608(A,C,D,E,F):
* Chain [[812],814]: 1*it(812)+0
  Such that:it(812) =< C+3

  with precondition: [D=3,C+2>=0] 

* Chain [[812],813]: 1*it(812)+0
  Such that:it(812) =< C+3

  with precondition: [D=52,F=0,C+2>=0] 

* Chain [814]: 0
  with precondition: [D=3] 

* Chain [813]: 0
  with precondition: [D=52,F=0,E=A,0>=C+3] 


#### Cost of chains of f614(A,C,D,E,F):
* Chain [[815],817]: 1*it(815)+0
  Such that:it(815) =< C+4

  with precondition: [D=3,C+3>=0] 

* Chain [[815],816]: 1*it(815)+0
  Such that:it(815) =< C+4

  with precondition: [D=51,F+1=0,C+3>=0] 

* Chain [817]: 0
  with precondition: [D=3] 

* Chain [816]: 0
  with precondition: [D=51,F+1=0,E=A,0>=C+4] 


#### Cost of chains of f622(A,C,D,E,F):
* Chain [[818],820]: 1*it(818)+0
  Such that:it(818) =< C+5

  with precondition: [D=3,C+4>=0] 

* Chain [[818],819]: 1*it(818)+0
  Such that:it(818) =< C+5

  with precondition: [D=50,F+1=0,C+4>=0] 

* Chain [820]: 0
  with precondition: [D=3] 

* Chain [819]: 0
  with precondition: [D=50,F+1=0,E=A,0>=C+5] 


#### Cost of chains of f628(A,C,D,E,F):
* Chain [[821],823]: 1*it(821)+0
  Such that:it(821) =< C+6

  with precondition: [D=3,C+5>=0] 

* Chain [[821],822]: 1*it(821)+0
  Such that:it(821) =< C+6

  with precondition: [D=49,F+1=0,C+5>=0] 

* Chain [823]: 0
  with precondition: [D=3] 

* Chain [822]: 0
  with precondition: [D=49,F+1=0,E=A,0>=C+6] 


#### Cost of chains of f634(A,C,D,E,F):
* Chain [[824],826]: 1*it(824)+0
  Such that:it(824) =< C+5

  with precondition: [D=3,C+4>=0] 

* Chain [[824],825]: 1*it(824)+0
  Such that:it(824) =< C+5

  with precondition: [D=48,F+1=0,C+4>=0] 

* Chain [826]: 0
  with precondition: [D=3] 

* Chain [825]: 0
  with precondition: [D=48,F+1=0,E=A,0>=C+5] 


#### Cost of chains of f640(A,C,D,E,F):
* Chain [[827],829]: 1*it(827)+0
  Such that:it(827) =< C+6

  with precondition: [D=3,C+5>=0] 

* Chain [[827],828]: 1*it(827)+0
  Such that:it(827) =< C+6

  with precondition: [D=47,F+2=0,C+5>=0] 

* Chain [829]: 0
  with precondition: [D=3] 

* Chain [828]: 0
  with precondition: [D=47,F+2=0,E=A,0>=C+6] 


#### Cost of chains of f648(A,C,D,E,F):
* Chain [[830],832]: 1*it(830)+0
  Such that:it(830) =< C+7

  with precondition: [D=3,C+6>=0] 

* Chain [[830],831]: 1*it(830)+0
  Such that:it(830) =< C+7

  with precondition: [D=46,F+2=0,C+6>=0] 

* Chain [832]: 0
  with precondition: [D=3] 

* Chain [831]: 0
  with precondition: [D=46,F+2=0,E=A,0>=C+7] 


#### Cost of chains of f654(A,C,D,E,F):
* Chain [[833],835]: 1*it(833)+0
  Such that:it(833) =< C+8

  with precondition: [D=3,C+7>=0] 

* Chain [[833],834]: 1*it(833)+0
  Such that:it(833) =< C+8

  with precondition: [D=45,F+2=0,C+7>=0] 

* Chain [835]: 0
  with precondition: [D=3] 

* Chain [834]: 0
  with precondition: [D=45,F+2=0,E=A,0>=C+8] 


#### Cost of chains of f660(A,C,D,E,F):
* Chain [[836],838]: 1*it(836)+0
  Such that:it(836) =< C+7

  with precondition: [D=3,C+6>=0] 

* Chain [[836],837]: 1*it(836)+0
  Such that:it(836) =< C+7

  with precondition: [D=44,F+2=0,C+6>=0] 

* Chain [838]: 0
  with precondition: [D=3] 

* Chain [837]: 0
  with precondition: [D=44,F+2=0,E=A,0>=C+7] 


#### Cost of chains of f666(A,C,D,E,F):
* Chain [[839],841]: 1*it(839)+0
  Such that:it(839) =< C+8

  with precondition: [D=3,C+7>=0] 

* Chain [[839],840]: 1*it(839)+0
  Such that:it(839) =< C+8

  with precondition: [D=43,F=16,C+7>=0] 

* Chain [841]: 0
  with precondition: [D=3] 

* Chain [840]: 0
  with precondition: [D=43,F=16,E=A,0>=C+8] 


#### Cost of chains of f674(A,C,D,E,F):
* Chain [[842],844]: 1*it(842)+0
  Such that:it(842) =< C+8

  with precondition: [D=3,C+7>=0] 

* Chain [[842],843]: 1*it(842)+0
  Such that:it(842) =< C+8

  with precondition: [D=42,F=16,C+7>=0] 

* Chain [844]: 0
  with precondition: [D=3] 

* Chain [843]: 0
  with precondition: [D=42,F=16,E=A,0>=C+8] 


#### Cost of chains of f680(A,C,D,E,F):
* Chain [[845],847]: 1*it(845)+0
  Such that:it(845) =< C+9

  with precondition: [D=3,C+8>=0] 

* Chain [[845],846]: 1*it(845)+0
  Such that:it(845) =< C+9

  with precondition: [D=41,F=16,C+8>=0] 

* Chain [847]: 0
  with precondition: [D=3] 

* Chain [846]: 0
  with precondition: [D=41,F=16,E=A,0>=C+9] 


#### Cost of chains of f686(A,C,D,E,F):
* Chain [[848],850]: 1*it(848)+0
  Such that:it(848) =< C+8

  with precondition: [D=3,C+7>=0] 

* Chain [[848],849]: 1*it(848)+0
  Such that:it(848) =< C+8

  with precondition: [D=40,F=16,C+7>=0] 

* Chain [850]: 0
  with precondition: [D=3] 

* Chain [849]: 0
  with precondition: [D=40,F=16,E=A,0>=C+8] 


#### Cost of chains of f692(A,C,D,E,F):
* Chain [[851],853]: 1*it(851)+0
  Such that:it(851) =< C+9

  with precondition: [D=3,C+8>=0] 

* Chain [[851],852]: 1*it(851)+0
  Such that:it(851) =< C+9

  with precondition: [D=39,F=5,C+8>=0] 

* Chain [853]: 0
  with precondition: [D=3] 

* Chain [852]: 0
  with precondition: [D=39,F=5,E=A,0>=C+9] 


#### Cost of chains of f700(A,B,C,D,E,F):
* Chain [[854],856]: 1*it(854)+0
  Such that:it(854) =< C/2

  with precondition: [B=2,D=3,C>=3] 

* Chain [[854],855]: 1*it(854)+0
  Such that:it(854) =< -A/3-C/3+E/3+1
it(854) =< C/2

  with precondition: [B=2,D=38,F=5,C>=3,E+8>=3*C+A,E>=A+C] 

* Chain [856]: 0
  with precondition: [B=2,D=3] 

* Chain [855]: 0
  with precondition: [B=2,D=38,F=5,E=A,2>=C] 


#### Cost of chains of f706(A,B,C,D,E,F):
* Chain [[857],859]: 1*it(857)+0
  Such that:it(857) =< C

  with precondition: [B=2,D=3,C>=2] 

* Chain [[857],858]: 1*it(857)+0
  Such that:it(857) =< -A-C+E+2
it(857) =< C

  with precondition: [B=2,D=37,F=5,C>=2,2*E+9>=5*C+2*A,E>=A+C] 

* Chain [859]: 0
  with precondition: [B=2,D=3] 

* Chain [858]: 0
  with precondition: [B=2,D=37,F=5,E=A,1>=C] 


#### Cost of chains of f712(A,B,C,D,E,F):
* Chain [[860],862]: 1*it(860)+0
  Such that:it(860) =< C/2

  with precondition: [B=2,D=3,C>=3] 

* Chain [[860],861]: 1*it(860)+0
  Such that:it(860) =< -A/3-C/3+E/3+1
it(860) =< C/2

  with precondition: [B=2,D=36,F=5,C>=3,E+8>=3*C+A,E>=A+C] 

* Chain [862]: 0
  with precondition: [B=2,D=3] 

* Chain [861]: 0
  with precondition: [B=2,D=36,F=5,E=A,2>=C] 


#### Cost of chains of f718(A,B,C,D,E,F):
* Chain [[863],865]: 1*it(863)+0
  Such that:it(863) =< C

  with precondition: [B=2,D=3,C>=2] 

* Chain [[863],864]: 1*it(863)+0
  Such that:it(863) =< -A-C+E+2
it(863) =< C

  with precondition: [B=2,D=35,F=6,C>=2,2*E+9>=5*C+2*A,E>=A+C] 

* Chain [865]: 0
  with precondition: [B=2,D=3] 

* Chain [864]: 0
  with precondition: [B=2,D=35,F=6,E=A,1>=C] 


#### Cost of chains of f726(A,B,C,D,E,F):
* Chain [[866],868]: 1*it(866)+0
  Such that:it(866) =< C

  with precondition: [B=2,D=3,C>=2] 

* Chain [[866],867]: 1*it(866)+0
  Such that:it(866) =< -A-C+E+2
it(866) =< C

  with precondition: [B=2,D=34,F=6,C>=2,2*E+9>=5*C+2*A,E>=A+C] 

* Chain [868]: 0
  with precondition: [B=2,D=3] 

* Chain [867]: 0
  with precondition: [B=2,D=34,F=6,E=A,1>=C] 


#### Cost of chains of f732(A,B,C,D,E,F):
* Chain [[869],871]: 1*it(869)+0
  Such that:it(869) =< C/2

  with precondition: [B=2,D=3,C>=1] 

* Chain [[869],870]: 1*it(869)+0
  Such that:it(869) =< C/2

  with precondition: [B=2,D=33,F=6,C>=1] 

* Chain [871]: 0
  with precondition: [B=2,D=3] 

* Chain [870]: 0
  with precondition: [B=2,D=33,F=6,E=A,0>=C] 


#### Cost of chains of f738(A,B,C,D,E,F):
* Chain [[872],874]: 1*it(872)+0
  Such that:it(872) =< C

  with precondition: [B=2,D=3,C>=2] 

* Chain [[872],873]: 1*it(872)+0
  Such that:it(872) =< -A-C+E+2
it(872) =< C

  with precondition: [B=2,D=32,F=6,C>=2,2*E+9>=5*C+2*A,E>=A+C] 

* Chain [874]: 0
  with precondition: [B=2,D=3] 

* Chain [873]: 0
  with precondition: [B=2,D=32,F=6,E=A,1>=C] 


#### Cost of chains of f744(A,B,C,D,E,F):
* Chain [[875],877]: 1*it(875)+0
  Such that:it(875) =< C/2

  with precondition: [B=2,D=3,C>=1] 

* Chain [[875],876]: 1*it(875)+0
  Such that:it(875) =< C/2

  with precondition: [B=2,D=31,F=7,C>=1] 

* Chain [877]: 0
  with precondition: [B=2,D=3] 

* Chain [876]: 0
  with precondition: [B=2,D=31,F=7,E=A,0>=C] 


#### Cost of chains of f752(A,B,C,D,E,F):
* Chain [[878],880]: 1*it(878)+0
  Such that:it(878) =< C/2

  with precondition: [B=2,D=3,C>=1] 

* Chain [[878],879]: 1*it(878)+0
  Such that:it(878) =< C/2

  with precondition: [B=2,D=30,F=7,C>=1] 

* Chain [880]: 0
  with precondition: [B=2,D=3] 

* Chain [879]: 0
  with precondition: [B=2,D=30,F=7,E=A,0>=C] 


#### Cost of chains of f758(A,B,C,D,E,F):
* Chain [[881],883]: 1*it(881)+0
  Such that:it(881) =< C+1

  with precondition: [B=2,D=3,C>=0] 

* Chain [[881],882]: 1*it(881)+0
  Such that:it(881) =< C+1

  with precondition: [B=2,D=29,F=7,C>=0] 

* Chain [883]: 0
  with precondition: [B=2,D=3] 

* Chain [882]: 0
  with precondition: [B=2,D=29,F=7,E=A,0>=C+1] 


#### Cost of chains of f764(A,B,C,D,E,F):
* Chain [[884],886]: 1*it(884)+0
  Such that:it(884) =< C/2

  with precondition: [B=2,D=3,C>=1] 

* Chain [[884],885]: 1*it(884)+0
  Such that:it(884) =< C/2

  with precondition: [B=2,D=28,F=7,C>=1] 

* Chain [886]: 0
  with precondition: [B=2,D=3] 

* Chain [885]: 0
  with precondition: [B=2,D=28,F=7,E=A,0>=C] 


#### Cost of chains of f770(A,B,C,D,E,F):
* Chain [[887],889]: 1*it(887)+0
  Such that:it(887) =< C+1

  with precondition: [B=2,D=3,C>=0] 

* Chain [[887],888]: 1*it(887)+0
  Such that:it(887) =< C+1

  with precondition: [B=2,D=27,F=8,C>=0] 

* Chain [889]: 0
  with precondition: [B=2,D=3] 

* Chain [888]: 0
  with precondition: [B=2,D=27,F=8,E=A,0>=C+1] 


#### Cost of chains of f778(A,B,C,D,E,F):
* Chain [[890],892]: 1*it(890)+0
  Such that:it(890) =< C+1

  with precondition: [B=2,D=3,C>=0] 

* Chain [[890],891]: 1*it(890)+0
  Such that:it(890) =< C+1

  with precondition: [B=2,D=26,F=8,C>=0] 

* Chain [892]: 0
  with precondition: [B=2,D=3] 

* Chain [891]: 0
  with precondition: [B=2,D=26,F=8,E=A,0>=C+1] 


#### Cost of chains of f784(A,B,C,D,E,F):
* Chain [[893],895]: 1*it(893)+0
  Such that:it(893) =< C/2+1

  with precondition: [B=2,D=3,C+1>=0] 

* Chain [[893],894]: 1*it(893)+0
  Such that:it(893) =< C/2+1

  with precondition: [B=2,D=25,F=8,C+1>=0] 

* Chain [895]: 0
  with precondition: [B=2,D=3] 

* Chain [894]: 0
  with precondition: [B=2,D=25,F=8,E=A,0>=C+2] 


#### Cost of chains of f790(A,B,C,D,E,F):
* Chain [[896],898]: 1*it(896)+0
  Such that:it(896) =< C+1

  with precondition: [B=2,D=3,C>=0] 

* Chain [[896],897]: 1*it(896)+0
  Such that:it(896) =< C+1

  with precondition: [B=2,D=24,F=8,C>=0] 

* Chain [898]: 0
  with precondition: [B=2,D=3] 

* Chain [897]: 0
  with precondition: [B=2,D=24,F=8,E=A,0>=C+1] 


#### Cost of chains of f796(A,B,C,D,E,F):
* Chain [[899],901]: 1*it(899)+0
  Such that:it(899) =< C/2+1

  with precondition: [B=2,D=3,C+1>=0] 

* Chain [[899],900]: 1*it(899)+0
  Such that:it(899) =< C/2+1

  with precondition: [B=2,D=23,F=9,C+1>=0] 

* Chain [901]: 0
  with precondition: [B=2,D=3] 

* Chain [900]: 0
  with precondition: [B=2,D=23,F=9,E=A,0>=C+2] 


#### Cost of chains of f804(A,B,C,D,E,F):
* Chain [[902],904]: 1*it(902)+0
  Such that:it(902) =< C/2+1

  with precondition: [B=2,D=3,C+1>=0] 

* Chain [[902],903]: 1*it(902)+0
  Such that:it(902) =< C/2+1

  with precondition: [B=2,D=22,F=9,C+1>=0] 

* Chain [904]: 0
  with precondition: [B=2,D=3] 

* Chain [903]: 0
  with precondition: [B=2,D=22,F=9,E=A,0>=C+2] 


#### Cost of chains of f810(A,B,C,D,E,F):
* Chain [[905],907]: 1*it(905)+0
  Such that:it(905) =< C+3

  with precondition: [B=2,D=3,C+2>=0] 

* Chain [[905],906]: 1*it(905)+0
  Such that:it(905) =< C+3

  with precondition: [B=2,D=21,F=9,C+2>=0] 

* Chain [907]: 0
  with precondition: [B=2,D=3] 

* Chain [906]: 0
  with precondition: [B=2,D=21,F=9,E=A,0>=C+3] 


#### Cost of chains of f816(A,B,C,D,E,F):
* Chain [[908],910]: 1*it(908)+0
  Such that:it(908) =< C/2+1

  with precondition: [B=2,D=3,C+1>=0] 

* Chain [[908],909]: 1*it(908)+0
  Such that:it(908) =< C/2+1

  with precondition: [B=2,D=20,F=9,C+1>=0] 

* Chain [910]: 0
  with precondition: [B=2,D=3] 

* Chain [909]: 0
  with precondition: [B=2,D=20,F=9,E=A,0>=C+2] 


#### Cost of chains of f822(A,B,C,D,E,F):
* Chain [[911],913]: 1*it(911)+0
  Such that:it(911) =< C+3

  with precondition: [B=2,D=3,C+2>=0] 

* Chain [[911],912]: 1*it(911)+0
  Such that:it(911) =< C+3

  with precondition: [B=2,D=19,F=0,C+2>=0] 

* Chain [913]: 0
  with precondition: [B=2,D=3] 

* Chain [912]: 0
  with precondition: [B=2,D=19,F=0,E=A,0>=C+3] 


#### Cost of chains of f830(A,B,C,D,E,F):
* Chain [[914],916]: 1*it(914)+0
  Such that:it(914) =< C+3

  with precondition: [B=2,D=3,C+2>=0] 

* Chain [[914],915]: 1*it(914)+0
  Such that:it(914) =< C+3

  with precondition: [B=2,D=18,F=0,C+2>=0] 

* Chain [916]: 0
  with precondition: [B=2,D=3] 

* Chain [915]: 0
  with precondition: [B=2,D=18,F=0,E=A,0>=C+3] 


#### Cost of chains of f836(A,B,C,D,E,F):
* Chain [[917],919]: 1*it(917)+0
  Such that:it(917) =< C/2+2

  with precondition: [B=2,D=3,C+3>=0] 

* Chain [[917],918]: 1*it(917)+0
  Such that:it(917) =< C/2+2

  with precondition: [B=2,D=17,F=0,C+3>=0] 

* Chain [919]: 0
  with precondition: [B=2,D=3] 

* Chain [918]: 0
  with precondition: [B=2,D=17,F=0,E=A,0>=C+4] 


#### Cost of chains of f842(A,B,C,D,E,F):
* Chain [[920],922]: 1*it(920)+0
  Such that:it(920) =< C+3

  with precondition: [B=2,D=3,C+2>=0] 

* Chain [[920],921]: 1*it(920)+0
  Such that:it(920) =< C+3

  with precondition: [B=2,D=16,F=0,C+2>=0] 

* Chain [922]: 0
  with precondition: [B=2,D=3] 

* Chain [921]: 0
  with precondition: [B=2,D=16,F=0,E=A,0>=C+3] 


#### Cost of chains of f848(A,B,C,D,E,F):
* Chain [[923],925]: 1*it(923)+0
  Such that:it(923) =< C/2+2

  with precondition: [B=2,D=3,C+3>=0] 

* Chain [[923],924]: 1*it(923)+0
  Such that:it(923) =< C/2+2

  with precondition: [B=2,D=15,F+1=0,C+3>=0] 

* Chain [925]: 0
  with precondition: [B=2,D=3] 

* Chain [924]: 0
  with precondition: [B=2,D=15,F+1=0,E=A,0>=C+4] 


#### Cost of chains of f856(A,B,C,D,E,F):
* Chain [[926],928]: 1*it(926)+0
  Such that:it(926) =< C+5

  with precondition: [B=2,D=3,C+4>=0] 

* Chain [[926],927]: 1*it(926)+0
  Such that:it(926) =< C+5

  with precondition: [B=2,D=14,F+1=0,C+4>=0] 

* Chain [928]: 0
  with precondition: [B=2,D=3] 

* Chain [927]: 0
  with precondition: [B=2,D=14,F+1=0,E=A,0>=C+5] 


#### Cost of chains of f862(A,B,C,D,E,F):
* Chain [[929],931]: 1*it(929)+0
  Such that:it(929) =< C/2+3

  with precondition: [B=2,D=3,C+5>=0] 

* Chain [[929],930]: 1*it(929)+0
  Such that:it(929) =< C/2+3

  with precondition: [B=2,D=13,F+1=0,C+5>=0] 

* Chain [931]: 0
  with precondition: [B=2,D=3] 

* Chain [930]: 0
  with precondition: [B=2,D=13,F+1=0,E=A,0>=C+6] 


#### Cost of chains of f868(A,B,C,D,E,F):
* Chain [[932],934]: 1*it(932)+0
  Such that:it(932) =< C+5

  with precondition: [B=2,D=3,C+4>=0] 

* Chain [[932],933]: 1*it(932)+0
  Such that:it(932) =< C+5

  with precondition: [B=2,D=12,F+1=0,C+4>=0] 

* Chain [934]: 0
  with precondition: [B=2,D=3] 

* Chain [933]: 0
  with precondition: [B=2,D=12,F+1=0,E=A,0>=C+5] 


#### Cost of chains of f874(A,B,C,D,E,F):
* Chain [[935],937]: 1*it(935)+0
  Such that:it(935) =< C/2+3

  with precondition: [B=2,D=3,C+5>=0] 

* Chain [[935],936]: 1*it(935)+0
  Such that:it(935) =< C/2+3

  with precondition: [B=2,D=11,F+2=0,C+5>=0] 

* Chain [937]: 0
  with precondition: [B=2,D=3] 

* Chain [936]: 0
  with precondition: [B=2,D=11,F+2=0,E=A,0>=C+6] 


#### Cost of chains of f882(A,B,C,D,E,F):
* Chain [[938],940]: 1*it(938)+0
  Such that:it(938) =< C+7

  with precondition: [B=2,D=3,C+6>=0] 

* Chain [[938],939]: 1*it(938)+0
  Such that:it(938) =< C+7

  with precondition: [B=2,D=10,F+2=0,C+6>=0] 

* Chain [940]: 0
  with precondition: [B=2,D=3] 

* Chain [939]: 0
  with precondition: [B=2,D=10,F+2=0,E=A,0>=C+7] 


#### Cost of chains of f888(A,B,C,D,E,F):
* Chain [[941],943]: 1*it(941)+0
  Such that:it(941) =< C/2+4

  with precondition: [B=2,D=3,C+7>=0] 

* Chain [[941],942]: 1*it(941)+0
  Such that:it(941) =< C/2+4

  with precondition: [B=2,D=9,F+2=0,C+7>=0] 

* Chain [943]: 0
  with precondition: [B=2,D=3] 

* Chain [942]: 0
  with precondition: [B=2,D=9,F+2=0,E=A,0>=C+8] 


#### Cost of chains of f894(A,B,C,D,E,F):
* Chain [[944],946]: 1*it(944)+0
  Such that:it(944) =< C+7

  with precondition: [B=2,D=3,C+6>=0] 

* Chain [[944],945]: 1*it(944)+0
  Such that:it(944) =< C+7

  with precondition: [B=2,D=8,F+2=0,C+6>=0] 

* Chain [946]: 0
  with precondition: [B=2,D=3] 

* Chain [945]: 0
  with precondition: [B=2,D=8,F+2=0,E=A,0>=C+7] 


#### Cost of chains of f900(A,B,C,D,E,F):
* Chain [[947],949]: 1*it(947)+0
  Such that:it(947) =< C/2+4

  with precondition: [B=2,D=3,C+7>=0] 

* Chain [[947],948]: 1*it(947)+0
  Such that:it(947) =< C/2+4

  with precondition: [B=2,D=7,F=16,C+7>=0] 

* Chain [949]: 0
  with precondition: [B=2,D=3] 

* Chain [948]: 0
  with precondition: [B=2,D=7,F=16,E=A,0>=C+8] 


#### Cost of chains of f908(A,B,C,D,E,F):
* Chain [[950],952]: 1*it(950)+0
  Such that:it(950) =< C/2+4

  with precondition: [B=2,D=3,C+7>=0] 

* Chain [[950],951]: 1*it(950)+0
  Such that:it(950) =< C/2+4

  with precondition: [B=2,D=6,F=16,C+7>=0] 

* Chain [952]: 0
  with precondition: [B=2,D=3] 

* Chain [951]: 0
  with precondition: [B=2,D=6,F=16,E=A,0>=C+8] 


#### Cost of chains of f914(A,B,C,D,E,F):
* Chain [[953],955]: 1*it(953)+0
  Such that:it(953) =< C+9

  with precondition: [B=2,D=3,C+8>=0] 

* Chain [[953],954]: 1*it(953)+0
  Such that:it(953) =< C+9

  with precondition: [B=2,D=5,F=16,C+8>=0] 

* Chain [955]: 0
  with precondition: [B=2,D=3] 

* Chain [954]: 0
  with precondition: [B=2,D=5,F=16,E=A,0>=C+9] 


#### Cost of chains of f920(A,B,C,D,E,F):
* Chain [[956],958]: 1*it(956)+0
  Such that:it(956) =< C/2+4

  with precondition: [B=2,D=3,C+7>=0] 

* Chain [[956],957]: 1*it(956)+0
  Such that:it(956) =< C/2+4

  with precondition: [B=2,D=4,F=16,C+7>=0] 

* Chain [958]: 0
  with precondition: [B=2,D=3] 

* Chain [957]: 0
  with precondition: [B=2,D=4,F=16,E=A,0>=C+8] 


#### Cost of chains of f926(A,B,C,D,E,F):
* Chain [[959],961]: 1*it(959)+0
  Such that:it(959) =< C+9

  with precondition: [B=2,D=2,C+8>=0] 

* Chain [[959],960]: 1*it(959)+0
  Such that:it(959) =< C+9

  with precondition: [B=2,D=3,C+8>=0] 

* Chain [961]: 0
  with precondition: [B=2,D=2,E=A,C=F,0>=C+9] 

* Chain [960]: 0
  with precondition: [B=2,D=3] 


#### Cost of chains of f926_loop_cont(A,B,C,D,E):
* Chain [963]: 0
  with precondition: [A=2,C=2] 

* Chain [962]: 0
  with precondition: [A=3,C=2] 


#### Cost of chains of f920_loop_cont(A,B,C,D,E):
* Chain [967]: 0
  with precondition: [A=3,C=2] 

* Chain [966]: 0
  with precondition: [A=4,C=2] 

* Chain [965]: 0
  with precondition: [A=4,C=2,0>=D+9] 

* Chain [964]: 2*s(1)+0
  Such that:aux(1) =< D+9
s(1) =< aux(1)

  with precondition: [A=4,C=2,D+8>=0] 


#### Cost of chains of f914_loop_cont(A,B,C,D,E):
* Chain [971]: 0
  with precondition: [A=3,C=2] 

* Chain [970]: 0
  with precondition: [A=5,C=2] 

* Chain [969]: 50
  with precondition: [A=5,C=2,0>=D+8] 

* Chain [968]: 3*s(5)+2*s(9)+0
  Such that:s(8) =< 25
aux(2) =< D/2+4
s(5) =< aux(2)
s(9) =< s(8)

  with precondition: [A=5,C=2,D+7>=0] 


#### Cost of chains of f908_loop_cont(A,B,C,D,E):
* Chain [975]: 0
  with precondition: [A=3,C=2] 

* Chain [974]: 0
  with precondition: [A=6,C=2] 

* Chain [973]: 86
  with precondition: [A=6,C=2,0>=D+9] 

* Chain [972]: 3*s(14)+3*s(19)+2*s(20)+0
  Such that:s(18) =< 12
s(17) =< 25
aux(3) =< D+9
s(14) =< aux(3)
s(19) =< s(18)
s(20) =< s(17)

  with precondition: [A=6,C=2,D+8>=0] 


#### Cost of chains of f900_loop_cont(A,B,C,D,E):
* Chain [979]: 0
  with precondition: [A=3,C=2] 

* Chain [978]: 0
  with precondition: [A=7,C=2] 

* Chain [977]: 161
  with precondition: [A=7,C=2,0>=D+8] 

* Chain [976]: 3*s(27)+5*s(33)+3*s(34)+0
  Such that:s(30) =< 12
aux(5) =< 25
aux(6) =< D/2+4
s(27) =< aux(6)
s(33) =< aux(5)
s(34) =< s(30)

  with precondition: [A=7,C=2,D+7>=0] 


#### Cost of chains of f894_loop_cont(A,B,C,D,E):
* Chain [983]: 0
  with precondition: [A=3,C=2] 

* Chain [982]: 0
  with precondition: [A=8,C=2] 

* Chain [981]: 197
  with precondition: [A=8,C=2,0>=D+8] 

* Chain [980]: 3*s(42)+6*s(48)+5*s(49)+0
  Such that:aux(8) =< 12
s(46) =< 25
aux(9) =< D/2+4
s(42) =< aux(9)
s(48) =< aux(8)
s(49) =< s(46)

  with precondition: [A=8,C=2,D+7>=0] 


#### Cost of chains of f888_loop_cont(A,B,C,D,E):
* Chain [987]: 0
  with precondition: [A=3,C=2] 

* Chain [986]: 0
  with precondition: [A=9,C=2] 

* Chain [985]: 206
  with precondition: [A=9,C=2,0>=D+7] 

* Chain [984]: 3*s(57)+3*s(63)+6*s(64)+5*s(65)+0
  Such that:s(62) =< 3
s(60) =< 12
s(61) =< 25
aux(10) =< D+7
s(57) =< aux(10)
s(63) =< s(62)
s(64) =< s(60)
s(65) =< s(61)

  with precondition: [A=9,C=2,D+6>=0] 


#### Cost of chains of f882_loop_cont(A,B,C,D,E):
* Chain [991]: 0
  with precondition: [A=3,C=2] 

* Chain [990]: 0
  with precondition: [A=10,C=2] 

* Chain [989]: 221
  with precondition: [A=10,C=2,0>=D+8] 

* Chain [988]: 3*s(74)+3*s(81)+3*s(82)+6*s(83)+5*s(84)+0
  Such that:s(77) =< 3
s(80) =< 5
s(78) =< 12
s(79) =< 25
aux(11) =< D/2+4
s(74) =< aux(11)
s(81) =< s(80)
s(82) =< s(77)
s(83) =< s(78)
s(84) =< s(79)

  with precondition: [A=10,C=2,D+7>=0] 


#### Cost of chains of f874_loop_cont(A,B,C,D,E):
* Chain [995]: 0
  with precondition: [A=3,C=2] 

* Chain [994]: 0
  with precondition: [A=11,C=2] 

* Chain [993]: 230
  with precondition: [A=11,C=2,0>=D+7] 

* Chain [992]: 3*s(95)+6*s(103)+3*s(104)+6*s(106)+5*s(107)+0
  Such that:aux(13) =< 3
s(99) =< 5
s(100) =< 12
s(101) =< 25
aux(14) =< D+7
s(95) =< aux(14)
s(103) =< aux(13)
s(104) =< s(99)
s(106) =< s(100)
s(107) =< s(101)

  with precondition: [A=11,C=2,D+6>=0] 


#### Cost of chains of f868_loop_cont(A,B,C,D,E):
* Chain [999]: 0
  with precondition: [A=3,C=2] 

* Chain [998]: 0
  with precondition: [A=12,C=2] 

* Chain [997]: 245
  with precondition: [A=12,C=2,0>=D+6] 

* Chain [996]: 3*s(118)+6*s(126)+6*s(127)+6*s(129)+5*s(130)+0
  Such that:s(121) =< 3
aux(16) =< 5
s(123) =< 12
s(124) =< 25
aux(17) =< D/2+3
s(118) =< aux(17)
s(126) =< aux(16)
s(127) =< s(121)
s(129) =< s(123)
s(130) =< s(124)

  with precondition: [A=12,C=2,D+5>=0] 


#### Cost of chains of f862_loop_cont(A,B,C,D,E):
* Chain [1003]: 0
  with precondition: [A=3,C=2] 

* Chain [1002]: 0
  with precondition: [A=13,C=2] 

* Chain [1001]: 505/2
  with precondition: [A=13,C=2,0>=D+5] 

* Chain [1000]: 3*s(141)+3*s(149)+6*s(150)+6*s(151)+6*s(152)+5*s(153)+0
  Such that:s(144) =< 3
s(145) =< 5
s(146) =< 12
s(147) =< 25
s(148) =< 5/2
aux(18) =< D+5
s(141) =< aux(18)
s(149) =< s(148)
s(150) =< s(145)
s(151) =< s(144)
s(152) =< s(146)
s(153) =< s(147)

  with precondition: [A=13,C=2,D+4>=0] 


#### Cost of chains of f856_loop_cont(A,B,C,D,E):
* Chain [1007]: 0
  with precondition: [A=3,C=2] 

* Chain [1006]: 0
  with precondition: [A=14,C=2] 

* Chain [1005]: 529/2
  with precondition: [A=14,C=2,0>=D+6] 

* Chain [1004]: 3*s(166)+3*s(175)+3*s(176)+6*s(177)+6*s(178)+6*s(179)+5*s(180)+0
  Such that:s(169) =< 3
s(174) =< 4
s(170) =< 5
s(171) =< 12
s(172) =< 25
s(173) =< 5/2
aux(19) =< D/2+3
s(166) =< aux(19)
s(175) =< s(174)
s(176) =< s(173)
s(177) =< s(170)
s(178) =< s(169)
s(179) =< s(171)
s(180) =< s(172)

  with precondition: [A=14,C=2,D+5>=0] 


#### Cost of chains of f848_loop_cont(A,B,C,D,E):
* Chain [1011]: 0
  with precondition: [A=3,C=2] 

* Chain [1010]: 0
  with precondition: [A=15,C=2] 

* Chain [1009]: 272
  with precondition: [A=15,C=2,0>=D+5] 

* Chain [1008]: 3*s(195)+6*s(205)+3*s(206)+6*s(208)+6*s(209)+6*s(210)+5*s(211)+0
  Such that:s(198) =< 3
s(199) =< 4
s(200) =< 5
s(201) =< 12
s(202) =< 25
aux(21) =< 5/2
aux(22) =< D+5
s(195) =< aux(22)
s(205) =< aux(21)
s(206) =< s(199)
s(208) =< s(200)
s(209) =< s(198)
s(210) =< s(201)
s(211) =< s(202)

  with precondition: [A=15,C=2,D+4>=0] 


#### Cost of chains of f842_loop_cont(A,B,C,D,E):
* Chain [1015]: 0
  with precondition: [A=3,C=2] 

* Chain [1014]: 0
  with precondition: [A=16,C=2] 

* Chain [1013]: 284
  with precondition: [A=16,C=2,0>=D+4] 

* Chain [1012]: 3*s(226)+6*s(236)+6*s(237)+6*s(239)+6*s(240)+6*s(241)+5*s(242)+0
  Such that:s(229) =< 3
aux(24) =< 4
s(231) =< 5
s(232) =< 12
s(233) =< 25
s(234) =< 5/2
aux(25) =< D/2+2
s(226) =< aux(25)
s(236) =< aux(24)
s(237) =< s(234)
s(239) =< s(231)
s(240) =< s(229)
s(241) =< s(232)
s(242) =< s(233)

  with precondition: [A=16,C=2,D+3>=0] 


#### Cost of chains of f836_loop_cont(A,B,C,D,E):
* Chain [1019]: 0
  with precondition: [A=3,C=2] 

* Chain [1018]: 0
  with precondition: [A=17,C=2] 

* Chain [1017]: 290
  with precondition: [A=17,C=2,0>=D+3] 

* Chain [1016]: 3*s(257)+3*s(267)+6*s(268)+6*s(269)+6*s(270)+6*s(271)+6*s(272)+5*s(273)+0
  Such that:s(266) =< 2
s(260) =< 3
s(261) =< 4
s(262) =< 5
s(263) =< 12
s(264) =< 25
s(265) =< 5/2
aux(26) =< D+3
s(257) =< aux(26)
s(267) =< s(266)
s(268) =< s(261)
s(269) =< s(265)
s(270) =< s(262)
s(271) =< s(260)
s(272) =< s(263)
s(273) =< s(264)

  with precondition: [A=17,C=2,D+2>=0] 


#### Cost of chains of f830_loop_cont(A,B,C,D,E):
* Chain [1023]: 0
  with precondition: [A=3,C=2] 

* Chain [1022]: 0
  with precondition: [A=18,C=2] 

* Chain [1021]: 299
  with precondition: [A=18,C=2,0>=D+4] 

* Chain [1020]: 3*s(290)+9*s(301)+3*s(302)+6*s(303)+6*s(304)+6*s(305)+6*s(307)+5*s(308)+0
  Such that:s(293) =< 2
aux(28) =< 3
s(295) =< 4
s(296) =< 5
s(297) =< 12
s(298) =< 25
s(299) =< 5/2
aux(29) =< D/2+2
s(290) =< aux(29)
s(301) =< aux(28)
s(302) =< s(293)
s(303) =< s(295)
s(304) =< s(299)
s(305) =< s(296)
s(307) =< s(297)
s(308) =< s(298)

  with precondition: [A=18,C=2,D+3>=0] 


#### Cost of chains of f822_loop_cont(A,B,C,D,E):
* Chain [1027]: 0
  with precondition: [A=3,C=2] 

* Chain [1026]: 0
  with precondition: [A=19,C=2] 

* Chain [1025]: 305
  with precondition: [A=19,C=2,0>=D+3] 

* Chain [1024]: 3*s(325)+6*s(336)+9*s(337)+6*s(339)+6*s(340)+6*s(341)+6*s(342)+5*s(343)+0
  Such that:aux(31) =< 2
s(329) =< 3
s(330) =< 4
s(331) =< 5
s(332) =< 12
s(333) =< 25
s(334) =< 5/2
aux(32) =< D+3
s(325) =< aux(32)
s(336) =< aux(31)
s(337) =< s(329)
s(339) =< s(330)
s(340) =< s(334)
s(341) =< s(331)
s(342) =< s(332)
s(343) =< s(333)

  with precondition: [A=19,C=2,D+2>=0] 


#### Cost of chains of f816_loop_cont(A,B,C,D,E):
* Chain [1031]: 0
  with precondition: [A=3,C=2] 

* Chain [1030]: 0
  with precondition: [A=20,C=2] 

* Chain [1029]: 314
  with precondition: [A=20,C=2,0>=D+3] 

* Chain [1028]: 3*s(360)+12*s(371)+6*s(372)+6*s(374)+6*s(375)+6*s(376)+6*s(377)+5*s(378)+0
  Such that:s(363) =< 2
aux(34) =< 3
s(365) =< 4
s(366) =< 5
s(367) =< 12
s(368) =< 25
s(369) =< 5/2
aux(35) =< D+3
s(360) =< aux(35)
s(371) =< aux(34)
s(372) =< s(363)
s(374) =< s(365)
s(375) =< s(369)
s(376) =< s(366)
s(377) =< s(367)
s(378) =< s(368)

  with precondition: [A=20,C=2,D+2>=0] 


#### Cost of chains of f810_loop_cont(A,B,C,D,E):
* Chain [1035]: 0
  with precondition: [A=3,C=2] 

* Chain [1034]: 0
  with precondition: [A=21,C=2] 

* Chain [1033]: 350
  with precondition: [A=21,C=2,0>=D+2] 

* Chain [1032]: 3*s(395)+9*s(406)+12*s(407)+6*s(408)+6*s(409)+6*s(410)+6*s(411)+5*s(413)+0
  Such that:s(398) =< 2
s(399) =< 3
s(400) =< 4
s(401) =< 5
aux(37) =< 12
s(403) =< 25
s(404) =< 5/2
aux(38) =< D/2+1
s(395) =< aux(38)
s(406) =< aux(37)
s(407) =< s(399)
s(408) =< s(398)
s(409) =< s(400)
s(410) =< s(404)
s(411) =< s(401)
s(413) =< s(403)

  with precondition: [A=21,C=2,D+1>=0] 


#### Cost of chains of f804_loop_cont(A,B,C,D,E):
* Chain [1039]: 0
  with precondition: [A=3,C=2] 

* Chain [1038]: 0
  with precondition: [A=22,C=2] 

* Chain [1037]: 733/2
  with precondition: [A=22,C=2,0>=D+3] 

* Chain [1036]: 3*s(430)+3*s(441)+9*s(442)+12*s(443)+6*s(444)+6*s(445)+6*s(446)+6*s(447)+5*s(448)+0
  Such that:s(433) =< 2
s(434) =< 3
s(435) =< 4
s(436) =< 5
s(437) =< 12
s(438) =< 25
s(439) =< 5/2
s(440) =< 11/2
aux(39) =< D+3
s(430) =< aux(39)
s(441) =< s(440)
s(442) =< s(437)
s(443) =< s(434)
s(444) =< s(433)
s(445) =< s(435)
s(446) =< s(439)
s(447) =< s(436)
s(448) =< s(438)

  with precondition: [A=22,C=2,D+2>=0] 


#### Cost of chains of f796_loop_cont(A,B,C,D,E):
* Chain [1043]: 0
  with precondition: [A=3,C=2] 

* Chain [1042]: 0
  with precondition: [A=23,C=2] 

* Chain [1041]: 805/2
  with precondition: [A=23,C=2,0>=D+2] 

* Chain [1040]: 3*s(467)+12*s(479)+3*s(480)+12*s(482)+6*s(483)+6*s(484)+6*s(485)+6*s(486)+5*s(487)+0
  Such that:s(470) =< 2
s(471) =< 3
s(472) =< 4
s(473) =< 5
aux(41) =< 12
s(475) =< 25
s(476) =< 5/2
s(477) =< 11/2
aux(42) =< D/2+1
s(467) =< aux(42)
s(479) =< aux(41)
s(480) =< s(477)
s(482) =< s(471)
s(483) =< s(470)
s(484) =< s(472)
s(485) =< s(476)
s(486) =< s(473)
s(487) =< s(475)

  with precondition: [A=23,C=2,D+1>=0] 


#### Cost of chains of f790_loop_cont(A,B,C,D,E):
* Chain [1047]: 0
  with precondition: [A=3,C=2] 

* Chain [1046]: 0
  with precondition: [A=24,C=2] 

* Chain [1045]: 419
  with precondition: [A=24,C=2,0>=D+2] 

* Chain [1044]: 3*s(506)+6*s(518)+12*s(519)+12*s(521)+6*s(522)+6*s(523)+6*s(524)+6*s(525)+5*s(526)+0
  Such that:s(509) =< 2
s(510) =< 3
s(511) =< 4
s(512) =< 5
s(513) =< 12
s(514) =< 25
s(515) =< 5/2
aux(44) =< 11/2
aux(45) =< D/2+1
s(506) =< aux(45)
s(518) =< aux(44)
s(519) =< s(513)
s(521) =< s(510)
s(522) =< s(509)
s(523) =< s(511)
s(524) =< s(515)
s(525) =< s(512)
s(526) =< s(514)

  with precondition: [A=24,C=2,D+1>=0] 


#### Cost of chains of f784_loop_cont(A,B,C,D,E):
* Chain [1051]: 0
  with precondition: [A=3,C=2] 

* Chain [1050]: 0
  with precondition: [A=25,C=2] 

* Chain [1049]: 434
  with precondition: [A=25,C=2,0>=D+1] 

* Chain [1048]: 3*s(545)+9*s(557)+6*s(558)+12*s(559)+12*s(560)+6*s(561)+6*s(562)+6*s(563)+5*s(565)+0
  Such that:s(548) =< 2
s(549) =< 3
s(550) =< 4
aux(47) =< 5
s(552) =< 12
s(553) =< 25
s(554) =< 5/2
s(555) =< 11/2
aux(48) =< D+1
s(545) =< aux(48)
s(557) =< aux(47)
s(558) =< s(555)
s(559) =< s(552)
s(560) =< s(549)
s(561) =< s(548)
s(562) =< s(550)
s(563) =< s(554)
s(565) =< s(553)

  with precondition: [A=25,C=2,D>=0] 


#### Cost of chains of f778_loop_cont(A,B,C,D,E):
* Chain [1055]: 0
  with precondition: [A=3,C=2] 

* Chain [1054]: 0
  with precondition: [A=26,C=2] 

* Chain [1053]: 461
  with precondition: [A=26,C=2,0>=D+2] 

* Chain [1052]: 3*s(584)+3*s(596)+9*s(597)+6*s(598)+12*s(599)+12*s(600)+6*s(601)+6*s(602)+6*s(603)+5*s(604)+0
  Such that:s(587) =< 2
s(588) =< 3
s(589) =< 4
s(590) =< 5
s(595) =< 9
s(591) =< 12
s(592) =< 25
s(593) =< 5/2
s(594) =< 11/2
aux(49) =< D/2+1
s(584) =< aux(49)
s(596) =< s(595)
s(597) =< s(590)
s(598) =< s(594)
s(599) =< s(591)
s(600) =< s(588)
s(601) =< s(587)
s(602) =< s(589)
s(603) =< s(593)
s(604) =< s(592)

  with precondition: [A=26,C=2,D+1>=0] 


#### Cost of chains of f770_loop_cont(A,B,C,D,E):
* Chain [1059]: 0
  with precondition: [A=3,C=2] 

* Chain [1058]: 0
  with precondition: [A=27,C=2] 

* Chain [1057]: 476
  with precondition: [A=27,C=2,0>=D+1] 

* Chain [1056]: 3*s(625)+12*s(638)+3*s(639)+6*s(641)+12*s(642)+12*s(643)+6*s(644)+6*s(645)+6*s(646)+5*s(647)+0
  Such that:s(628) =< 2
s(629) =< 3
s(630) =< 4
aux(51) =< 5
s(632) =< 9
s(633) =< 12
s(634) =< 25
s(635) =< 5/2
s(636) =< 11/2
aux(52) =< D+1
s(625) =< aux(52)
s(638) =< aux(51)
s(639) =< s(632)
s(641) =< s(636)
s(642) =< s(633)
s(643) =< s(629)
s(644) =< s(628)
s(645) =< s(630)
s(646) =< s(635)
s(647) =< s(634)

  with precondition: [A=27,C=2,D>=0] 


#### Cost of chains of f764_loop_cont(A,B,C,D,E):
* Chain [1063]: 0
  with precondition: [A=3,C=2] 

* Chain [1062]: 0
  with precondition: [A=28,C=2] 

* Chain [1061]: 503
  with precondition: [A=28,C=2,0>=D+1] 

* Chain [1060]: 3*s(668)+6*s(681)+12*s(682)+6*s(684)+12*s(685)+12*s(686)+6*s(687)+6*s(688)+6*s(689)+5*s(690)+0
  Such that:s(671) =< 2
s(672) =< 3
s(673) =< 4
s(674) =< 5
aux(54) =< 9
s(676) =< 12
s(677) =< 25
s(678) =< 5/2
s(679) =< 11/2
aux(55) =< D+1
s(668) =< aux(55)
s(681) =< aux(54)
s(682) =< s(674)
s(684) =< s(679)
s(685) =< s(676)
s(686) =< s(672)
s(687) =< s(671)
s(688) =< s(673)
s(689) =< s(678)
s(690) =< s(677)

  with precondition: [A=28,C=2,D>=0] 


#### Cost of chains of f758_loop_cont(A,B,C,D,E):
* Chain [1067]: 0
  with precondition: [A=3,C=2] 

* Chain [1066]: 0
  with precondition: [A=29,C=2] 

* Chain [1065]: 527
  with precondition: [A=29,C=2,0>=D] 

* Chain [1064]: 3*s(711)+3*s(724)+6*s(725)+12*s(726)+6*s(727)+12*s(728)+12*s(729)+6*s(730)+6*s(731)+6*s(732)+5*s(733)+0
  Such that:s(714) =< 2
s(715) =< 3
s(716) =< 4
s(717) =< 5
s(723) =< 8
s(718) =< 9
s(719) =< 12
s(720) =< 25
s(721) =< 5/2
s(722) =< 11/2
aux(56) =< D/2
s(711) =< aux(56)
s(724) =< s(723)
s(725) =< s(718)
s(726) =< s(717)
s(727) =< s(722)
s(728) =< s(719)
s(729) =< s(715)
s(730) =< s(714)
s(731) =< s(716)
s(732) =< s(721)
s(733) =< s(720)

  with precondition: [A=29,C=2,D>=1] 


#### Cost of chains of f752_loop_cont(A,B,C,D,E):
* Chain [1071]: 0
  with precondition: [A=3,C=2] 

* Chain [1070]: 0
  with precondition: [A=30,C=2] 

* Chain [1069]: 1075/2
  with precondition: [A=30,C=2,0>=D+1] 

* Chain [1068]: 3*s(756)+3*s(770)+3*s(771)+6*s(772)+12*s(773)+6*s(774)+12*s(775)+12*s(776)+6*s(777)+6*s(778)+6*s(779)+5*s(780)+0
  Such that:s(759) =< 2
s(760) =< 3
s(761) =< 4
s(762) =< 5
s(763) =< 8
s(764) =< 9
s(765) =< 12
s(766) =< 25
s(767) =< 5/2
s(769) =< 7/2
s(768) =< 11/2
aux(57) =< D+1
s(756) =< aux(57)
s(770) =< s(769)
s(771) =< s(763)
s(772) =< s(764)
s(773) =< s(762)
s(774) =< s(768)
s(775) =< s(765)
s(776) =< s(760)
s(777) =< s(759)
s(778) =< s(761)
s(779) =< s(767)
s(780) =< s(766)

  with precondition: [A=30,C=2,D>=0] 


#### Cost of chains of f744_loop_cont(A,B,C,D,E):
* Chain [1075]: 0
  with precondition: [A=3,C=2] 

* Chain [1074]: 0
  with precondition: [A=31,C=2] 

* Chain [1073]: 1123/2
  with precondition: [A=31,C=2,0>=D] 

* Chain [1072]: 3*s(805)+6*s(820)+3*s(821)+6*s(823)+12*s(824)+6*s(825)+12*s(826)+12*s(827)+6*s(828)+6*s(829)+6*s(830)+5*s(831)+0
  Such that:s(808) =< 2
s(809) =< 3
s(810) =< 4
s(811) =< 5
aux(59) =< 8
s(813) =< 9
s(814) =< 12
s(815) =< 25
s(816) =< 5/2
s(817) =< 7/2
s(818) =< 11/2
aux(60) =< D/2
s(805) =< aux(60)
s(820) =< aux(59)
s(821) =< s(817)
s(823) =< s(813)
s(824) =< s(811)
s(825) =< s(818)
s(826) =< s(814)
s(827) =< s(809)
s(828) =< s(808)
s(829) =< s(810)
s(830) =< s(816)
s(831) =< s(815)

  with precondition: [A=31,C=2,D>=1] 


#### Cost of chains of f738_loop_cont(A,B,C,D,E):
* Chain [1079]: 0
  with precondition: [A=3,C=2] 

* Chain [1078]: 0
  with precondition: [A=32,C=2] 

* Chain [1077]: 572
  with precondition: [A=32,C=2,0>=D] 

* Chain [1076]: 3*s(856)+6*s(871)+6*s(872)+6*s(874)+12*s(875)+6*s(876)+12*s(877)+12*s(878)+6*s(879)+6*s(880)+6*s(881)+5*s(882)+0
  Such that:s(859) =< 2
s(860) =< 3
s(861) =< 4
s(862) =< 5
s(863) =< 8
s(864) =< 9
s(865) =< 12
s(866) =< 25
s(867) =< 5/2
aux(62) =< 7/2
s(869) =< 11/2
aux(63) =< D/2
s(856) =< aux(63)
s(871) =< aux(62)
s(872) =< s(863)
s(874) =< s(864)
s(875) =< s(862)
s(876) =< s(869)
s(877) =< s(865)
s(878) =< s(860)
s(879) =< s(859)
s(880) =< s(861)
s(881) =< s(867)
s(882) =< s(866)

  with precondition: [A=32,C=2,D>=1] 


#### Cost of chains of f732_loop_cont(A,B,C,D,E):
* Chain [1083]: 0
  with precondition: [A=3,C=2] 

* Chain [1082]: 0
  with precondition: [A=33,C=2] 

* Chain [1081]: 581
  with precondition: [A=33,C=2,1>=D] 

* Chain [1080]: 3*s(907)+15*s(922)+6*s(923)+6*s(924)+6*s(925)+12*s(926)+6*s(927)+12*s(928)+6*s(930)+6*s(931)+6*s(932)+5*s(933)+0
  Such that:s(910) =< 2
aux(65) =< 3
s(912) =< 4
s(913) =< 5
s(914) =< 8
s(915) =< 9
s(916) =< 12
s(917) =< 25
s(918) =< 5/2
s(919) =< 7/2
s(920) =< 11/2
aux(66) =< D
s(907) =< aux(66)
s(922) =< aux(65)
s(923) =< s(919)
s(924) =< s(914)
s(925) =< s(915)
s(926) =< s(913)
s(927) =< s(920)
s(928) =< s(916)
s(930) =< s(910)
s(931) =< s(912)
s(932) =< s(918)
s(933) =< s(917)

  with precondition: [A=33,C=2,D>=2] 


#### Cost of chains of f726_loop_cont(A,B,C,D,E):
* Chain [1087]: 0
  with precondition: [A=3,C=2] 

* Chain [1086]: 0
  with precondition: [A=34,C=2] 

* Chain [1085]: 599
  with precondition: [A=34,C=2,0>=D] 

* Chain [1084]: 3*s(958)+3*s(973)+15*s(974)+6*s(975)+6*s(976)+6*s(977)+12*s(978)+6*s(979)+12*s(980)+6*s(981)+6*s(982)+6*s(983)+5*s(984)+0
  Such that:s(961) =< 2
s(962) =< 3
s(963) =< 4
s(964) =< 5
s(972) =< 6
s(965) =< 8
s(966) =< 9
s(967) =< 12
s(968) =< 25
s(969) =< 5/2
s(970) =< 7/2
s(971) =< 11/2
aux(67) =< D/2
s(958) =< aux(67)
s(973) =< s(972)
s(974) =< s(962)
s(975) =< s(970)
s(976) =< s(965)
s(977) =< s(966)
s(978) =< s(964)
s(979) =< s(971)
s(980) =< s(967)
s(981) =< s(961)
s(982) =< s(963)
s(983) =< s(969)
s(984) =< s(968)

  with precondition: [A=34,C=2,D>=1] 


#### Cost of chains of f718_loop_cont(A,B,C,D,E):
* Chain [1091]: 0
  with precondition: [A=3,C=2] 

* Chain [1090]: 0
  with precondition: [A=35,C=2] 

* Chain [1089]: 608
  with precondition: [A=35,C=2,1>=D] 

* Chain [1088]: 3*s(1011)+18*s(1027)+3*s(1028)+6*s(1030)+6*s(1031)+6*s(1032)+12*s(1033)+6*s(1034)+12*s(1035)+6*s(1036)+6*s(1037)+6*s(1038)+5*s(1039)+0
  Such that:s(1014) =< 2
aux(69) =< 3
s(1016) =< 4
s(1017) =< 5
s(1018) =< 6
s(1019) =< 8
s(1020) =< 9
s(1021) =< 12
s(1022) =< 25
s(1023) =< 5/2
s(1024) =< 7/2
s(1025) =< 11/2
aux(70) =< D
s(1011) =< aux(70)
s(1027) =< aux(69)
s(1028) =< s(1018)
s(1030) =< s(1024)
s(1031) =< s(1019)
s(1032) =< s(1020)
s(1033) =< s(1017)
s(1034) =< s(1025)
s(1035) =< s(1021)
s(1036) =< s(1014)
s(1037) =< s(1016)
s(1038) =< s(1023)
s(1039) =< s(1022)

  with precondition: [A=35,C=2,D>=2] 


#### Cost of chains of f712_loop_cont(A,B,C,D,E):
* Chain [1095]: 0
  with precondition: [A=3,C=2] 

* Chain [1094]: 0
  with precondition: [A=36,C=2] 

* Chain [1093]: 626
  with precondition: [A=36,C=2,1>=D] 

* Chain [1092]: 3*s(1066)+6*s(1082)+18*s(1083)+6*s(1085)+6*s(1086)+6*s(1087)+12*s(1088)+6*s(1089)+12*s(1090)+6*s(1091)+6*s(1092)+6*s(1093)+5*s(1094)+0
  Such that:s(1069) =< 2
s(1070) =< 3
s(1071) =< 4
s(1072) =< 5
aux(72) =< 6
s(1074) =< 8
s(1075) =< 9
s(1076) =< 12
s(1077) =< 25
s(1078) =< 5/2
s(1079) =< 7/2
s(1080) =< 11/2
aux(73) =< D
s(1066) =< aux(73)
s(1082) =< aux(72)
s(1083) =< s(1070)
s(1085) =< s(1079)
s(1086) =< s(1074)
s(1087) =< s(1075)
s(1088) =< s(1072)
s(1089) =< s(1080)
s(1090) =< s(1076)
s(1091) =< s(1069)
s(1092) =< s(1071)
s(1093) =< s(1078)
s(1094) =< s(1077)

  with precondition: [A=36,C=2,D>=2] 


#### Cost of chains of f706_loop_cont(A,B,C,D,E):
* Chain [1099]: 0
  with precondition: [A=3,C=2] 

* Chain [1098]: 0
  with precondition: [A=37,C=2] 

* Chain [1097]: 641
  with precondition: [A=37,C=2,2>=D] 

* Chain [1096]: 3*s(1121)+15*s(1137)+6*s(1138)+18*s(1139)+6*s(1140)+6*s(1141)+6*s(1142)+6*s(1144)+12*s(1145)+6*s(1146)+6*s(1147)+6*s(1148)+5*s(1149)+0
  Such that:s(1124) =< 2
s(1125) =< 3
s(1126) =< 4
aux(75) =< 5
s(1128) =< 6
s(1129) =< 8
s(1130) =< 9
s(1131) =< 12
s(1132) =< 25
s(1133) =< 5/2
s(1134) =< 7/2
s(1135) =< 11/2
aux(76) =< D/2
s(1121) =< aux(76)
s(1137) =< aux(75)
s(1138) =< s(1128)
s(1139) =< s(1125)
s(1140) =< s(1134)
s(1141) =< s(1129)
s(1142) =< s(1130)
s(1144) =< s(1135)
s(1145) =< s(1131)
s(1146) =< s(1124)
s(1147) =< s(1126)
s(1148) =< s(1133)
s(1149) =< s(1132)

  with precondition: [A=37,C=2,D>=3] 


#### Cost of chains of f700_loop_cont(A,B,C,D,E):
* Chain [1103]: 0
  with precondition: [A=3,C=2] 

* Chain [1102]: 0
  with precondition: [A=38,C=2] 

* Chain [1101]: 1297/2
  with precondition: [A=38,C=2,1>=D] 

* Chain [1100]: 3*s(1176)+9*s(1192)+15*s(1193)+6*s(1194)+18*s(1195)+6*s(1196)+6*s(1197)+6*s(1198)+6*s(1199)+12*s(1200)+6*s(1201)+6*s(1202)+5*s(1204)+0
  Such that:s(1179) =< 2
s(1180) =< 3
s(1181) =< 4
s(1182) =< 5
s(1183) =< 6
s(1184) =< 8
s(1185) =< 9
s(1186) =< 12
s(1187) =< 25
aux(78) =< 5/2
s(1189) =< 7/2
s(1190) =< 11/2
aux(79) =< D
s(1176) =< aux(79)
s(1192) =< aux(78)
s(1193) =< s(1182)
s(1194) =< s(1183)
s(1195) =< s(1180)
s(1196) =< s(1189)
s(1197) =< s(1184)
s(1198) =< s(1185)
s(1199) =< s(1190)
s(1200) =< s(1186)
s(1201) =< s(1179)
s(1202) =< s(1181)
s(1204) =< s(1187)

  with precondition: [A=38,C=2,D>=2] 


#### Cost of chains of f692_loop_cont(A,B,C,D,E):
* Chain [1107]: 0
  with precondition: [A=3,C=2] 

* Chain [1106]: 0
  with precondition: [A=39,C=2] 

* Chain [1105]: 1327/2
  with precondition: [A=39,C=2,2>=D] 

* Chain [1104]: 3*s(1231)+18*s(1247)+9*s(1248)+6*s(1250)+18*s(1251)+6*s(1252)+6*s(1253)+6*s(1254)+6*s(1255)+12*s(1256)+6*s(1257)+6*s(1258)+5*s(1259)+0
  Such that:s(1234) =< 2
s(1235) =< 3
s(1236) =< 4
aux(81) =< 5
s(1238) =< 6
s(1239) =< 8
s(1240) =< 9
s(1241) =< 12
s(1242) =< 25
s(1243) =< 5/2
s(1244) =< 7/2
s(1245) =< 11/2
aux(82) =< D/2
s(1231) =< aux(82)
s(1247) =< aux(81)
s(1248) =< s(1243)
s(1250) =< s(1238)
s(1251) =< s(1235)
s(1252) =< s(1244)
s(1253) =< s(1239)
s(1254) =< s(1240)
s(1255) =< s(1245)
s(1256) =< s(1241)
s(1257) =< s(1234)
s(1258) =< s(1236)
s(1259) =< s(1242)

  with precondition: [A=39,C=2,D>=3] 


#### Cost of chains of f686_loop_cont(A,B,C,D,E):
* Chain [1111]: 0
  with precondition: [A=3,C=2] 

* Chain [1110]: 0
  with precondition: [A=40,C=2] 

* Chain [1109]: 671
  with precondition: [A=40,C=2,0>=D+9] 

* Chain [1108]: 3*s(1286)+12*s(1302)+18*s(1303)+6*s(1305)+18*s(1306)+6*s(1307)+6*s(1308)+6*s(1309)+6*s(1310)+12*s(1311)+6*s(1312)+6*s(1313)+5*s(1314)+0
  Such that:s(1289) =< 2
s(1290) =< 3
s(1291) =< 4
s(1292) =< 5
s(1293) =< 6
s(1294) =< 8
s(1295) =< 9
s(1296) =< 12
s(1297) =< 25
aux(84) =< 5/2
s(1299) =< 7/2
s(1300) =< 11/2
aux(85) =< D+9
s(1286) =< aux(85)
s(1302) =< aux(84)
s(1303) =< s(1292)
s(1305) =< s(1293)
s(1306) =< s(1290)
s(1307) =< s(1299)
s(1308) =< s(1294)
s(1309) =< s(1295)
s(1310) =< s(1300)
s(1311) =< s(1296)
s(1312) =< s(1289)
s(1313) =< s(1291)
s(1314) =< s(1297)

  with precondition: [A=40,C=2,D+8>=0] 


#### Cost of chains of f680_loop_cont(A,B,C,D,E):
* Chain [1115]: 0
  with precondition: [A=3,C=2] 

* Chain [1114]: 0
  with precondition: [A=41,C=2] 

* Chain [1113]: 746
  with precondition: [A=41,C=2,0>=D+8] 

* Chain [1112]: 3*s(1341)+8*s(1357)+12*s(1358)+18*s(1359)+6*s(1360)+18*s(1361)+6*s(1362)+6*s(1363)+6*s(1364)+6*s(1365)+12*s(1366)+6*s(1367)+6*s(1368)+0
  Such that:s(1344) =< 2
s(1345) =< 3
s(1346) =< 4
s(1347) =< 5
s(1348) =< 6
s(1349) =< 8
s(1350) =< 9
s(1351) =< 12
aux(87) =< 25
s(1353) =< 5/2
s(1354) =< 7/2
s(1355) =< 11/2
aux(88) =< D+8
s(1341) =< aux(88)
s(1357) =< aux(87)
s(1358) =< s(1353)
s(1359) =< s(1347)
s(1360) =< s(1348)
s(1361) =< s(1345)
s(1362) =< s(1354)
s(1363) =< s(1349)
s(1364) =< s(1350)
s(1365) =< s(1355)
s(1366) =< s(1351)
s(1367) =< s(1344)
s(1368) =< s(1346)

  with precondition: [A=41,C=2,D+7>=0] 


#### Cost of chains of f674_loop_cont(A,B,C,D,E):
* Chain [1119]: 0
  with precondition: [A=3,C=2] 

* Chain [1118]: 0
  with precondition: [A=42,C=2] 

* Chain [1117]: 818
  with precondition: [A=42,C=2,0>=D+9] 

* Chain [1116]: 3*s(1396)+3*s(1412)+8*s(1413)+12*s(1414)+18*s(1415)+6*s(1416)+18*s(1417)+6*s(1418)+6*s(1419)+6*s(1420)+6*s(1421)+12*s(1422)+6*s(1423)+6*s(1424)+0
  Such that:s(1399) =< 2
s(1400) =< 3
s(1401) =< 4
s(1402) =< 5
s(1403) =< 6
s(1404) =< 8
s(1405) =< 9
s(1406) =< 12
s(1411) =< 24
s(1407) =< 25
s(1408) =< 5/2
s(1409) =< 7/2
s(1410) =< 11/2
aux(89) =< D+9
s(1396) =< aux(89)
s(1412) =< s(1411)
s(1413) =< s(1407)
s(1414) =< s(1408)
s(1415) =< s(1402)
s(1416) =< s(1403)
s(1417) =< s(1400)
s(1418) =< s(1409)
s(1419) =< s(1404)
s(1420) =< s(1405)
s(1421) =< s(1410)
s(1422) =< s(1406)
s(1423) =< s(1399)
s(1424) =< s(1401)

  with precondition: [A=42,C=2,D+8>=0] 


#### Cost of chains of f666_loop_cont(A,B,C,D,E):
* Chain [1123]: 0
  with precondition: [A=3,C=2] 

* Chain [1122]: 0
  with precondition: [A=43,C=2] 

* Chain [1121]: 893
  with precondition: [A=43,C=2,0>=D+8] 

* Chain [1120]: 3*s(1453)+11*s(1470)+3*s(1471)+12*s(1473)+18*s(1474)+6*s(1475)+18*s(1476)+6*s(1477)+6*s(1478)+6*s(1479)+6*s(1480)+12*s(1481)+6*s(1482)+6*s(1483)+0
  Such that:s(1456) =< 2
s(1457) =< 3
s(1458) =< 4
s(1459) =< 5
s(1460) =< 6
s(1461) =< 8
s(1462) =< 9
s(1463) =< 12
s(1464) =< 24
aux(91) =< 25
s(1466) =< 5/2
s(1467) =< 7/2
s(1468) =< 11/2
aux(92) =< D+8
s(1453) =< aux(92)
s(1470) =< aux(91)
s(1471) =< s(1464)
s(1473) =< s(1466)
s(1474) =< s(1459)
s(1475) =< s(1460)
s(1476) =< s(1457)
s(1477) =< s(1467)
s(1478) =< s(1461)
s(1479) =< s(1462)
s(1480) =< s(1468)
s(1481) =< s(1463)
s(1482) =< s(1456)
s(1483) =< s(1458)

  with precondition: [A=43,C=2,D+7>=0] 


#### Cost of chains of f660_loop_cont(A,B,C,D,E):
* Chain [1127]: 0
  with precondition: [A=3,C=2] 

* Chain [1126]: 0
  with precondition: [A=44,C=2] 

* Chain [1125]: 965
  with precondition: [A=44,C=2,0>=D+8] 

* Chain [1124]: 3*s(1512)+6*s(1529)+11*s(1530)+12*s(1532)+18*s(1533)+6*s(1534)+18*s(1535)+6*s(1536)+6*s(1537)+6*s(1538)+6*s(1539)+12*s(1540)+6*s(1541)+6*s(1542)+0
  Such that:s(1515) =< 2
s(1516) =< 3
s(1517) =< 4
s(1518) =< 5
s(1519) =< 6
s(1520) =< 8
s(1521) =< 9
s(1522) =< 12
aux(94) =< 24
s(1524) =< 25
s(1525) =< 5/2
s(1526) =< 7/2
s(1527) =< 11/2
aux(95) =< D+8
s(1512) =< aux(95)
s(1529) =< aux(94)
s(1530) =< s(1524)
s(1532) =< s(1525)
s(1533) =< s(1518)
s(1534) =< s(1519)
s(1535) =< s(1516)
s(1536) =< s(1526)
s(1537) =< s(1520)
s(1538) =< s(1521)
s(1539) =< s(1527)
s(1540) =< s(1522)
s(1541) =< s(1515)
s(1542) =< s(1517)

  with precondition: [A=44,C=2,D+7>=0] 


#### Cost of chains of f654_loop_cont(A,B,C,D,E):
* Chain [1131]: 0
  with precondition: [A=3,C=2] 

* Chain [1130]: 0
  with precondition: [A=45,C=2] 

* Chain [1129]: 983
  with precondition: [A=45,C=2,0>=D+7] 

* Chain [1128]: 3*s(1571)+9*s(1588)+6*s(1589)+11*s(1590)+12*s(1591)+18*s(1592)+18*s(1594)+6*s(1595)+6*s(1596)+6*s(1597)+6*s(1598)+12*s(1599)+6*s(1600)+6*s(1601)+0
  Such that:s(1574) =< 2
s(1575) =< 3
s(1576) =< 4
s(1577) =< 5
aux(97) =< 6
s(1579) =< 8
s(1580) =< 9
s(1581) =< 12
s(1582) =< 24
s(1583) =< 25
s(1584) =< 5/2
s(1585) =< 7/2
s(1586) =< 11/2
aux(98) =< D+7
s(1571) =< aux(98)
s(1588) =< aux(97)
s(1589) =< s(1582)
s(1590) =< s(1583)
s(1591) =< s(1584)
s(1592) =< s(1577)
s(1594) =< s(1575)
s(1595) =< s(1585)
s(1596) =< s(1579)
s(1597) =< s(1580)
s(1598) =< s(1586)
s(1599) =< s(1581)
s(1600) =< s(1574)
s(1601) =< s(1576)

  with precondition: [A=45,C=2,D+6>=0] 


#### Cost of chains of f648_loop_cont(A,B,C,D,E):
* Chain [1135]: 0
  with precondition: [A=3,C=2] 

* Chain [1134]: 0
  with precondition: [A=46,C=2] 

* Chain [1133]: 998
  with precondition: [A=46,C=2,0>=D+8] 

* Chain [1132]: 3*s(1630)+21*s(1647)+9*s(1648)+6*s(1649)+11*s(1650)+12*s(1651)+18*s(1653)+6*s(1654)+6*s(1655)+6*s(1656)+6*s(1657)+12*s(1658)+6*s(1659)+6*s(1660)+0
  Such that:s(1633) =< 2
s(1634) =< 3
s(1635) =< 4
aux(100) =< 5
s(1637) =< 6
s(1638) =< 8
s(1639) =< 9
s(1640) =< 12
s(1641) =< 24
s(1642) =< 25
s(1643) =< 5/2
s(1644) =< 7/2
s(1645) =< 11/2
aux(101) =< D+8
s(1630) =< aux(101)
s(1647) =< aux(100)
s(1648) =< s(1637)
s(1649) =< s(1641)
s(1650) =< s(1642)
s(1651) =< s(1643)
s(1653) =< s(1634)
s(1654) =< s(1644)
s(1655) =< s(1638)
s(1656) =< s(1639)
s(1657) =< s(1645)
s(1658) =< s(1640)
s(1659) =< s(1633)
s(1660) =< s(1635)

  with precondition: [A=46,C=2,D+7>=0] 


#### Cost of chains of f640_loop_cont(A,B,C,D,E):
* Chain [1139]: 0
  with precondition: [A=3,C=2] 

* Chain [1138]: 0
  with precondition: [A=47,C=2] 

* Chain [1137]: 1016
  with precondition: [A=47,C=2,0>=D+7] 

* Chain [1136]: 3*s(1689)+12*s(1706)+21*s(1707)+6*s(1709)+11*s(1710)+12*s(1711)+18*s(1712)+6*s(1713)+6*s(1714)+6*s(1715)+6*s(1716)+12*s(1717)+6*s(1718)+6*s(1719)+0
  Such that:s(1692) =< 2
s(1693) =< 3
s(1694) =< 4
s(1695) =< 5
aux(103) =< 6
s(1697) =< 8
s(1698) =< 9
s(1699) =< 12
s(1700) =< 24
s(1701) =< 25
s(1702) =< 5/2
s(1703) =< 7/2
s(1704) =< 11/2
aux(104) =< D+7
s(1689) =< aux(104)
s(1706) =< aux(103)
s(1707) =< s(1695)
s(1709) =< s(1700)
s(1710) =< s(1701)
s(1711) =< s(1702)
s(1712) =< s(1693)
s(1713) =< s(1703)
s(1714) =< s(1697)
s(1715) =< s(1698)
s(1716) =< s(1704)
s(1717) =< s(1699)
s(1718) =< s(1692)
s(1719) =< s(1694)

  with precondition: [A=47,C=2,D+6>=0] 


#### Cost of chains of f634_loop_cont(A,B,C,D,E):
* Chain [1143]: 0
  with precondition: [A=3,C=2] 

* Chain [1142]: 0
  with precondition: [A=48,C=2] 

* Chain [1141]: 1031
  with precondition: [A=48,C=2,0>=D+6] 

* Chain [1140]: 3*s(1748)+24*s(1765)+12*s(1766)+6*s(1768)+11*s(1769)+12*s(1770)+18*s(1771)+6*s(1772)+6*s(1773)+6*s(1774)+6*s(1775)+12*s(1776)+6*s(1777)+6*s(1778)+0
  Such that:s(1751) =< 2
s(1752) =< 3
s(1753) =< 4
aux(106) =< 5
s(1755) =< 6
s(1756) =< 8
s(1757) =< 9
s(1758) =< 12
s(1759) =< 24
s(1760) =< 25
s(1761) =< 5/2
s(1762) =< 7/2
s(1763) =< 11/2
aux(107) =< D+6
s(1748) =< aux(107)
s(1765) =< aux(106)
s(1766) =< s(1755)
s(1768) =< s(1759)
s(1769) =< s(1760)
s(1770) =< s(1761)
s(1771) =< s(1752)
s(1772) =< s(1762)
s(1773) =< s(1756)
s(1774) =< s(1757)
s(1775) =< s(1763)
s(1776) =< s(1758)
s(1777) =< s(1751)
s(1778) =< s(1753)

  with precondition: [A=48,C=2,D+5>=0] 


#### Cost of chains of f628_loop_cont(A,B,C,D,E):
* Chain [1147]: 0
  with precondition: [A=3,C=2] 

* Chain [1146]: 0
  with precondition: [A=49,C=2] 

* Chain [1145]: 1046
  with precondition: [A=49,C=2,0>=D+5] 

* Chain [1144]: 3*s(1807)+27*s(1824)+12*s(1826)+6*s(1827)+11*s(1828)+12*s(1829)+18*s(1830)+6*s(1831)+6*s(1832)+6*s(1833)+6*s(1834)+12*s(1835)+6*s(1836)+6*s(1837)+0
  Such that:s(1810) =< 2
s(1811) =< 3
s(1812) =< 4
aux(109) =< 5
s(1814) =< 6
s(1815) =< 8
s(1816) =< 9
s(1817) =< 12
s(1818) =< 24
s(1819) =< 25
s(1820) =< 5/2
s(1821) =< 7/2
s(1822) =< 11/2
aux(110) =< D+5
s(1807) =< aux(110)
s(1824) =< aux(109)
s(1826) =< s(1814)
s(1827) =< s(1818)
s(1828) =< s(1819)
s(1829) =< s(1820)
s(1830) =< s(1811)
s(1831) =< s(1821)
s(1832) =< s(1815)
s(1833) =< s(1816)
s(1834) =< s(1822)
s(1835) =< s(1817)
s(1836) =< s(1810)
s(1837) =< s(1812)

  with precondition: [A=49,C=2,D+4>=0] 


#### Cost of chains of f622_loop_cont(A,B,C,D,E):
* Chain [1151]: 0
  with precondition: [A=3,C=2] 

* Chain [1150]: 0
  with precondition: [A=50,C=2] 

* Chain [1149]: 1058
  with precondition: [A=50,C=2,0>=D+6] 

* Chain [1148]: 3*s(1866)+9*s(1883)+27*s(1884)+12*s(1885)+6*s(1886)+11*s(1887)+12*s(1888)+18*s(1889)+6*s(1890)+6*s(1891)+6*s(1892)+6*s(1893)+12*s(1894)+6*s(1895)+0
  Such that:s(1869) =< 2
s(1870) =< 3
aux(112) =< 4
s(1872) =< 5
s(1873) =< 6
s(1874) =< 8
s(1875) =< 9
s(1876) =< 12
s(1877) =< 24
s(1878) =< 25
s(1879) =< 5/2
s(1880) =< 7/2
s(1881) =< 11/2
aux(113) =< D+6
s(1866) =< aux(113)
s(1883) =< aux(112)
s(1884) =< s(1872)
s(1885) =< s(1873)
s(1886) =< s(1877)
s(1887) =< s(1878)
s(1888) =< s(1879)
s(1889) =< s(1870)
s(1890) =< s(1880)
s(1891) =< s(1874)
s(1892) =< s(1875)
s(1893) =< s(1881)
s(1894) =< s(1876)
s(1895) =< s(1869)

  with precondition: [A=50,C=2,D+5>=0] 


#### Cost of chains of f614_loop_cont(A,B,C,D,E):
* Chain [1155]: 0
  with precondition: [A=3,C=2] 

* Chain [1154]: 0
  with precondition: [A=51,C=2] 

* Chain [1153]: 1073
  with precondition: [A=51,C=2,0>=D+5] 

* Chain [1152]: 3*s(1925)+30*s(1942)+9*s(1943)+12*s(1945)+6*s(1946)+11*s(1947)+12*s(1948)+18*s(1949)+6*s(1950)+6*s(1951)+6*s(1952)+6*s(1953)+12*s(1954)+6*s(1955)+0
  Such that:s(1928) =< 2
s(1929) =< 3
s(1930) =< 4
aux(115) =< 5
s(1932) =< 6
s(1933) =< 8
s(1934) =< 9
s(1935) =< 12
s(1936) =< 24
s(1937) =< 25
s(1938) =< 5/2
s(1939) =< 7/2
s(1940) =< 11/2
aux(116) =< D+5
s(1925) =< aux(116)
s(1942) =< aux(115)
s(1943) =< s(1930)
s(1945) =< s(1932)
s(1946) =< s(1936)
s(1947) =< s(1937)
s(1948) =< s(1938)
s(1949) =< s(1929)
s(1950) =< s(1939)
s(1951) =< s(1933)
s(1952) =< s(1934)
s(1953) =< s(1940)
s(1954) =< s(1935)
s(1955) =< s(1928)

  with precondition: [A=51,C=2,D+4>=0] 


#### Cost of chains of f608_loop_cont(A,B,C,D,E):
* Chain [1159]: 0
  with precondition: [A=3,C=2] 

* Chain [1158]: 0
  with precondition: [A=52,C=2] 

* Chain [1157]: 1085
  with precondition: [A=52,C=2,0>=D+4] 

* Chain [1156]: 3*s(1984)+12*s(2001)+30*s(2002)+12*s(2004)+6*s(2005)+11*s(2006)+12*s(2007)+18*s(2008)+6*s(2009)+6*s(2010)+6*s(2011)+6*s(2012)+12*s(2013)+6*s(2014)+0
  Such that:s(1987) =< 2
s(1988) =< 3
aux(118) =< 4
s(1990) =< 5
s(1991) =< 6
s(1992) =< 8
s(1993) =< 9
s(1994) =< 12
s(1995) =< 24
s(1996) =< 25
s(1997) =< 5/2
s(1998) =< 7/2
s(1999) =< 11/2
aux(119) =< D+4
s(1984) =< aux(119)
s(2001) =< aux(118)
s(2002) =< s(1990)
s(2004) =< s(1991)
s(2005) =< s(1995)
s(2006) =< s(1996)
s(2007) =< s(1997)
s(2008) =< s(1988)
s(2009) =< s(1998)
s(2010) =< s(1992)
s(2011) =< s(1993)
s(2012) =< s(1999)
s(2013) =< s(1994)
s(2014) =< s(1987)

  with precondition: [A=52,C=2,D+3>=0] 


#### Cost of chains of f602_loop_cont(A,B,C,D,E):
* Chain [1163]: 0
  with precondition: [A=3,C=2] 

* Chain [1162]: 0
  with precondition: [A=53,C=2] 

* Chain [1161]: 1097
  with precondition: [A=53,C=2,0>=D+3] 

* Chain [1160]: 3*s(2043)+15*s(2060)+30*s(2062)+12*s(2063)+6*s(2064)+11*s(2065)+12*s(2066)+18*s(2067)+6*s(2068)+6*s(2069)+6*s(2070)+6*s(2071)+12*s(2072)+6*s(2073)+0
  Such that:s(2046) =< 2
s(2047) =< 3
aux(121) =< 4
s(2049) =< 5
s(2050) =< 6
s(2051) =< 8
s(2052) =< 9
s(2053) =< 12
s(2054) =< 24
s(2055) =< 25
s(2056) =< 5/2
s(2057) =< 7/2
s(2058) =< 11/2
aux(122) =< D+3
s(2043) =< aux(122)
s(2060) =< aux(121)
s(2062) =< s(2049)
s(2063) =< s(2050)
s(2064) =< s(2054)
s(2065) =< s(2055)
s(2066) =< s(2056)
s(2067) =< s(2047)
s(2068) =< s(2057)
s(2069) =< s(2051)
s(2070) =< s(2052)
s(2071) =< s(2058)
s(2072) =< s(2053)
s(2073) =< s(2046)

  with precondition: [A=53,C=2,D+2>=0] 


#### Cost of chains of f596_loop_cont(A,B,C,D,E):
* Chain [1167]: 0
  with precondition: [A=3,C=2] 

* Chain [1166]: 0
  with precondition: [A=54,C=2] 

* Chain [1165]: 1106
  with precondition: [A=54,C=2,0>=D+4] 

* Chain [1164]: 3*s(2102)+21*s(2119)+15*s(2120)+30*s(2121)+12*s(2122)+6*s(2123)+11*s(2124)+12*s(2125)+6*s(2127)+6*s(2128)+6*s(2129)+6*s(2130)+12*s(2131)+6*s(2132)+0
  Such that:s(2105) =< 2
aux(124) =< 3
s(2107) =< 4
s(2108) =< 5
s(2109) =< 6
s(2110) =< 8
s(2111) =< 9
s(2112) =< 12
s(2113) =< 24
s(2114) =< 25
s(2115) =< 5/2
s(2116) =< 7/2
s(2117) =< 11/2
aux(125) =< D+4
s(2102) =< aux(125)
s(2119) =< aux(124)
s(2120) =< s(2107)
s(2121) =< s(2108)
s(2122) =< s(2109)
s(2123) =< s(2113)
s(2124) =< s(2114)
s(2125) =< s(2115)
s(2127) =< s(2116)
s(2128) =< s(2110)
s(2129) =< s(2111)
s(2130) =< s(2117)
s(2131) =< s(2112)
s(2132) =< s(2105)

  with precondition: [A=54,C=2,D+3>=0] 


#### Cost of chains of f588_loop_cont(A,B,C,D,E):
* Chain [1171]: 0
  with precondition: [A=3,C=2] 

* Chain [1170]: 0
  with precondition: [A=55,C=2] 

* Chain [1169]: 1118
  with precondition: [A=55,C=2,0>=D+3] 

* Chain [1168]: 3*s(2161)+18*s(2178)+21*s(2179)+30*s(2181)+12*s(2182)+6*s(2183)+11*s(2184)+12*s(2185)+6*s(2186)+6*s(2187)+6*s(2188)+6*s(2189)+12*s(2190)+6*s(2191)+0
  Such that:s(2164) =< 2
s(2165) =< 3
aux(127) =< 4
s(2167) =< 5
s(2168) =< 6
s(2169) =< 8
s(2170) =< 9
s(2171) =< 12
s(2172) =< 24
s(2173) =< 25
s(2174) =< 5/2
s(2175) =< 7/2
s(2176) =< 11/2
aux(128) =< D+3
s(2161) =< aux(128)
s(2178) =< aux(127)
s(2179) =< s(2165)
s(2181) =< s(2167)
s(2182) =< s(2168)
s(2183) =< s(2172)
s(2184) =< s(2173)
s(2185) =< s(2174)
s(2186) =< s(2175)
s(2187) =< s(2169)
s(2188) =< s(2170)
s(2189) =< s(2176)
s(2190) =< s(2171)
s(2191) =< s(2164)

  with precondition: [A=55,C=2,D+2>=0] 


#### Cost of chains of f582_loop_cont(A,B,C,D,E):
* Chain [1175]: 0
  with precondition: [A=3,C=2] 

* Chain [1174]: 0
  with precondition: [A=56,C=2] 

* Chain [1173]: 1127
  with precondition: [A=56,C=2,0>=D+3] 

* Chain [1172]: 3*s(2220)+24*s(2237)+18*s(2238)+30*s(2240)+12*s(2241)+6*s(2242)+11*s(2243)+12*s(2244)+6*s(2245)+6*s(2246)+6*s(2247)+6*s(2248)+12*s(2249)+6*s(2250)+0
  Such that:s(2223) =< 2
aux(130) =< 3
s(2225) =< 4
s(2226) =< 5
s(2227) =< 6
s(2228) =< 8
s(2229) =< 9
s(2230) =< 12
s(2231) =< 24
s(2232) =< 25
s(2233) =< 5/2
s(2234) =< 7/2
s(2235) =< 11/2
aux(131) =< D+3
s(2220) =< aux(131)
s(2237) =< aux(130)
s(2238) =< s(2225)
s(2240) =< s(2226)
s(2241) =< s(2227)
s(2242) =< s(2231)
s(2243) =< s(2232)
s(2244) =< s(2233)
s(2245) =< s(2234)
s(2246) =< s(2228)
s(2247) =< s(2229)
s(2248) =< s(2235)
s(2249) =< s(2230)
s(2250) =< s(2223)

  with precondition: [A=56,C=2,D+2>=0] 


#### Cost of chains of f576_loop_cont(A,B,C,D,E):
* Chain [1179]: 0
  with precondition: [A=3,C=2] 

* Chain [1178]: 0
  with precondition: [A=57,C=2] 

* Chain [1177]: 1163
  with precondition: [A=57,C=2,0>=D+2] 

* Chain [1176]: 3*s(2279)+15*s(2296)+24*s(2297)+18*s(2298)+30*s(2299)+12*s(2300)+6*s(2301)+11*s(2302)+12*s(2303)+6*s(2304)+6*s(2305)+6*s(2306)+6*s(2307)+6*s(2309)+0
  Such that:s(2282) =< 2
s(2283) =< 3
s(2284) =< 4
s(2285) =< 5
s(2286) =< 6
s(2287) =< 8
s(2288) =< 9
aux(133) =< 12
s(2290) =< 24
s(2291) =< 25
s(2292) =< 5/2
s(2293) =< 7/2
s(2294) =< 11/2
aux(134) =< D+2
s(2279) =< aux(134)
s(2296) =< aux(133)
s(2297) =< s(2283)
s(2298) =< s(2284)
s(2299) =< s(2285)
s(2300) =< s(2286)
s(2301) =< s(2290)
s(2302) =< s(2291)
s(2303) =< s(2292)
s(2304) =< s(2293)
s(2305) =< s(2287)
s(2306) =< s(2288)
s(2307) =< s(2294)
s(2309) =< s(2282)

  with precondition: [A=57,C=2,D+1>=0] 


#### Cost of chains of f570_loop_cont(A,B,C,D,E):
* Chain [1183]: 0
  with precondition: [A=3,C=2] 

* Chain [1182]: 0
  with precondition: [A=58,C=2] 

* Chain [1181]: 1196
  with precondition: [A=58,C=2,0>=D+3] 

* Chain [1180]: 3*s(2338)+3*s(2355)+15*s(2356)+24*s(2357)+18*s(2358)+30*s(2359)+12*s(2360)+6*s(2361)+11*s(2362)+12*s(2363)+6*s(2364)+6*s(2365)+6*s(2366)+6*s(2367)+6*s(2368)+0
  Such that:s(2341) =< 2
s(2342) =< 3
s(2343) =< 4
s(2344) =< 5
s(2345) =< 6
s(2346) =< 8
s(2347) =< 9
s(2354) =< 11
s(2348) =< 12
s(2349) =< 24
s(2350) =< 25
s(2351) =< 5/2
s(2352) =< 7/2
s(2353) =< 11/2
aux(135) =< D+3
s(2338) =< aux(135)
s(2355) =< s(2354)
s(2356) =< s(2348)
s(2357) =< s(2342)
s(2358) =< s(2343)
s(2359) =< s(2344)
s(2360) =< s(2345)
s(2361) =< s(2349)
s(2362) =< s(2350)
s(2363) =< s(2351)
s(2364) =< s(2352)
s(2365) =< s(2346)
s(2366) =< s(2347)
s(2367) =< s(2353)
s(2368) =< s(2341)

  with precondition: [A=58,C=2,D+2>=0] 


#### Cost of chains of f562_loop_cont(A,B,C,D,E):
* Chain [1187]: 0
  with precondition: [A=3,C=2] 

* Chain [1186]: 0
  with precondition: [A=59,C=2] 

* Chain [1185]: 1232
  with precondition: [A=59,C=2,0>=D+2] 

* Chain [1184]: 3*s(2399)+18*s(2417)+3*s(2418)+24*s(2420)+18*s(2421)+30*s(2422)+12*s(2423)+6*s(2424)+11*s(2425)+12*s(2426)+6*s(2427)+6*s(2428)+6*s(2429)+6*s(2430)+6*s(2431)+0
  Such that:s(2402) =< 2
s(2403) =< 3
s(2404) =< 4
s(2405) =< 5
s(2406) =< 6
s(2407) =< 8
s(2408) =< 9
s(2409) =< 11
aux(137) =< 12
s(2411) =< 24
s(2412) =< 25
s(2413) =< 5/2
s(2414) =< 7/2
s(2415) =< 11/2
aux(138) =< D+2
s(2399) =< aux(138)
s(2417) =< aux(137)
s(2418) =< s(2409)
s(2420) =< s(2403)
s(2421) =< s(2404)
s(2422) =< s(2405)
s(2423) =< s(2406)
s(2424) =< s(2411)
s(2425) =< s(2412)
s(2426) =< s(2413)
s(2427) =< s(2414)
s(2428) =< s(2407)
s(2429) =< s(2408)
s(2430) =< s(2415)
s(2431) =< s(2402)

  with precondition: [A=59,C=2,D+1>=0] 


#### Cost of chains of f556_loop_cont(A,B,C,D,E):
* Chain [1191]: 0
  with precondition: [A=3,C=2] 

* Chain [1190]: 0
  with precondition: [A=60,C=2] 

* Chain [1189]: 1265
  with precondition: [A=60,C=2,0>=D+2] 

* Chain [1188]: 3*s(2462)+6*s(2480)+18*s(2481)+24*s(2483)+18*s(2484)+30*s(2485)+12*s(2486)+6*s(2487)+11*s(2488)+12*s(2489)+6*s(2490)+6*s(2491)+6*s(2492)+6*s(2493)+6*s(2494)+0
  Such that:s(2465) =< 2
s(2466) =< 3
s(2467) =< 4
s(2468) =< 5
s(2469) =< 6
s(2470) =< 8
s(2471) =< 9
aux(140) =< 11
s(2473) =< 12
s(2474) =< 24
s(2475) =< 25
s(2476) =< 5/2
s(2477) =< 7/2
s(2478) =< 11/2
aux(141) =< D+2
s(2462) =< aux(141)
s(2480) =< aux(140)
s(2481) =< s(2473)
s(2483) =< s(2466)
s(2484) =< s(2467)
s(2485) =< s(2468)
s(2486) =< s(2469)
s(2487) =< s(2474)
s(2488) =< s(2475)
s(2489) =< s(2476)
s(2490) =< s(2477)
s(2491) =< s(2470)
s(2492) =< s(2471)
s(2493) =< s(2478)
s(2494) =< s(2465)

  with precondition: [A=60,C=2,D+1>=0] 


#### Cost of chains of f550_loop_cont(A,B,C,D,E):
* Chain [1195]: 0
  with precondition: [A=3,C=2] 

* Chain [1194]: 0
  with precondition: [A=61,C=2] 

* Chain [1193]: 1295
  with precondition: [A=61,C=2,0>=D+1] 

* Chain [1192]: 3*s(2525)+3*s(2543)+6*s(2544)+18*s(2545)+24*s(2546)+18*s(2547)+30*s(2548)+12*s(2549)+6*s(2550)+11*s(2551)+12*s(2552)+6*s(2553)+6*s(2554)+6*s(2555)+6*s(2556)+6*s(2557)+0
  Such that:s(2528) =< 2
s(2529) =< 3
s(2530) =< 4
s(2531) =< 5
s(2532) =< 6
s(2533) =< 8
s(2534) =< 9
s(2542) =< 10
s(2535) =< 11
s(2536) =< 12
s(2537) =< 24
s(2538) =< 25
s(2539) =< 5/2
s(2540) =< 7/2
s(2541) =< 11/2
aux(142) =< D+1
s(2525) =< aux(142)
s(2543) =< s(2542)
s(2544) =< s(2535)
s(2545) =< s(2536)
s(2546) =< s(2529)
s(2547) =< s(2530)
s(2548) =< s(2531)
s(2549) =< s(2532)
s(2550) =< s(2537)
s(2551) =< s(2538)
s(2552) =< s(2539)
s(2553) =< s(2540)
s(2554) =< s(2533)
s(2555) =< s(2534)
s(2556) =< s(2541)
s(2557) =< s(2528)

  with precondition: [A=61,C=2,D>=0] 


#### Cost of chains of f544_loop_cont(A,B,C,D,E):
* Chain [1199]: 0
  with precondition: [A=3,C=2] 

* Chain [1198]: 0
  with precondition: [A=62,C=2] 

* Chain [1197]: 1322
  with precondition: [A=62,C=2,0>=D+2] 

* Chain [1196]: 3*s(2590)+9*s(2609)+3*s(2610)+6*s(2611)+18*s(2612)+24*s(2613)+18*s(2614)+30*s(2615)+12*s(2616)+6*s(2617)+11*s(2618)+12*s(2619)+6*s(2620)+6*s(2621)+6*s(2623)+6*s(2624)+0
  Such that:s(2593) =< 2
s(2594) =< 3
s(2595) =< 4
s(2596) =< 5
s(2597) =< 6
s(2598) =< 8
aux(144) =< 9
s(2600) =< 10
s(2601) =< 11
s(2602) =< 12
s(2603) =< 24
s(2604) =< 25
s(2605) =< 5/2
s(2606) =< 7/2
s(2607) =< 11/2
aux(145) =< D+2
s(2590) =< aux(145)
s(2609) =< aux(144)
s(2610) =< s(2600)
s(2611) =< s(2601)
s(2612) =< s(2602)
s(2613) =< s(2594)
s(2614) =< s(2595)
s(2615) =< s(2596)
s(2616) =< s(2597)
s(2617) =< s(2603)
s(2618) =< s(2604)
s(2619) =< s(2605)
s(2620) =< s(2606)
s(2621) =< s(2598)
s(2623) =< s(2607)
s(2624) =< s(2593)

  with precondition: [A=62,C=2,D+1>=0] 


#### Cost of chains of f536_loop_cont(A,B,C,D,E):
* Chain [1203]: 0
  with precondition: [A=3,C=2] 

* Chain [1202]: 0
  with precondition: [A=63,C=2] 

* Chain [1201]: 1352
  with precondition: [A=63,C=2,0>=D+1] 

* Chain [1200]: 3*s(2657)+6*s(2676)+9*s(2677)+6*s(2679)+18*s(2680)+24*s(2681)+18*s(2682)+30*s(2683)+12*s(2684)+6*s(2685)+11*s(2686)+12*s(2687)+6*s(2688)+6*s(2689)+6*s(2690)+6*s(2691)+0
  Such that:s(2660) =< 2
s(2661) =< 3
s(2662) =< 4
s(2663) =< 5
s(2664) =< 6
s(2665) =< 8
s(2666) =< 9
aux(147) =< 10
s(2668) =< 11
s(2669) =< 12
s(2670) =< 24
s(2671) =< 25
s(2672) =< 5/2
s(2673) =< 7/2
s(2674) =< 11/2
aux(148) =< D+1
s(2657) =< aux(148)
s(2676) =< aux(147)
s(2677) =< s(2666)
s(2679) =< s(2668)
s(2680) =< s(2669)
s(2681) =< s(2661)
s(2682) =< s(2662)
s(2683) =< s(2663)
s(2684) =< s(2664)
s(2685) =< s(2670)
s(2686) =< s(2671)
s(2687) =< s(2672)
s(2688) =< s(2673)
s(2689) =< s(2665)
s(2690) =< s(2674)
s(2691) =< s(2660)

  with precondition: [A=63,C=2,D>=0] 


#### Cost of chains of f530_loop_cont(A,B,C,D,E):
* Chain [1207]: 0
  with precondition: [A=3,C=2] 

* Chain [1206]: 0
  with precondition: [A=64,C=2] 

* Chain [1205]: 1379
  with precondition: [A=64,C=2,0>=D+1] 

* Chain [1204]: 3*s(2724)+12*s(2743)+6*s(2744)+6*s(2746)+18*s(2747)+24*s(2748)+18*s(2749)+30*s(2750)+12*s(2751)+6*s(2752)+11*s(2753)+12*s(2754)+6*s(2755)+6*s(2756)+6*s(2757)+6*s(2758)+0
  Such that:s(2727) =< 2
s(2728) =< 3
s(2729) =< 4
s(2730) =< 5
s(2731) =< 6
s(2732) =< 8
aux(150) =< 9
s(2734) =< 10
s(2735) =< 11
s(2736) =< 12
s(2737) =< 24
s(2738) =< 25
s(2739) =< 5/2
s(2740) =< 7/2
s(2741) =< 11/2
aux(151) =< D+1
s(2724) =< aux(151)
s(2743) =< aux(150)
s(2744) =< s(2734)
s(2746) =< s(2735)
s(2747) =< s(2736)
s(2748) =< s(2728)
s(2749) =< s(2729)
s(2750) =< s(2730)
s(2751) =< s(2731)
s(2752) =< s(2737)
s(2753) =< s(2738)
s(2754) =< s(2739)
s(2755) =< s(2740)
s(2756) =< s(2732)
s(2757) =< s(2741)
s(2758) =< s(2727)

  with precondition: [A=64,C=2,D>=0] 


#### Cost of chains of f524_loop_cont(A,B,C,D,E):
* Chain [1211]: 0
  with precondition: [A=3,C=2] 

* Chain [1210]: 0
  with precondition: [A=65,C=2] 

* Chain [1209]: 1403
  with precondition: [A=65,C=2,0>=D] 

* Chain [1208]: 3*s(2791)+9*s(2810)+12*s(2811)+6*s(2812)+6*s(2813)+18*s(2814)+24*s(2815)+18*s(2816)+30*s(2817)+12*s(2818)+6*s(2819)+11*s(2820)+12*s(2821)+6*s(2822)+6*s(2824)+6*s(2825)+0
  Such that:s(2794) =< 2
s(2795) =< 3
s(2796) =< 4
s(2797) =< 5
s(2798) =< 6
aux(153) =< 8
s(2800) =< 9
s(2801) =< 10
s(2802) =< 11
s(2803) =< 12
s(2804) =< 24
s(2805) =< 25
s(2806) =< 5/2
s(2807) =< 7/2
s(2808) =< 11/2
aux(154) =< D
s(2791) =< aux(154)
s(2810) =< aux(153)
s(2811) =< s(2800)
s(2812) =< s(2801)
s(2813) =< s(2802)
s(2814) =< s(2803)
s(2815) =< s(2795)
s(2816) =< s(2796)
s(2817) =< s(2797)
s(2818) =< s(2798)
s(2819) =< s(2804)
s(2820) =< s(2805)
s(2821) =< s(2806)
s(2822) =< s(2807)
s(2824) =< s(2808)
s(2825) =< s(2794)

  with precondition: [A=65,C=2,D>=1] 


#### Cost of chains of f518_loop_cont(A,B,C,D,E):
* Chain [1215]: 0
  with precondition: [A=3,C=2] 

* Chain [1214]: 0
  with precondition: [A=66,C=2] 

* Chain [1213]: 1424
  with precondition: [A=66,C=2,0>=D+1] 

* Chain [1212]: 3*s(2858)+3*s(2877)+9*s(2878)+12*s(2879)+6*s(2880)+6*s(2881)+18*s(2882)+24*s(2883)+18*s(2884)+30*s(2885)+12*s(2886)+6*s(2887)+11*s(2888)+12*s(2889)+6*s(2890)+6*s(2891)+6*s(2892)+0
  Such that:s(2861) =< 2
s(2862) =< 3
s(2863) =< 4
s(2864) =< 5
s(2865) =< 6
s(2876) =< 7
s(2866) =< 8
s(2867) =< 9
s(2868) =< 10
s(2869) =< 11
s(2870) =< 12
s(2871) =< 24
s(2872) =< 25
s(2873) =< 5/2
s(2874) =< 7/2
s(2875) =< 11/2
aux(155) =< D+1
s(2858) =< aux(155)
s(2877) =< s(2876)
s(2878) =< s(2866)
s(2879) =< s(2867)
s(2880) =< s(2868)
s(2881) =< s(2869)
s(2882) =< s(2870)
s(2883) =< s(2862)
s(2884) =< s(2863)
s(2885) =< s(2864)
s(2886) =< s(2865)
s(2887) =< s(2871)
s(2888) =< s(2872)
s(2889) =< s(2873)
s(2890) =< s(2874)
s(2891) =< s(2875)
s(2892) =< s(2861)

  with precondition: [A=66,C=2,D>=0] 


#### Cost of chains of f510_loop_cont(A,B,C,D,E):
* Chain [1219]: 0
  with precondition: [A=3,C=2] 

* Chain [1218]: 0
  with precondition: [A=67,C=2] 

* Chain [1217]: 1448
  with precondition: [A=67,C=2,0>=D] 

* Chain [1216]: 3*s(2927)+12*s(2947)+3*s(2948)+12*s(2950)+6*s(2951)+6*s(2952)+18*s(2953)+24*s(2954)+18*s(2955)+30*s(2956)+12*s(2957)+6*s(2958)+11*s(2959)+12*s(2960)+6*s(2961)+6*s(2962)+6*s(2963)+0
  Such that:s(2930) =< 2
s(2931) =< 3
s(2932) =< 4
s(2933) =< 5
s(2934) =< 6
s(2935) =< 7
aux(157) =< 8
s(2937) =< 9
s(2938) =< 10
s(2939) =< 11
s(2940) =< 12
s(2941) =< 24
s(2942) =< 25
s(2943) =< 5/2
s(2944) =< 7/2
s(2945) =< 11/2
aux(158) =< D
s(2927) =< aux(158)
s(2947) =< aux(157)
s(2948) =< s(2935)
s(2950) =< s(2937)
s(2951) =< s(2938)
s(2952) =< s(2939)
s(2953) =< s(2940)
s(2954) =< s(2931)
s(2955) =< s(2932)
s(2956) =< s(2933)
s(2957) =< s(2934)
s(2958) =< s(2941)
s(2959) =< s(2942)
s(2960) =< s(2943)
s(2961) =< s(2944)
s(2962) =< s(2945)
s(2963) =< s(2930)

  with precondition: [A=67,C=2,D>=1] 


#### Cost of chains of f504_loop_cont(A,B,C,D,E):
* Chain [1223]: 0
  with precondition: [A=3,C=2] 

* Chain [1222]: 0
  with precondition: [A=68,C=2] 

* Chain [1221]: 1469
  with precondition: [A=68,C=2,0>=D] 

* Chain [1220]: 3*s(2998)+6*s(3018)+12*s(3019)+12*s(3021)+6*s(3022)+6*s(3023)+18*s(3024)+24*s(3025)+18*s(3026)+30*s(3027)+12*s(3028)+6*s(3029)+11*s(3030)+12*s(3031)+6*s(3032)+6*s(3033)+6*s(3034)+0
  Such that:s(3001) =< 2
s(3002) =< 3
s(3003) =< 4
s(3004) =< 5
s(3005) =< 6
aux(160) =< 7
s(3007) =< 8
s(3008) =< 9
s(3009) =< 10
s(3010) =< 11
s(3011) =< 12
s(3012) =< 24
s(3013) =< 25
s(3014) =< 5/2
s(3015) =< 7/2
s(3016) =< 11/2
aux(161) =< D
s(2998) =< aux(161)
s(3018) =< aux(160)
s(3019) =< s(3007)
s(3021) =< s(3008)
s(3022) =< s(3009)
s(3023) =< s(3010)
s(3024) =< s(3011)
s(3025) =< s(3002)
s(3026) =< s(3003)
s(3027) =< s(3004)
s(3028) =< s(3005)
s(3029) =< s(3012)
s(3030) =< s(3013)
s(3031) =< s(3014)
s(3032) =< s(3015)
s(3033) =< s(3016)
s(3034) =< s(3001)

  with precondition: [A=68,C=2,D>=1] 


#### Cost of chains of f498_loop_cont(A,B,C,D,E):
* Chain [1227]: 0
  with precondition: [A=3,C=2] 

* Chain [1226]: 0
  with precondition: [A=69,C=2] 

* Chain [1225]: 1487
  with precondition: [A=69,C=2,1>=D] 

* Chain [1224]: 3*s(3069)+15*s(3089)+6*s(3090)+12*s(3091)+12*s(3092)+6*s(3093)+6*s(3094)+18*s(3095)+24*s(3096)+18*s(3097)+30*s(3098)+6*s(3100)+11*s(3101)+12*s(3102)+6*s(3103)+6*s(3104)+6*s(3105)+0
  Such that:s(3072) =< 2
s(3073) =< 3
s(3074) =< 4
s(3075) =< 5
aux(163) =< 6
s(3077) =< 7
s(3078) =< 8
s(3079) =< 9
s(3080) =< 10
s(3081) =< 11
s(3082) =< 12
s(3083) =< 24
s(3084) =< 25
s(3085) =< 5/2
s(3086) =< 7/2
s(3087) =< 11/2
aux(164) =< D
s(3069) =< aux(164)
s(3089) =< aux(163)
s(3090) =< s(3077)
s(3091) =< s(3078)
s(3092) =< s(3079)
s(3093) =< s(3080)
s(3094) =< s(3081)
s(3095) =< s(3082)
s(3096) =< s(3073)
s(3097) =< s(3074)
s(3098) =< s(3075)
s(3100) =< s(3083)
s(3101) =< s(3084)
s(3102) =< s(3085)
s(3103) =< s(3086)
s(3104) =< s(3087)
s(3105) =< s(3072)

  with precondition: [A=69,C=2,D>=2] 


#### Cost of chains of f492_loop_cont(A,B,C,D,E):
* Chain [1231]: 0
  with precondition: [A=3,C=2] 

* Chain [1230]: 0
  with precondition: [A=70,C=2] 

* Chain [1229]: 1505
  with precondition: [A=70,C=2,0>=D] 

* Chain [1228]: 3*s(3140)+18*s(3160)+6*s(3162)+12*s(3163)+12*s(3164)+6*s(3165)+6*s(3166)+18*s(3167)+24*s(3168)+18*s(3169)+30*s(3170)+6*s(3171)+11*s(3172)+12*s(3173)+6*s(3174)+6*s(3175)+6*s(3176)+0
  Such that:s(3143) =< 2
s(3144) =< 3
s(3145) =< 4
s(3146) =< 5
aux(166) =< 6
s(3148) =< 7
s(3149) =< 8
s(3150) =< 9
s(3151) =< 10
s(3152) =< 11
s(3153) =< 12
s(3154) =< 24
s(3155) =< 25
s(3156) =< 5/2
s(3157) =< 7/2
s(3158) =< 11/2
aux(167) =< D
s(3140) =< aux(167)
s(3160) =< aux(166)
s(3162) =< s(3148)
s(3163) =< s(3149)
s(3164) =< s(3150)
s(3165) =< s(3151)
s(3166) =< s(3152)
s(3167) =< s(3153)
s(3168) =< s(3144)
s(3169) =< s(3145)
s(3170) =< s(3146)
s(3171) =< s(3154)
s(3172) =< s(3155)
s(3173) =< s(3156)
s(3174) =< s(3157)
s(3175) =< s(3158)
s(3176) =< s(3143)

  with precondition: [A=70,C=2,D>=1] 


#### Cost of chains of f484_loop_cont(A,B,C,D,E):
* Chain [1235]: 0
  with precondition: [A=3,C=2] 

* Chain [1234]: 0
  with precondition: [A=71,C=2] 

* Chain [1233]: 1523
  with precondition: [A=71,C=2,1>=D] 

* Chain [1232]: 3*s(3211)+21*s(3231)+6*s(3233)+12*s(3234)+12*s(3235)+6*s(3236)+6*s(3237)+18*s(3238)+24*s(3239)+18*s(3240)+30*s(3241)+6*s(3242)+11*s(3243)+12*s(3244)+6*s(3245)+6*s(3246)+6*s(3247)+0
  Such that:s(3214) =< 2
s(3215) =< 3
s(3216) =< 4
s(3217) =< 5
aux(169) =< 6
s(3219) =< 7
s(3220) =< 8
s(3221) =< 9
s(3222) =< 10
s(3223) =< 11
s(3224) =< 12
s(3225) =< 24
s(3226) =< 25
s(3227) =< 5/2
s(3228) =< 7/2
s(3229) =< 11/2
aux(170) =< D
s(3211) =< aux(170)
s(3231) =< aux(169)
s(3233) =< s(3219)
s(3234) =< s(3220)
s(3235) =< s(3221)
s(3236) =< s(3222)
s(3237) =< s(3223)
s(3238) =< s(3224)
s(3239) =< s(3215)
s(3240) =< s(3216)
s(3241) =< s(3217)
s(3242) =< s(3225)
s(3243) =< s(3226)
s(3244) =< s(3227)
s(3245) =< s(3228)
s(3246) =< s(3229)
s(3247) =< s(3214)

  with precondition: [A=71,C=2,D>=2] 


#### Cost of chains of f478_loop_cont(A,B,C,D,E):
* Chain [1239]: 0
  with precondition: [A=3,C=2] 

* Chain [1238]: 0
  with precondition: [A=72,C=2] 

* Chain [1237]: 1541
  with precondition: [A=72,C=2,1>=D] 

* Chain [1236]: 3*s(3282)+24*s(3302)+6*s(3304)+12*s(3305)+12*s(3306)+6*s(3307)+6*s(3308)+18*s(3309)+24*s(3310)+18*s(3311)+30*s(3312)+6*s(3313)+11*s(3314)+12*s(3315)+6*s(3316)+6*s(3317)+6*s(3318)+0
  Such that:s(3285) =< 2
s(3286) =< 3
s(3287) =< 4
s(3288) =< 5
aux(172) =< 6
s(3290) =< 7
s(3291) =< 8
s(3292) =< 9
s(3293) =< 10
s(3294) =< 11
s(3295) =< 12
s(3296) =< 24
s(3297) =< 25
s(3298) =< 5/2
s(3299) =< 7/2
s(3300) =< 11/2
aux(173) =< D
s(3282) =< aux(173)
s(3302) =< aux(172)
s(3304) =< s(3290)
s(3305) =< s(3291)
s(3306) =< s(3292)
s(3307) =< s(3293)
s(3308) =< s(3294)
s(3309) =< s(3295)
s(3310) =< s(3286)
s(3311) =< s(3287)
s(3312) =< s(3288)
s(3313) =< s(3296)
s(3314) =< s(3297)
s(3315) =< s(3298)
s(3316) =< s(3299)
s(3317) =< s(3300)
s(3318) =< s(3285)

  with precondition: [A=72,C=2,D>=2] 


#### Cost of chains of f472_loop_cont(A,B,C,D,E):
* Chain [1243]: 0
  with precondition: [A=3,C=2] 

* Chain [1242]: 0
  with precondition: [A=73,C=2] 

* Chain [1241]: 1556
  with precondition: [A=73,C=2,2>=D] 

* Chain [1240]: 3*s(3353)+33*s(3373)+24*s(3374)+6*s(3375)+12*s(3376)+12*s(3377)+6*s(3378)+6*s(3379)+18*s(3380)+24*s(3381)+18*s(3382)+6*s(3384)+11*s(3385)+12*s(3386)+6*s(3387)+6*s(3388)+6*s(3389)+0
  Such that:s(3356) =< 2
s(3357) =< 3
s(3358) =< 4
aux(175) =< 5
s(3360) =< 6
s(3361) =< 7
s(3362) =< 8
s(3363) =< 9
s(3364) =< 10
s(3365) =< 11
s(3366) =< 12
s(3367) =< 24
s(3368) =< 25
s(3369) =< 5/2
s(3370) =< 7/2
s(3371) =< 11/2
aux(176) =< D
s(3353) =< aux(176)
s(3373) =< aux(175)
s(3374) =< s(3360)
s(3375) =< s(3361)
s(3376) =< s(3362)
s(3377) =< s(3363)
s(3378) =< s(3364)
s(3379) =< s(3365)
s(3380) =< s(3366)
s(3381) =< s(3357)
s(3382) =< s(3358)
s(3384) =< s(3367)
s(3385) =< s(3368)
s(3386) =< s(3369)
s(3387) =< s(3370)
s(3388) =< s(3371)
s(3389) =< s(3356)

  with precondition: [A=73,C=2,D>=3] 


#### Cost of chains of f466_loop_cont(A,B,C,D,E):
* Chain [1247]: 0
  with precondition: [A=3,C=2] 

* Chain [1246]: 0
  with precondition: [A=74,C=2] 

* Chain [1245]: 1571
  with precondition: [A=74,C=2,1>=D] 

* Chain [1244]: 3*s(3424)+36*s(3444)+24*s(3446)+6*s(3447)+12*s(3448)+12*s(3449)+6*s(3450)+6*s(3451)+18*s(3452)+24*s(3453)+18*s(3454)+6*s(3455)+11*s(3456)+12*s(3457)+6*s(3458)+6*s(3459)+6*s(3460)+0
  Such that:s(3427) =< 2
s(3428) =< 3
s(3429) =< 4
aux(178) =< 5
s(3431) =< 6
s(3432) =< 7
s(3433) =< 8
s(3434) =< 9
s(3435) =< 10
s(3436) =< 11
s(3437) =< 12
s(3438) =< 24
s(3439) =< 25
s(3440) =< 5/2
s(3441) =< 7/2
s(3442) =< 11/2
aux(179) =< D
s(3424) =< aux(179)
s(3444) =< aux(178)
s(3446) =< s(3431)
s(3447) =< s(3432)
s(3448) =< s(3433)
s(3449) =< s(3434)
s(3450) =< s(3435)
s(3451) =< s(3436)
s(3452) =< s(3437)
s(3453) =< s(3428)
s(3454) =< s(3429)
s(3455) =< s(3438)
s(3456) =< s(3439)
s(3457) =< s(3440)
s(3458) =< s(3441)
s(3459) =< s(3442)
s(3460) =< s(3427)

  with precondition: [A=74,C=2,D>=2] 


#### Cost of chains of f458_loop_cont(A,B,C,D,E):
* Chain [1251]: 0
  with precondition: [A=3,C=2] 

* Chain [1250]: 0
  with precondition: [A=75,C=2] 

* Chain [1249]: 1586
  with precondition: [A=75,C=2,2>=D] 

* Chain [1248]: 3*s(3495)+39*s(3515)+24*s(3517)+6*s(3518)+12*s(3519)+12*s(3520)+6*s(3521)+6*s(3522)+18*s(3523)+24*s(3524)+18*s(3525)+6*s(3526)+11*s(3527)+12*s(3528)+6*s(3529)+6*s(3530)+6*s(3531)+0
  Such that:s(3498) =< 2
s(3499) =< 3
s(3500) =< 4
aux(181) =< 5
s(3502) =< 6
s(3503) =< 7
s(3504) =< 8
s(3505) =< 9
s(3506) =< 10
s(3507) =< 11
s(3508) =< 12
s(3509) =< 24
s(3510) =< 25
s(3511) =< 5/2
s(3512) =< 7/2
s(3513) =< 11/2
aux(182) =< D
s(3495) =< aux(182)
s(3515) =< aux(181)
s(3517) =< s(3502)
s(3518) =< s(3503)
s(3519) =< s(3504)
s(3520) =< s(3505)
s(3521) =< s(3506)
s(3522) =< s(3507)
s(3523) =< s(3508)
s(3524) =< s(3499)
s(3525) =< s(3500)
s(3526) =< s(3509)
s(3527) =< s(3510)
s(3528) =< s(3511)
s(3529) =< s(3512)
s(3530) =< s(3513)
s(3531) =< s(3498)

  with precondition: [A=75,C=2,D>=3] 


#### Cost of chains of f452_loop_cont(A,B,C,D,E):
* Chain [1255]: 0
  with precondition: [A=3,C=2] 

* Chain [1254]: 0
  with precondition: [A=76,C=2] 

* Chain [1253]: 3*s(3532)+42*s(3552)+24*s(3554)+6*s(3555)+12*s(3556)+12*s(3557)+6*s(3558)+6*s(3559)+18*s(3560)+24*s(3561)+18*s(3562)+6*s(3563)+11*s(3564)+12*s(3565)+6*s(3566)+6*s(3567)+6*s(3568)+0
  Such that:s(3535) =< 2
s(3536) =< 3
s(3537) =< 4
aux(183) =< 5
s(3539) =< 6
s(3540) =< 7
s(3541) =< 8
s(3542) =< 9
s(3543) =< 10
s(3544) =< 11
s(3545) =< 12
s(3546) =< 24
s(3547) =< 25
s(3548) =< 5/2
s(3549) =< 7/2
s(3550) =< 11/2
aux(184) =< -D+5
s(3532) =< aux(184)
s(3552) =< aux(183)
s(3554) =< s(3539)
s(3555) =< s(3540)
s(3556) =< s(3541)
s(3557) =< s(3542)
s(3558) =< s(3543)
s(3559) =< s(3544)
s(3560) =< s(3545)
s(3561) =< s(3536)
s(3562) =< s(3537)
s(3563) =< s(3546)
s(3564) =< s(3547)
s(3565) =< s(3548)
s(3566) =< s(3549)
s(3567) =< s(3550)
s(3568) =< s(3535)

  with precondition: [A=76,C=2,4>=D] 

* Chain [1252]: 1601
  with precondition: [A=76,C=2,D>=5] 


#### Cost of chains of f446_loop_cont(A,B,C,D,E):
* Chain [1259]: 0
  with precondition: [A=3,C=2] 

* Chain [1258]: 0
  with precondition: [A=77,C=2] 

* Chain [1257]: 3*s(3603)+9*s(3623)+42*s(3624)+24*s(3625)+6*s(3626)+12*s(3627)+12*s(3628)+6*s(3629)+18*s(3631)+24*s(3632)+18*s(3633)+6*s(3634)+11*s(3635)+12*s(3636)+6*s(3637)+6*s(3638)+6*s(3639)+0
  Such that:s(3606) =< 2
s(3607) =< 3
s(3608) =< 4
s(3609) =< 5
s(3610) =< 6
s(3611) =< 7
s(3612) =< 8
s(3613) =< 9
s(3614) =< 10
aux(186) =< 11
s(3616) =< 12
s(3617) =< 24
s(3618) =< 25
s(3619) =< 5/2
s(3620) =< 7/2
s(3621) =< 11/2
aux(187) =< -D/2+2
s(3603) =< aux(187)
s(3623) =< aux(186)
s(3624) =< s(3609)
s(3625) =< s(3610)
s(3626) =< s(3611)
s(3627) =< s(3612)
s(3628) =< s(3613)
s(3629) =< s(3614)
s(3631) =< s(3616)
s(3632) =< s(3607)
s(3633) =< s(3608)
s(3634) =< s(3617)
s(3635) =< s(3618)
s(3636) =< s(3619)
s(3637) =< s(3620)
s(3638) =< s(3621)
s(3639) =< s(3606)

  with precondition: [A=77,C=2,3>=D] 

* Chain [1256]: 1634
  with precondition: [A=77,C=2,D>=4] 


#### Cost of chains of f440_loop_cont(A,B,C,D,E):
* Chain [1263]: 0
  with precondition: [A=3,C=2] 

* Chain [1262]: 0
  with precondition: [A=78,C=2] 

* Chain [1261]: 3*s(3674)+45*s(3694)+9*s(3695)+24*s(3697)+6*s(3698)+12*s(3699)+12*s(3700)+6*s(3701)+18*s(3702)+24*s(3703)+18*s(3704)+6*s(3705)+11*s(3706)+12*s(3707)+6*s(3708)+6*s(3709)+6*s(3710)+0
  Such that:s(3677) =< 2
s(3678) =< 3
s(3679) =< 4
aux(189) =< 5
s(3681) =< 6
s(3682) =< 7
s(3683) =< 8
s(3684) =< 9
s(3685) =< 10
s(3686) =< 11
s(3687) =< 12
s(3688) =< 24
s(3689) =< 25
s(3690) =< 5/2
s(3691) =< 7/2
s(3692) =< 11/2
aux(190) =< -D+5
s(3674) =< aux(190)
s(3694) =< aux(189)
s(3695) =< s(3686)
s(3697) =< s(3681)
s(3698) =< s(3682)
s(3699) =< s(3683)
s(3700) =< s(3684)
s(3701) =< s(3685)
s(3702) =< s(3687)
s(3703) =< s(3678)
s(3704) =< s(3679)
s(3705) =< s(3688)
s(3706) =< s(3689)
s(3707) =< s(3690)
s(3708) =< s(3691)
s(3709) =< s(3692)
s(3710) =< s(3677)

  with precondition: [A=78,C=2,4>=D] 

* Chain [1260]: 1649
  with precondition: [A=78,C=2,D>=5] 


#### Cost of chains of f432_loop_cont(A,B,C,D,E):
* Chain [1267]: 0
  with precondition: [A=3,C=2] 

* Chain [1266]: 0
  with precondition: [A=79,C=2] 

* Chain [1265]: 3*s(3745)+12*s(3765)+45*s(3766)+24*s(3768)+6*s(3769)+12*s(3770)+12*s(3771)+6*s(3772)+18*s(3773)+24*s(3774)+18*s(3775)+6*s(3776)+11*s(3777)+12*s(3778)+6*s(3779)+6*s(3780)+6*s(3781)+0
  Such that:s(3748) =< 2
s(3749) =< 3
s(3750) =< 4
s(3751) =< 5
s(3752) =< 6
s(3753) =< 7
s(3754) =< 8
s(3755) =< 9
s(3756) =< 10
aux(192) =< 11
s(3758) =< 12
s(3759) =< 24
s(3760) =< 25
s(3761) =< 5/2
s(3762) =< 7/2
s(3763) =< 11/2
aux(193) =< -D/2+2
s(3745) =< aux(193)
s(3765) =< aux(192)
s(3766) =< s(3751)
s(3768) =< s(3752)
s(3769) =< s(3753)
s(3770) =< s(3754)
s(3771) =< s(3755)
s(3772) =< s(3756)
s(3773) =< s(3758)
s(3774) =< s(3749)
s(3775) =< s(3750)
s(3776) =< s(3759)
s(3777) =< s(3760)
s(3778) =< s(3761)
s(3779) =< s(3762)
s(3780) =< s(3763)
s(3781) =< s(3748)

  with precondition: [A=79,C=2,3>=D] 

* Chain [1264]: 1682
  with precondition: [A=79,C=2,D>=4] 


#### Cost of chains of f426_loop_cont(A,B,C,D,E):
* Chain [1271]: 0
  with precondition: [A=3,C=2] 

* Chain [1270]: 0
  with precondition: [A=80,C=2] 

* Chain [1269]: 3*s(3816)+48*s(3836)+12*s(3837)+24*s(3839)+6*s(3840)+12*s(3841)+12*s(3842)+6*s(3843)+18*s(3844)+24*s(3845)+18*s(3846)+6*s(3847)+11*s(3848)+12*s(3849)+6*s(3850)+6*s(3851)+6*s(3852)+0
  Such that:s(3819) =< 2
s(3820) =< 3
s(3821) =< 4
aux(195) =< 5
s(3823) =< 6
s(3824) =< 7
s(3825) =< 8
s(3826) =< 9
s(3827) =< 10
s(3828) =< 11
s(3829) =< 12
s(3830) =< 24
s(3831) =< 25
s(3832) =< 5/2
s(3833) =< 7/2
s(3834) =< 11/2
aux(196) =< -D+1
s(3816) =< aux(196)
s(3836) =< aux(195)
s(3837) =< s(3828)
s(3839) =< s(3823)
s(3840) =< s(3824)
s(3841) =< s(3825)
s(3842) =< s(3826)
s(3843) =< s(3827)
s(3844) =< s(3829)
s(3845) =< s(3820)
s(3846) =< s(3821)
s(3847) =< s(3830)
s(3848) =< s(3831)
s(3849) =< s(3832)
s(3850) =< s(3833)
s(3851) =< s(3834)
s(3852) =< s(3819)

  with precondition: [A=80,C=2,0>=D] 

* Chain [1268]: 1697
  with precondition: [A=80,C=2,D>=1] 


#### Cost of chains of f420_loop_cont(A,B,C,D,E):
* Chain [1275]: 0
  with precondition: [A=3,C=2] 

* Chain [1274]: 0
  with precondition: [A=81,C=2] 

* Chain [1273]: 3*s(3887)+27*s(3907)+48*s(3908)+12*s(3909)+6*s(3911)+12*s(3912)+12*s(3913)+6*s(3914)+18*s(3915)+24*s(3916)+18*s(3917)+6*s(3918)+11*s(3919)+12*s(3920)+6*s(3921)+6*s(3922)+6*s(3923)+0
  Such that:s(3890) =< 2
s(3891) =< 3
s(3892) =< 4
s(3893) =< 5
aux(198) =< 6
s(3895) =< 7
s(3896) =< 8
s(3897) =< 9
s(3898) =< 10
s(3899) =< 11
s(3900) =< 12
s(3901) =< 24
s(3902) =< 25
s(3903) =< 5/2
s(3904) =< 7/2
s(3905) =< 11/2
aux(199) =< -D/2
s(3887) =< aux(199)
s(3907) =< aux(198)
s(3908) =< s(3893)
s(3909) =< s(3899)
s(3911) =< s(3895)
s(3912) =< s(3896)
s(3913) =< s(3897)
s(3914) =< s(3898)
s(3915) =< s(3900)
s(3916) =< s(3891)
s(3917) =< s(3892)
s(3918) =< s(3901)
s(3919) =< s(3902)
s(3920) =< s(3903)
s(3921) =< s(3904)
s(3922) =< s(3905)
s(3923) =< s(3890)

  with precondition: [A=81,C=2,0>=D+1] 

* Chain [1272]: 1715
  with precondition: [A=81,C=2,D>=0] 


#### Cost of chains of f414_loop_cont(A,B,C,D,E):
* Chain [1279]: 0
  with precondition: [A=3,C=2] 

* Chain [1278]: 0
  with precondition: [A=82,C=2] 

* Chain [1277]: 3*s(3958)+15*s(3978)+27*s(3979)+48*s(3980)+12*s(3981)+6*s(3982)+12*s(3983)+12*s(3984)+6*s(3985)+18*s(3986)+24*s(3987)+18*s(3988)+6*s(3989)+11*s(3990)+6*s(3992)+6*s(3993)+6*s(3994)+0
  Such that:s(3961) =< 2
s(3962) =< 3
s(3963) =< 4
s(3964) =< 5
s(3965) =< 6
s(3966) =< 7
s(3967) =< 8
s(3968) =< 9
s(3969) =< 10
s(3970) =< 11
s(3971) =< 12
s(3972) =< 24
s(3973) =< 25
aux(201) =< 5/2
s(3975) =< 7/2
s(3976) =< 11/2
aux(202) =< -D+1
s(3958) =< aux(202)
s(3978) =< aux(201)
s(3979) =< s(3965)
s(3980) =< s(3964)
s(3981) =< s(3970)
s(3982) =< s(3966)
s(3983) =< s(3967)
s(3984) =< s(3968)
s(3985) =< s(3969)
s(3986) =< s(3971)
s(3987) =< s(3962)
s(3988) =< s(3963)
s(3989) =< s(3972)
s(3990) =< s(3973)
s(3992) =< s(3975)
s(3993) =< s(3976)
s(3994) =< s(3961)

  with precondition: [A=82,C=2,0>=D] 

* Chain [1276]: 3445/2
  with precondition: [A=82,C=2,D>=1] 


#### Cost of chains of f406_loop_cont(A,B,C,D,E):
* Chain [1283]: 0
  with precondition: [A=3,C=2] 

* Chain [1282]: 0
  with precondition: [A=83,C=2] 

* Chain [1281]: 3*s(4029)+30*s(4049)+15*s(4050)+48*s(4052)+12*s(4053)+6*s(4054)+12*s(4055)+12*s(4056)+6*s(4057)+18*s(4058)+24*s(4059)+18*s(4060)+6*s(4061)+11*s(4062)+6*s(4063)+6*s(4064)+6*s(4065)+0
  Such that:s(4032) =< 2
s(4033) =< 3
s(4034) =< 4
s(4035) =< 5
aux(204) =< 6
s(4037) =< 7
s(4038) =< 8
s(4039) =< 9
s(4040) =< 10
s(4041) =< 11
s(4042) =< 12
s(4043) =< 24
s(4044) =< 25
s(4045) =< 5/2
s(4046) =< 7/2
s(4047) =< 11/2
aux(205) =< -D/2
s(4029) =< aux(205)
s(4049) =< aux(204)
s(4050) =< s(4045)
s(4052) =< s(4035)
s(4053) =< s(4041)
s(4054) =< s(4037)
s(4055) =< s(4038)
s(4056) =< s(4039)
s(4057) =< s(4040)
s(4058) =< s(4042)
s(4059) =< s(4033)
s(4060) =< s(4034)
s(4061) =< s(4043)
s(4062) =< s(4044)
s(4063) =< s(4046)
s(4064) =< s(4047)
s(4065) =< s(4032)

  with precondition: [A=83,C=2,0>=D+1] 

* Chain [1280]: 3481/2
  with precondition: [A=83,C=2,D>=0] 


#### Cost of chains of f400_loop_cont(A,B,C,D,E):
* Chain [1287]: 0
  with precondition: [A=3,C=2] 

* Chain [1286]: 0
  with precondition: [A=84,C=2] 

* Chain [1285]: 3*s(4100)+18*s(4120)+30*s(4121)+48*s(4123)+12*s(4124)+6*s(4125)+12*s(4126)+12*s(4127)+6*s(4128)+18*s(4129)+24*s(4130)+18*s(4131)+6*s(4132)+11*s(4133)+6*s(4134)+6*s(4135)+6*s(4136)+0
  Such that:s(4103) =< 2
s(4104) =< 3
s(4105) =< 4
s(4106) =< 5
s(4107) =< 6
s(4108) =< 7
s(4109) =< 8
s(4110) =< 9
s(4111) =< 10
s(4112) =< 11
s(4113) =< 12
s(4114) =< 24
s(4115) =< 25
aux(207) =< 5/2
s(4117) =< 7/2
s(4118) =< 11/2
aux(208) =< -D/2
s(4100) =< aux(208)
s(4120) =< aux(207)
s(4121) =< s(4107)
s(4123) =< s(4106)
s(4124) =< s(4112)
s(4125) =< s(4108)
s(4126) =< s(4109)
s(4127) =< s(4110)
s(4128) =< s(4111)
s(4129) =< s(4113)
s(4130) =< s(4104)
s(4131) =< s(4105)
s(4132) =< s(4114)
s(4133) =< s(4115)
s(4134) =< s(4117)
s(4135) =< s(4118)
s(4136) =< s(4103)

  with precondition: [A=84,C=2,0>=D+1] 

* Chain [1284]: 1748
  with precondition: [A=84,C=2,D>=0] 


#### Cost of chains of f394_loop_cont(A,B,C,D,E):
* Chain [1291]: 0
  with precondition: [A=3,C=2] 

* Chain [1290]: 0
  with precondition: [A=85,C=2] 

* Chain [1289]: 3*s(4171)+9*s(4191)+18*s(4192)+30*s(4193)+48*s(4194)+12*s(4195)+6*s(4196)+12*s(4197)+12*s(4198)+6*s(4199)+18*s(4200)+24*s(4201)+18*s(4202)+6*s(4203)+11*s(4204)+6*s(4205)+6*s(4206)+0
  Such that:aux(210) =< 2
s(4175) =< 3
s(4176) =< 4
s(4177) =< 5
s(4178) =< 6
s(4179) =< 7
s(4180) =< 8
s(4181) =< 9
s(4182) =< 10
s(4183) =< 11
s(4184) =< 12
s(4185) =< 24
s(4186) =< 25
s(4187) =< 5/2
s(4188) =< 7/2
s(4189) =< 11/2
aux(211) =< -D
s(4171) =< aux(211)
s(4191) =< aux(210)
s(4192) =< s(4187)
s(4193) =< s(4178)
s(4194) =< s(4177)
s(4195) =< s(4183)
s(4196) =< s(4179)
s(4197) =< s(4180)
s(4198) =< s(4181)
s(4199) =< s(4182)
s(4200) =< s(4184)
s(4201) =< s(4175)
s(4202) =< s(4176)
s(4203) =< s(4185)
s(4204) =< s(4186)
s(4205) =< s(4188)
s(4206) =< s(4189)

  with precondition: [A=85,C=2,0>=D+2] 

* Chain [1288]: 1754
  with precondition: [A=85,C=2,D+1>=0] 


#### Cost of chains of f388_loop_cont(A,B,C,D,E):
* Chain [1295]: 0
  with precondition: [A=3,C=2] 

* Chain [1294]: 0
  with precondition: [A=86,C=2] 

* Chain [1293]: 3*s(4242)+21*s(4262)+9*s(4263)+18*s(4264)+30*s(4265)+48*s(4266)+12*s(4267)+6*s(4268)+12*s(4269)+12*s(4270)+6*s(4271)+18*s(4272)+24*s(4273)+6*s(4275)+11*s(4276)+6*s(4277)+6*s(4278)+0
  Such that:s(4245) =< 2
s(4246) =< 3
aux(213) =< 4
s(4248) =< 5
s(4249) =< 6
s(4250) =< 7
s(4251) =< 8
s(4252) =< 9
s(4253) =< 10
s(4254) =< 11
s(4255) =< 12
s(4256) =< 24
s(4257) =< 25
s(4258) =< 5/2
s(4259) =< 7/2
s(4260) =< 11/2
aux(214) =< -D/2
s(4242) =< aux(214)
s(4262) =< aux(213)
s(4263) =< s(4245)
s(4264) =< s(4258)
s(4265) =< s(4249)
s(4266) =< s(4248)
s(4267) =< s(4254)
s(4268) =< s(4250)
s(4269) =< s(4251)
s(4270) =< s(4252)
s(4271) =< s(4253)
s(4272) =< s(4255)
s(4273) =< s(4246)
s(4275) =< s(4256)
s(4276) =< s(4257)
s(4277) =< s(4259)
s(4278) =< s(4260)

  with precondition: [A=86,C=2,0>=D+1] 

* Chain [1292]: 1766
  with precondition: [A=86,C=2,D>=0] 


#### Cost of chains of f380_loop_cont(A,B,C,D,E):
* Chain [1299]: 0
  with precondition: [A=3,C=2] 

* Chain [1298]: 0
  with precondition: [A=87,C=2] 

* Chain [1297]: 3*s(4313)+12*s(4333)+21*s(4334)+18*s(4336)+30*s(4337)+48*s(4338)+12*s(4339)+6*s(4340)+12*s(4341)+12*s(4342)+6*s(4343)+18*s(4344)+24*s(4345)+6*s(4346)+11*s(4347)+6*s(4348)+6*s(4349)+0
  Such that:aux(216) =< 2
s(4317) =< 3
s(4318) =< 4
s(4319) =< 5
s(4320) =< 6
s(4321) =< 7
s(4322) =< 8
s(4323) =< 9
s(4324) =< 10
s(4325) =< 11
s(4326) =< 12
s(4327) =< 24
s(4328) =< 25
s(4329) =< 5/2
s(4330) =< 7/2
s(4331) =< 11/2
aux(217) =< -D
s(4313) =< aux(217)
s(4333) =< aux(216)
s(4334) =< s(4318)
s(4336) =< s(4329)
s(4337) =< s(4320)
s(4338) =< s(4319)
s(4339) =< s(4325)
s(4340) =< s(4321)
s(4341) =< s(4322)
s(4342) =< s(4323)
s(4343) =< s(4324)
s(4344) =< s(4326)
s(4345) =< s(4317)
s(4346) =< s(4327)
s(4347) =< s(4328)
s(4348) =< s(4330)
s(4349) =< s(4331)

  with precondition: [A=87,C=2,0>=D+2] 

* Chain [1296]: 1772
  with precondition: [A=87,C=2,D+1>=0] 


#### Cost of chains of f374_loop_cont(A,B,C,D,E):
* Chain [1303]: 0
  with precondition: [A=3,C=2] 

* Chain [1302]: 0
  with precondition: [A=88,C=2] 

* Chain [1301]: 3*s(4384)+24*s(4404)+12*s(4405)+18*s(4407)+30*s(4408)+48*s(4409)+12*s(4410)+6*s(4411)+12*s(4412)+12*s(4413)+6*s(4414)+18*s(4415)+24*s(4416)+6*s(4417)+11*s(4418)+6*s(4419)+6*s(4420)+0
  Such that:s(4387) =< 2
s(4388) =< 3
aux(219) =< 4
s(4390) =< 5
s(4391) =< 6
s(4392) =< 7
s(4393) =< 8
s(4394) =< 9
s(4395) =< 10
s(4396) =< 11
s(4397) =< 12
s(4398) =< 24
s(4399) =< 25
s(4400) =< 5/2
s(4401) =< 7/2
s(4402) =< 11/2
aux(220) =< -D
s(4384) =< aux(220)
s(4404) =< aux(219)
s(4405) =< s(4387)
s(4407) =< s(4400)
s(4408) =< s(4391)
s(4409) =< s(4390)
s(4410) =< s(4396)
s(4411) =< s(4392)
s(4412) =< s(4393)
s(4413) =< s(4394)
s(4414) =< s(4395)
s(4415) =< s(4397)
s(4416) =< s(4388)
s(4417) =< s(4398)
s(4418) =< s(4399)
s(4419) =< s(4401)
s(4420) =< s(4402)

  with precondition: [A=88,C=2,0>=D+2] 

* Chain [1300]: 1784
  with precondition: [A=88,C=2,D+1>=0] 


#### Cost of chains of f368_loop_cont(A,B,C,D,E):
* Chain [1307]: 0
  with precondition: [A=3,C=2] 

* Chain [1306]: 0
  with precondition: [A=89,C=2] 

* Chain [1305]: 3*s(4455)+27*s(4475)+24*s(4476)+12*s(4477)+18*s(4478)+30*s(4479)+48*s(4480)+12*s(4481)+6*s(4482)+12*s(4483)+12*s(4484)+6*s(4485)+18*s(4486)+6*s(4488)+11*s(4489)+6*s(4490)+6*s(4491)+0
  Such that:s(4458) =< 2
aux(222) =< 3
s(4460) =< 4
s(4461) =< 5
s(4462) =< 6
s(4463) =< 7
s(4464) =< 8
s(4465) =< 9
s(4466) =< 10
s(4467) =< 11
s(4468) =< 12
s(4469) =< 24
s(4470) =< 25
s(4471) =< 5/2
s(4472) =< 7/2
s(4473) =< 11/2
aux(223) =< -D/2
s(4455) =< aux(223)
s(4475) =< aux(222)
s(4476) =< s(4460)
s(4477) =< s(4458)
s(4478) =< s(4471)
s(4479) =< s(4462)
s(4480) =< s(4461)
s(4481) =< s(4467)
s(4482) =< s(4463)
s(4483) =< s(4464)
s(4484) =< s(4465)
s(4485) =< s(4466)
s(4486) =< s(4468)
s(4488) =< s(4469)
s(4489) =< s(4470)
s(4490) =< s(4472)
s(4491) =< s(4473)

  with precondition: [A=89,C=2,0>=D+3] 

* Chain [1304]: 1793
  with precondition: [A=89,C=2,D+2>=0] 


#### Cost of chains of f362_loop_cont(A,B,C,D,E):
* Chain [1311]: 0
  with precondition: [A=3,C=2] 

* Chain [1310]: 0
  with precondition: [A=90,C=2] 

* Chain [1309]: 3*s(4526)+3*s(4546)+27*s(4547)+24*s(4548)+12*s(4549)+18*s(4550)+30*s(4551)+48*s(4552)+12*s(4553)+6*s(4554)+12*s(4555)+12*s(4556)+6*s(4557)+18*s(4558)+6*s(4559)+11*s(4560)+6*s(4561)+6*s(4562)+0
  Such that:s(4529) =< 2
s(4530) =< 3
s(4531) =< 4
s(4532) =< 5
s(4533) =< 6
s(4534) =< 7
s(4535) =< 8
s(4536) =< 9
s(4537) =< 10
s(4538) =< 11
s(4539) =< 12
s(4540) =< 24
s(4541) =< 25
s(4545) =< 3/2
s(4542) =< 5/2
s(4543) =< 7/2
s(4544) =< 11/2
aux(225) =< -D
s(4526) =< aux(225)
s(4546) =< s(4545)
s(4547) =< s(4530)
s(4548) =< s(4531)
s(4549) =< s(4529)
s(4550) =< s(4542)
s(4551) =< s(4533)
s(4552) =< s(4532)
s(4553) =< s(4538)
s(4554) =< s(4534)
s(4555) =< s(4535)
s(4556) =< s(4536)
s(4557) =< s(4537)
s(4558) =< s(4539)
s(4559) =< s(4540)
s(4560) =< s(4541)
s(4561) =< s(4543)
s(4562) =< s(4544)

  with precondition: [A=90,C=2,0>=D+2] 

* Chain [1308]: 3595/2
  with precondition: [A=90,C=2,D+1>=0] 


#### Cost of chains of f354_loop_cont(A,B,C,D,E):
* Chain [1315]: 0
  with precondition: [A=3,C=2] 

* Chain [1314]: 0
  with precondition: [A=91,C=2] 

* Chain [1313]: 3*s(4597)+30*s(4618)+3*s(4619)+24*s(4621)+12*s(4622)+18*s(4623)+30*s(4624)+48*s(4625)+12*s(4626)+6*s(4627)+12*s(4628)+12*s(4629)+6*s(4630)+18*s(4631)+6*s(4632)+11*s(4633)+6*s(4634)+6*s(4635)+0
  Such that:s(4600) =< 2
aux(226) =< 3
s(4602) =< 4
s(4603) =< 5
s(4604) =< 6
s(4605) =< 7
s(4606) =< 8
s(4607) =< 9
s(4608) =< 10
s(4609) =< 11
s(4610) =< 12
s(4611) =< 24
s(4612) =< 25
s(4613) =< 3/2
s(4614) =< 5/2
s(4615) =< 7/2
s(4616) =< 11/2
aux(227) =< -D/2
s(4597) =< aux(227)
s(4618) =< aux(226)
s(4619) =< s(4613)
s(4621) =< s(4602)
s(4622) =< s(4600)
s(4623) =< s(4614)
s(4624) =< s(4604)
s(4625) =< s(4603)
s(4626) =< s(4609)
s(4627) =< s(4605)
s(4628) =< s(4606)
s(4629) =< s(4607)
s(4630) =< s(4608)
s(4631) =< s(4610)
s(4632) =< s(4611)
s(4633) =< s(4612)
s(4634) =< s(4615)
s(4635) =< s(4616)

  with precondition: [A=91,C=2,0>=D+3] 

* Chain [1312]: 3613/2
  with precondition: [A=91,C=2,D+2>=0] 


#### Cost of chains of f348_loop_cont(A,B,C,D,E):
* Chain [1319]: 0
  with precondition: [A=3,C=2] 

* Chain [1318]: 0
  with precondition: [A=92,C=2] 

* Chain [1317]: 3*s(4672)+6*s(4693)+30*s(4694)+24*s(4696)+12*s(4697)+18*s(4698)+30*s(4699)+48*s(4700)+12*s(4701)+6*s(4702)+12*s(4703)+12*s(4704)+6*s(4705)+18*s(4706)+6*s(4707)+11*s(4708)+6*s(4709)+6*s(4710)+0
  Such that:s(4675) =< 2
s(4676) =< 3
s(4677) =< 4
s(4678) =< 5
s(4679) =< 6
s(4680) =< 7
s(4681) =< 8
s(4682) =< 9
s(4683) =< 10
s(4684) =< 11
s(4685) =< 12
s(4686) =< 24
s(4687) =< 25
aux(229) =< 3/2
s(4689) =< 5/2
s(4690) =< 7/2
s(4691) =< 11/2
aux(230) =< -D+3
s(4672) =< aux(230)
s(4693) =< aux(229)
s(4694) =< s(4676)
s(4696) =< s(4677)
s(4697) =< s(4675)
s(4698) =< s(4689)
s(4699) =< s(4679)
s(4700) =< s(4678)
s(4701) =< s(4684)
s(4702) =< s(4680)
s(4703) =< s(4681)
s(4704) =< s(4682)
s(4705) =< s(4683)
s(4706) =< s(4685)
s(4707) =< s(4686)
s(4708) =< s(4687)
s(4709) =< s(4690)
s(4710) =< s(4691)

  with precondition: [A=92,C=2,2>=D] 

* Chain [1316]: 1811
  with precondition: [A=92,C=2,D>=3] 


#### Cost of chains of f342_loop_cont(A,B,C,D,E):
* Chain [1323]: 0
  with precondition: [A=3,C=2] 

* Chain [1322]: 0
  with precondition: [A=93,C=2] 

* Chain [1321]: 3*s(4747)+15*s(4768)+6*s(4769)+30*s(4770)+24*s(4771)+18*s(4773)+30*s(4774)+48*s(4775)+12*s(4776)+6*s(4777)+12*s(4778)+12*s(4779)+6*s(4780)+18*s(4781)+6*s(4782)+11*s(4783)+6*s(4784)+6*s(4785)+0
  Such that:aux(232) =< 2
s(4751) =< 3
s(4752) =< 4
s(4753) =< 5
s(4754) =< 6
s(4755) =< 7
s(4756) =< 8
s(4757) =< 9
s(4758) =< 10
s(4759) =< 11
s(4760) =< 12
s(4761) =< 24
s(4762) =< 25
s(4763) =< 3/2
s(4764) =< 5/2
s(4765) =< 7/2
s(4766) =< 11/2
aux(233) =< -D/2+1
s(4747) =< aux(233)
s(4768) =< aux(232)
s(4769) =< s(4763)
s(4770) =< s(4751)
s(4771) =< s(4752)
s(4773) =< s(4764)
s(4774) =< s(4754)
s(4775) =< s(4753)
s(4776) =< s(4759)
s(4777) =< s(4755)
s(4778) =< s(4756)
s(4779) =< s(4757)
s(4780) =< s(4758)
s(4781) =< s(4760)
s(4782) =< s(4761)
s(4783) =< s(4762)
s(4784) =< s(4765)
s(4785) =< s(4766)

  with precondition: [A=93,C=2,1>=D] 

* Chain [1320]: 1817
  with precondition: [A=93,C=2,D>=2] 


#### Cost of chains of f336_loop_cont(A,B,C,D,E):
* Chain [1327]: 0
  with precondition: [A=3,C=2] 

* Chain [1326]: 0
  with precondition: [A=94,C=2] 

* Chain [1325]: 3*s(4822)+3*s(4843)+15*s(4844)+6*s(4845)+30*s(4846)+24*s(4847)+18*s(4848)+30*s(4849)+48*s(4850)+12*s(4851)+6*s(4852)+12*s(4853)+12*s(4854)+6*s(4855)+18*s(4856)+6*s(4857)+11*s(4858)+6*s(4859)+6*s(4860)+0
  Such that:s(4825) =< 2
s(4826) =< 3
s(4827) =< 4
s(4828) =< 5
s(4829) =< 6
s(4830) =< 7
s(4831) =< 8
s(4832) =< 9
s(4833) =< 10
s(4834) =< 11
s(4835) =< 12
s(4836) =< 24
s(4837) =< 25
s(4842) =< 1/2
s(4838) =< 3/2
s(4839) =< 5/2
s(4840) =< 7/2
s(4841) =< 11/2
aux(235) =< -D+3
s(4822) =< aux(235)
s(4843) =< s(4842)
s(4844) =< s(4825)
s(4845) =< s(4838)
s(4846) =< s(4826)
s(4847) =< s(4827)
s(4848) =< s(4839)
s(4849) =< s(4829)
s(4850) =< s(4828)
s(4851) =< s(4834)
s(4852) =< s(4830)
s(4853) =< s(4831)
s(4854) =< s(4832)
s(4855) =< s(4833)
s(4856) =< s(4835)
s(4857) =< s(4836)
s(4858) =< s(4837)
s(4859) =< s(4840)
s(4860) =< s(4841)

  with precondition: [A=94,C=2,2>=D] 

* Chain [1324]: 3637/2
  with precondition: [A=94,C=2,D>=3] 


#### Cost of chains of f328_loop_cont(A,B,C,D,E):
* Chain [1331]: 0
  with precondition: [A=3,C=2] 

* Chain [1330]: 0
  with precondition: [A=95,C=2] 

* Chain [1329]: 3*s(4897)+18*s(4919)+3*s(4920)+6*s(4922)+30*s(4923)+24*s(4924)+18*s(4925)+30*s(4926)+48*s(4927)+12*s(4928)+6*s(4929)+12*s(4930)+12*s(4931)+6*s(4932)+18*s(4933)+6*s(4934)+11*s(4935)+6*s(4936)+6*s(4937)+0
  Such that:aux(236) =< 2
s(4901) =< 3
s(4902) =< 4
s(4903) =< 5
s(4904) =< 6
s(4905) =< 7
s(4906) =< 8
s(4907) =< 9
s(4908) =< 10
s(4909) =< 11
s(4910) =< 12
s(4911) =< 24
s(4912) =< 25
s(4913) =< 1/2
s(4914) =< 3/2
s(4915) =< 5/2
s(4916) =< 7/2
s(4917) =< 11/2
aux(237) =< -D/2+1
s(4897) =< aux(237)
s(4919) =< aux(236)
s(4920) =< s(4913)
s(4922) =< s(4914)
s(4923) =< s(4901)
s(4924) =< s(4902)
s(4925) =< s(4915)
s(4926) =< s(4904)
s(4927) =< s(4903)
s(4928) =< s(4909)
s(4929) =< s(4905)
s(4930) =< s(4906)
s(4931) =< s(4907)
s(4932) =< s(4908)
s(4933) =< s(4910)
s(4934) =< s(4911)
s(4935) =< s(4912)
s(4936) =< s(4916)
s(4937) =< s(4917)

  with precondition: [A=95,C=2,1>=D] 

* Chain [1328]: 3649/2
  with precondition: [A=95,C=2,D>=2] 


#### Cost of chains of f322_loop_cont(A,B,C,D,E):
* Chain [1335]: 0
  with precondition: [A=3,C=2] 

* Chain [1334]: 0
  with precondition: [A=96,C=2] 

* Chain [1333]: 3*s(4976)+6*s(4998)+18*s(4999)+6*s(5001)+30*s(5002)+24*s(5003)+18*s(5004)+30*s(5005)+48*s(5006)+12*s(5007)+6*s(5008)+12*s(5009)+12*s(5010)+6*s(5011)+18*s(5012)+6*s(5013)+11*s(5014)+6*s(5015)+6*s(5016)+0
  Such that:s(4979) =< 2
s(4980) =< 3
s(4981) =< 4
s(4982) =< 5
s(4983) =< 6
s(4984) =< 7
s(4985) =< 8
s(4986) =< 9
s(4987) =< 10
s(4988) =< 11
s(4989) =< 12
s(4990) =< 24
s(4991) =< 25
aux(239) =< 1/2
s(4993) =< 3/2
s(4994) =< 5/2
s(4995) =< 7/2
s(4996) =< 11/2
aux(240) =< -D/2+2
s(4976) =< aux(240)
s(4998) =< aux(239)
s(4999) =< s(4979)
s(5001) =< s(4993)
s(5002) =< s(4980)
s(5003) =< s(4981)
s(5004) =< s(4994)
s(5005) =< s(4983)
s(5006) =< s(4982)
s(5007) =< s(4988)
s(5008) =< s(4984)
s(5009) =< s(4985)
s(5010) =< s(4986)
s(5011) =< s(4987)
s(5012) =< s(4989)
s(5013) =< s(4990)
s(5014) =< s(4991)
s(5015) =< s(4995)
s(5016) =< s(4996)

  with precondition: [A=96,C=2,3>=D] 

* Chain [1332]: 1826
  with precondition: [A=96,C=2,D>=4] 


#### Cost of chains of f316_loop_cont(A,B,C,D,E):
* Chain [1339]: 0
  with precondition: [A=3,C=2] 

* Chain [1338]: 0
  with precondition: [A=97,C=2] 

* Chain [1337]: 3*s(5055)+21*s(5077)+6*s(5078)+6*s(5080)+30*s(5081)+24*s(5082)+18*s(5083)+30*s(5084)+48*s(5085)+12*s(5086)+6*s(5087)+12*s(5088)+12*s(5089)+6*s(5090)+18*s(5091)+6*s(5092)+11*s(5093)+6*s(5094)+6*s(5095)+0
  Such that:aux(242) =< 2
s(5059) =< 3
s(5060) =< 4
s(5061) =< 5
s(5062) =< 6
s(5063) =< 7
s(5064) =< 8
s(5065) =< 9
s(5066) =< 10
s(5067) =< 11
s(5068) =< 12
s(5069) =< 24
s(5070) =< 25
s(5071) =< 1/2
s(5072) =< 3/2
s(5073) =< 5/2
s(5074) =< 7/2
s(5075) =< 11/2
aux(243) =< -D+3
s(5055) =< aux(243)
s(5077) =< aux(242)
s(5078) =< s(5071)
s(5080) =< s(5072)
s(5081) =< s(5059)
s(5082) =< s(5060)
s(5083) =< s(5073)
s(5084) =< s(5062)
s(5085) =< s(5061)
s(5086) =< s(5067)
s(5087) =< s(5063)
s(5088) =< s(5064)
s(5089) =< s(5065)
s(5090) =< s(5066)
s(5091) =< s(5068)
s(5092) =< s(5069)
s(5093) =< s(5070)
s(5094) =< s(5074)
s(5095) =< s(5075)

  with precondition: [A=97,C=2,2>=D] 

* Chain [1336]: 1832
  with precondition: [A=97,C=2,D>=3] 


#### Cost of chains of f310_loop_cont(A,B,C,D,E):
* Chain [1343]: 0
  with precondition: [A=3,C=2] 

* Chain [1342]: 0
  with precondition: [A=98,C=2] 

* Chain [1341]: 3*s(5134)+33*s(5156)+21*s(5157)+6*s(5158)+6*s(5159)+24*s(5161)+18*s(5162)+30*s(5163)+48*s(5164)+12*s(5165)+6*s(5166)+12*s(5167)+12*s(5168)+6*s(5169)+18*s(5170)+6*s(5171)+11*s(5172)+6*s(5173)+6*s(5174)+0
  Such that:s(5137) =< 2
aux(245) =< 3
s(5139) =< 4
s(5140) =< 5
s(5141) =< 6
s(5142) =< 7
s(5143) =< 8
s(5144) =< 9
s(5145) =< 10
s(5146) =< 11
s(5147) =< 12
s(5148) =< 24
s(5149) =< 25
s(5150) =< 1/2
s(5151) =< 3/2
s(5152) =< 5/2
s(5153) =< 7/2
s(5154) =< 11/2
aux(246) =< -D/2+2
s(5134) =< aux(246)
s(5156) =< aux(245)
s(5157) =< s(5137)
s(5158) =< s(5150)
s(5159) =< s(5151)
s(5161) =< s(5139)
s(5162) =< s(5152)
s(5163) =< s(5141)
s(5164) =< s(5140)
s(5165) =< s(5146)
s(5166) =< s(5142)
s(5167) =< s(5143)
s(5168) =< s(5144)
s(5169) =< s(5145)
s(5170) =< s(5147)
s(5171) =< s(5148)
s(5172) =< s(5149)
s(5173) =< s(5153)
s(5174) =< s(5154)

  with precondition: [A=98,C=2,3>=D] 

* Chain [1340]: 1841
  with precondition: [A=98,C=2,D>=4] 


#### Cost of chains of f302_loop_cont(A,B,C,D,E):
* Chain [1347]: 0
  with precondition: [A=3,C=2] 

* Chain [1346]: 0
  with precondition: [A=99,C=2] 

* Chain [1345]: 3*s(5213)+24*s(5235)+33*s(5236)+6*s(5238)+6*s(5239)+24*s(5240)+18*s(5241)+30*s(5242)+48*s(5243)+12*s(5244)+6*s(5245)+12*s(5246)+12*s(5247)+6*s(5248)+18*s(5249)+6*s(5250)+11*s(5251)+6*s(5252)+6*s(5253)+0
  Such that:aux(248) =< 2
s(5217) =< 3
s(5218) =< 4
s(5219) =< 5
s(5220) =< 6
s(5221) =< 7
s(5222) =< 8
s(5223) =< 9
s(5224) =< 10
s(5225) =< 11
s(5226) =< 12
s(5227) =< 24
s(5228) =< 25
s(5229) =< 1/2
s(5230) =< 3/2
s(5231) =< 5/2
s(5232) =< 7/2
s(5233) =< 11/2
aux(249) =< -D+3
s(5213) =< aux(249)
s(5235) =< aux(248)
s(5236) =< s(5217)
s(5238) =< s(5229)
s(5239) =< s(5230)
s(5240) =< s(5218)
s(5241) =< s(5231)
s(5242) =< s(5220)
s(5243) =< s(5219)
s(5244) =< s(5225)
s(5245) =< s(5221)
s(5246) =< s(5222)
s(5247) =< s(5223)
s(5248) =< s(5224)
s(5249) =< s(5226)
s(5250) =< s(5227)
s(5251) =< s(5228)
s(5252) =< s(5232)
s(5253) =< s(5233)

  with precondition: [A=99,C=2,2>=D] 

* Chain [1344]: 1847
  with precondition: [A=99,C=2,D>=3] 


#### Cost of chains of f296_loop_cont(A,B,C,D,E):
* Chain [1351]: 0
  with precondition: [A=3,C=2] 

* Chain [1350]: 0
  with precondition: [A=100,C=2] 

* Chain [1349]: 3*s(5292)+36*s(5314)+24*s(5315)+6*s(5317)+6*s(5318)+24*s(5319)+18*s(5320)+30*s(5321)+48*s(5322)+12*s(5323)+6*s(5324)+12*s(5325)+12*s(5326)+6*s(5327)+18*s(5328)+6*s(5329)+11*s(5330)+6*s(5331)+6*s(5332)+0
  Such that:s(5295) =< 2
aux(251) =< 3
s(5297) =< 4
s(5298) =< 5
s(5299) =< 6
s(5300) =< 7
s(5301) =< 8
s(5302) =< 9
s(5303) =< 10
s(5304) =< 11
s(5305) =< 12
s(5306) =< 24
s(5307) =< 25
s(5308) =< 1/2
s(5309) =< 3/2
s(5310) =< 5/2
s(5311) =< 7/2
s(5312) =< 11/2
aux(252) =< -D+5
s(5292) =< aux(252)
s(5314) =< aux(251)
s(5315) =< s(5295)
s(5317) =< s(5308)
s(5318) =< s(5309)
s(5319) =< s(5297)
s(5320) =< s(5310)
s(5321) =< s(5299)
s(5322) =< s(5298)
s(5323) =< s(5304)
s(5324) =< s(5300)
s(5325) =< s(5301)
s(5326) =< s(5302)
s(5327) =< s(5303)
s(5328) =< s(5305)
s(5329) =< s(5306)
s(5330) =< s(5307)
s(5331) =< s(5311)
s(5332) =< s(5312)

  with precondition: [A=100,C=2,4>=D] 

* Chain [1348]: 1856
  with precondition: [A=100,C=2,D>=5] 


#### Cost of chains of f290_loop_cont(A,B,C,D,E):
* Chain [1355]: 0
  with precondition: [A=3,C=2] 

* Chain [1354]: 0
  with precondition: [A=101,C=2] 

* Chain [1353]: 3*s(5371)+15*s(5393)+36*s(5394)+24*s(5395)+6*s(5396)+6*s(5397)+24*s(5398)+18*s(5399)+30*s(5400)+48*s(5401)+6*s(5403)+12*s(5404)+12*s(5405)+6*s(5406)+18*s(5407)+6*s(5408)+11*s(5409)+6*s(5410)+6*s(5411)+0
  Such that:s(5374) =< 2
s(5375) =< 3
s(5376) =< 4
s(5377) =< 5
s(5378) =< 6
s(5379) =< 7
s(5380) =< 8
s(5381) =< 9
s(5382) =< 10
aux(254) =< 11
s(5384) =< 12
s(5385) =< 24
s(5386) =< 25
s(5387) =< 1/2
s(5388) =< 3/2
s(5389) =< 5/2
s(5390) =< 7/2
s(5391) =< 11/2
aux(255) =< -D+4
s(5371) =< aux(255)
s(5393) =< aux(254)
s(5394) =< s(5375)
s(5395) =< s(5374)
s(5396) =< s(5387)
s(5397) =< s(5388)
s(5398) =< s(5376)
s(5399) =< s(5389)
s(5400) =< s(5378)
s(5401) =< s(5377)
s(5403) =< s(5379)
s(5404) =< s(5380)
s(5405) =< s(5381)
s(5406) =< s(5382)
s(5407) =< s(5384)
s(5408) =< s(5385)
s(5409) =< s(5386)
s(5410) =< s(5390)
s(5411) =< s(5391)

  with precondition: [A=101,C=2,3>=D] 

* Chain [1352]: 1889
  with precondition: [A=101,C=2,D>=4] 


#### Cost of chains of f284_loop_cont(A,B,C,D,E):
* Chain [1359]: 0
  with precondition: [A=3,C=2] 

* Chain [1358]: 0
  with precondition: [A=102,C=2] 

* Chain [1357]: 3*s(5450)+9*s(5472)+15*s(5473)+36*s(5474)+24*s(5475)+6*s(5476)+6*s(5477)+24*s(5478)+18*s(5479)+30*s(5480)+48*s(5481)+6*s(5482)+12*s(5483)+12*s(5484)+18*s(5486)+6*s(5487)+11*s(5488)+6*s(5489)+6*s(5490)+0
  Such that:s(5453) =< 2
s(5454) =< 3
s(5455) =< 4
s(5456) =< 5
s(5457) =< 6
s(5458) =< 7
s(5459) =< 8
s(5460) =< 9
aux(257) =< 10
s(5462) =< 11
s(5463) =< 12
s(5464) =< 24
s(5465) =< 25
s(5466) =< 1/2
s(5467) =< 3/2
s(5468) =< 5/2
s(5469) =< 7/2
s(5470) =< 11/2
aux(258) =< -D+5
s(5450) =< aux(258)
s(5472) =< aux(257)
s(5473) =< s(5462)
s(5474) =< s(5454)
s(5475) =< s(5453)
s(5476) =< s(5466)
s(5477) =< s(5467)
s(5478) =< s(5455)
s(5479) =< s(5468)
s(5480) =< s(5457)
s(5481) =< s(5456)
s(5482) =< s(5458)
s(5483) =< s(5459)
s(5484) =< s(5460)
s(5486) =< s(5463)
s(5487) =< s(5464)
s(5488) =< s(5465)
s(5489) =< s(5469)
s(5490) =< s(5470)

  with precondition: [A=102,C=2,4>=D] 

* Chain [1356]: 1919
  with precondition: [A=102,C=2,D>=5] 


#### Cost of chains of f276_loop_cont(A,B,C,D,E):
* Chain [1363]: 0
  with precondition: [A=3,C=2] 

* Chain [1362]: 0
  with precondition: [A=103,C=2] 

* Chain [1361]: 3*s(5529)+18*s(5551)+9*s(5552)+36*s(5554)+24*s(5555)+6*s(5556)+6*s(5557)+24*s(5558)+18*s(5559)+30*s(5560)+48*s(5561)+6*s(5562)+12*s(5563)+12*s(5564)+18*s(5565)+6*s(5566)+11*s(5567)+6*s(5568)+6*s(5569)+0
  Such that:s(5532) =< 2
s(5533) =< 3
s(5534) =< 4
s(5535) =< 5
s(5536) =< 6
s(5537) =< 7
s(5538) =< 8
s(5539) =< 9
s(5540) =< 10
aux(260) =< 11
s(5542) =< 12
s(5543) =< 24
s(5544) =< 25
s(5545) =< 1/2
s(5546) =< 3/2
s(5547) =< 5/2
s(5548) =< 7/2
s(5549) =< 11/2
aux(261) =< -D+4
s(5529) =< aux(261)
s(5551) =< aux(260)
s(5552) =< s(5540)
s(5554) =< s(5533)
s(5555) =< s(5532)
s(5556) =< s(5545)
s(5557) =< s(5546)
s(5558) =< s(5534)
s(5559) =< s(5547)
s(5560) =< s(5536)
s(5561) =< s(5535)
s(5562) =< s(5537)
s(5563) =< s(5538)
s(5564) =< s(5539)
s(5565) =< s(5542)
s(5566) =< s(5543)
s(5567) =< s(5544)
s(5568) =< s(5548)
s(5569) =< s(5549)

  with precondition: [A=103,C=2,3>=D] 

* Chain [1360]: 1952
  with precondition: [A=103,C=2,D>=4] 


#### Cost of chains of f270_loop_cont(A,B,C,D,E):
* Chain [1367]: 0
  with precondition: [A=3,C=2] 

* Chain [1366]: 0
  with precondition: [A=104,C=2] 

* Chain [1365]: 3*s(5608)+12*s(5630)+18*s(5631)+36*s(5633)+24*s(5634)+6*s(5635)+6*s(5636)+24*s(5637)+18*s(5638)+30*s(5639)+48*s(5640)+6*s(5641)+12*s(5642)+12*s(5643)+18*s(5644)+6*s(5645)+11*s(5646)+6*s(5647)+6*s(5648)+0
  Such that:s(5611) =< 2
s(5612) =< 3
s(5613) =< 4
s(5614) =< 5
s(5615) =< 6
s(5616) =< 7
s(5617) =< 8
s(5618) =< 9
aux(263) =< 10
s(5620) =< 11
s(5621) =< 12
s(5622) =< 24
s(5623) =< 25
s(5624) =< 1/2
s(5625) =< 3/2
s(5626) =< 5/2
s(5627) =< 7/2
s(5628) =< 11/2
aux(264) =< -D+1
s(5608) =< aux(264)
s(5630) =< aux(263)
s(5631) =< s(5620)
s(5633) =< s(5612)
s(5634) =< s(5611)
s(5635) =< s(5624)
s(5636) =< s(5625)
s(5637) =< s(5613)
s(5638) =< s(5626)
s(5639) =< s(5615)
s(5640) =< s(5614)
s(5641) =< s(5616)
s(5642) =< s(5617)
s(5643) =< s(5618)
s(5644) =< s(5621)
s(5645) =< s(5622)
s(5646) =< s(5623)
s(5647) =< s(5627)
s(5648) =< s(5628)

  with precondition: [A=104,C=2,0>=D] 

* Chain [1364]: 1982
  with precondition: [A=104,C=2,D>=1] 


#### Cost of chains of f264_loop_cont(A,B,C,D,E):
* Chain [1371]: 0
  with precondition: [A=3,C=2] 

* Chain [1370]: 0
  with precondition: [A=105,C=2] 

* Chain [1369]: 3*s(5687)+33*s(5709)+12*s(5710)+18*s(5711)+36*s(5712)+24*s(5713)+6*s(5714)+6*s(5715)+24*s(5716)+18*s(5717)+48*s(5719)+6*s(5720)+12*s(5721)+12*s(5722)+18*s(5723)+6*s(5724)+11*s(5725)+6*s(5726)+6*s(5727)+0
  Such that:s(5690) =< 2
s(5691) =< 3
s(5692) =< 4
s(5693) =< 5
aux(266) =< 6
s(5695) =< 7
s(5696) =< 8
s(5697) =< 9
s(5698) =< 10
s(5699) =< 11
s(5700) =< 12
s(5701) =< 24
s(5702) =< 25
s(5703) =< 1/2
s(5704) =< 3/2
s(5705) =< 5/2
s(5706) =< 7/2
s(5707) =< 11/2
aux(267) =< -D
s(5687) =< aux(267)
s(5709) =< aux(266)
s(5710) =< s(5698)
s(5711) =< s(5699)
s(5712) =< s(5691)
s(5713) =< s(5690)
s(5714) =< s(5703)
s(5715) =< s(5704)
s(5716) =< s(5692)
s(5717) =< s(5705)
s(5719) =< s(5693)
s(5720) =< s(5695)
s(5721) =< s(5696)
s(5722) =< s(5697)
s(5723) =< s(5700)
s(5724) =< s(5701)
s(5725) =< s(5702)
s(5726) =< s(5706)
s(5727) =< s(5707)

  with precondition: [A=105,C=2,0>=D+1] 

* Chain [1368]: 2000
  with precondition: [A=105,C=2,D>=0] 


#### Cost of chains of f258_loop_cont(A,B,C,D,E):
* Chain [1375]: 0
  with precondition: [A=3,C=2] 

* Chain [1374]: 0
  with precondition: [A=106,C=2] 

* Chain [1373]: 3*s(5766)+51*s(5788)+33*s(5789)+12*s(5790)+18*s(5791)+36*s(5792)+24*s(5793)+6*s(5794)+6*s(5795)+24*s(5796)+18*s(5797)+6*s(5799)+12*s(5800)+12*s(5801)+18*s(5802)+6*s(5803)+11*s(5804)+6*s(5805)+6*s(5806)+0
  Such that:s(5769) =< 2
s(5770) =< 3
s(5771) =< 4
aux(269) =< 5
s(5773) =< 6
s(5774) =< 7
s(5775) =< 8
s(5776) =< 9
s(5777) =< 10
s(5778) =< 11
s(5779) =< 12
s(5780) =< 24
s(5781) =< 25
s(5782) =< 1/2
s(5783) =< 3/2
s(5784) =< 5/2
s(5785) =< 7/2
s(5786) =< 11/2
aux(270) =< -D+1
s(5766) =< aux(270)
s(5788) =< aux(269)
s(5789) =< s(5773)
s(5790) =< s(5777)
s(5791) =< s(5778)
s(5792) =< s(5770)
s(5793) =< s(5769)
s(5794) =< s(5782)
s(5795) =< s(5783)
s(5796) =< s(5771)
s(5797) =< s(5784)
s(5799) =< s(5774)
s(5800) =< s(5775)
s(5801) =< s(5776)
s(5802) =< s(5779)
s(5803) =< s(5780)
s(5804) =< s(5781)
s(5805) =< s(5785)
s(5806) =< s(5786)

  with precondition: [A=106,C=2,0>=D] 

* Chain [1372]: 2015
  with precondition: [A=106,C=2,D>=1] 


#### Cost of chains of f250_loop_cont(A,B,C,D,E):
* Chain [1379]: 0
  with precondition: [A=3,C=2] 

* Chain [1378]: 0
  with precondition: [A=107,C=2] 

* Chain [1377]: 3*s(5845)+36*s(5867)+51*s(5868)+12*s(5870)+18*s(5871)+36*s(5872)+24*s(5873)+6*s(5874)+6*s(5875)+24*s(5876)+18*s(5877)+6*s(5878)+12*s(5879)+12*s(5880)+18*s(5881)+6*s(5882)+11*s(5883)+6*s(5884)+6*s(5885)+0
  Such that:s(5848) =< 2
s(5849) =< 3
s(5850) =< 4
s(5851) =< 5
aux(272) =< 6
s(5853) =< 7
s(5854) =< 8
s(5855) =< 9
s(5856) =< 10
s(5857) =< 11
s(5858) =< 12
s(5859) =< 24
s(5860) =< 25
s(5861) =< 1/2
s(5862) =< 3/2
s(5863) =< 5/2
s(5864) =< 7/2
s(5865) =< 11/2
aux(273) =< -D
s(5845) =< aux(273)
s(5867) =< aux(272)
s(5868) =< s(5851)
s(5870) =< s(5856)
s(5871) =< s(5857)
s(5872) =< s(5849)
s(5873) =< s(5848)
s(5874) =< s(5861)
s(5875) =< s(5862)
s(5876) =< s(5850)
s(5877) =< s(5863)
s(5878) =< s(5853)
s(5879) =< s(5854)
s(5880) =< s(5855)
s(5881) =< s(5858)
s(5882) =< s(5859)
s(5883) =< s(5860)
s(5884) =< s(5864)
s(5885) =< s(5865)

  with precondition: [A=107,C=2,0>=D+1] 

* Chain [1376]: 2033
  with precondition: [A=107,C=2,D>=0] 


#### Cost of chains of f244_loop_cont(A,B,C,D,E):
* Chain [1383]: 0
  with precondition: [A=3,C=2] 

* Chain [1382]: 0
  with precondition: [A=108,C=2] 

* Chain [1381]: 3*s(5924)+54*s(5946)+36*s(5947)+12*s(5949)+18*s(5950)+36*s(5951)+24*s(5952)+6*s(5953)+6*s(5954)+24*s(5955)+18*s(5956)+6*s(5957)+12*s(5958)+12*s(5959)+18*s(5960)+6*s(5961)+11*s(5962)+6*s(5963)+6*s(5964)+0
  Such that:s(5927) =< 2
s(5928) =< 3
s(5929) =< 4
aux(275) =< 5
s(5931) =< 6
s(5932) =< 7
s(5933) =< 8
s(5934) =< 9
s(5935) =< 10
s(5936) =< 11
s(5937) =< 12
s(5938) =< 24
s(5939) =< 25
s(5940) =< 1/2
s(5941) =< 3/2
s(5942) =< 5/2
s(5943) =< 7/2
s(5944) =< 11/2
aux(276) =< -D
s(5924) =< aux(276)
s(5946) =< aux(275)
s(5947) =< s(5931)
s(5949) =< s(5935)
s(5950) =< s(5936)
s(5951) =< s(5928)
s(5952) =< s(5927)
s(5953) =< s(5940)
s(5954) =< s(5941)
s(5955) =< s(5929)
s(5956) =< s(5942)
s(5957) =< s(5932)
s(5958) =< s(5933)
s(5959) =< s(5934)
s(5960) =< s(5937)
s(5961) =< s(5938)
s(5962) =< s(5939)
s(5963) =< s(5943)
s(5964) =< s(5944)

  with precondition: [A=108,C=2,0>=D+1] 

* Chain [1380]: 2048
  with precondition: [A=108,C=2,D>=0] 


#### Cost of chains of f238_loop_cont(A,B,C,D,E):
* Chain [1387]: 0
  with precondition: [A=3,C=2] 

* Chain [1386]: 0
  with precondition: [A=109,C=2] 

* Chain [1385]: 3*s(6003)+27*s(6025)+54*s(6026)+36*s(6027)+12*s(6028)+18*s(6029)+36*s(6030)+24*s(6031)+6*s(6032)+6*s(6033)+18*s(6035)+6*s(6036)+12*s(6037)+12*s(6038)+18*s(6039)+6*s(6040)+11*s(6041)+6*s(6042)+6*s(6043)+0
  Such that:s(6006) =< 2
s(6007) =< 3
aux(278) =< 4
s(6009) =< 5
s(6010) =< 6
s(6011) =< 7
s(6012) =< 8
s(6013) =< 9
s(6014) =< 10
s(6015) =< 11
s(6016) =< 12
s(6017) =< 24
s(6018) =< 25
s(6019) =< 1/2
s(6020) =< 3/2
s(6021) =< 5/2
s(6022) =< 7/2
s(6023) =< 11/2
aux(279) =< -D
s(6003) =< aux(279)
s(6025) =< aux(278)
s(6026) =< s(6009)
s(6027) =< s(6010)
s(6028) =< s(6014)
s(6029) =< s(6015)
s(6030) =< s(6007)
s(6031) =< s(6006)
s(6032) =< s(6019)
s(6033) =< s(6020)
s(6035) =< s(6021)
s(6036) =< s(6011)
s(6037) =< s(6012)
s(6038) =< s(6013)
s(6039) =< s(6016)
s(6040) =< s(6017)
s(6041) =< s(6018)
s(6042) =< s(6022)
s(6043) =< s(6023)

  with precondition: [A=109,C=2,0>=D+2] 

* Chain [1384]: 2060
  with precondition: [A=109,C=2,D+1>=0] 


#### Cost of chains of f232_loop_cont(A,B,C,D,E):
* Chain [1391]: 0
  with precondition: [A=3,C=2] 

* Chain [1390]: 0
  with precondition: [A=110,C=2] 

* Chain [1389]: 3*s(6082)+30*s(6104)+54*s(6106)+36*s(6107)+12*s(6108)+18*s(6109)+36*s(6110)+24*s(6111)+6*s(6112)+6*s(6113)+18*s(6114)+6*s(6115)+12*s(6116)+12*s(6117)+18*s(6118)+6*s(6119)+11*s(6120)+6*s(6121)+6*s(6122)+0
  Such that:s(6085) =< 2
s(6086) =< 3
aux(281) =< 4
s(6088) =< 5
s(6089) =< 6
s(6090) =< 7
s(6091) =< 8
s(6092) =< 9
s(6093) =< 10
s(6094) =< 11
s(6095) =< 12
s(6096) =< 24
s(6097) =< 25
s(6098) =< 1/2
s(6099) =< 3/2
s(6100) =< 5/2
s(6101) =< 7/2
s(6102) =< 11/2
aux(282) =< -D
s(6082) =< aux(282)
s(6104) =< aux(281)
s(6106) =< s(6088)
s(6107) =< s(6089)
s(6108) =< s(6093)
s(6109) =< s(6094)
s(6110) =< s(6086)
s(6111) =< s(6085)
s(6112) =< s(6098)
s(6113) =< s(6099)
s(6114) =< s(6100)
s(6115) =< s(6090)
s(6116) =< s(6091)
s(6117) =< s(6092)
s(6118) =< s(6095)
s(6119) =< s(6096)
s(6120) =< s(6097)
s(6121) =< s(6101)
s(6122) =< s(6102)

  with precondition: [A=110,C=2,0>=D+1] 

* Chain [1388]: 2072
  with precondition: [A=110,C=2,D>=0] 


#### Cost of chains of f224_loop_cont(A,B,C,D,E):
* Chain [1395]: 0
  with precondition: [A=3,C=2] 

* Chain [1394]: 0
  with precondition: [A=111,C=2] 

* Chain [1393]: 3*s(6161)+33*s(6183)+54*s(6185)+36*s(6186)+12*s(6187)+18*s(6188)+36*s(6189)+24*s(6190)+6*s(6191)+6*s(6192)+18*s(6193)+6*s(6194)+12*s(6195)+12*s(6196)+18*s(6197)+6*s(6198)+11*s(6199)+6*s(6200)+6*s(6201)+0
  Such that:s(6164) =< 2
s(6165) =< 3
aux(284) =< 4
s(6167) =< 5
s(6168) =< 6
s(6169) =< 7
s(6170) =< 8
s(6171) =< 9
s(6172) =< 10
s(6173) =< 11
s(6174) =< 12
s(6175) =< 24
s(6176) =< 25
s(6177) =< 1/2
s(6178) =< 3/2
s(6179) =< 5/2
s(6180) =< 7/2
s(6181) =< 11/2
aux(285) =< -D
s(6161) =< aux(285)
s(6183) =< aux(284)
s(6185) =< s(6167)
s(6186) =< s(6168)
s(6187) =< s(6172)
s(6188) =< s(6173)
s(6189) =< s(6165)
s(6190) =< s(6164)
s(6191) =< s(6177)
s(6192) =< s(6178)
s(6193) =< s(6179)
s(6194) =< s(6169)
s(6195) =< s(6170)
s(6196) =< s(6171)
s(6197) =< s(6174)
s(6198) =< s(6175)
s(6199) =< s(6176)
s(6200) =< s(6180)
s(6201) =< s(6181)

  with precondition: [A=111,C=2,0>=D+2] 

* Chain [1392]: 2084
  with precondition: [A=111,C=2,D+1>=0] 


#### Cost of chains of f218_loop_cont(A,B,C,D,E):
* Chain [1399]: 0
  with precondition: [A=3,C=2] 

* Chain [1398]: 0
  with precondition: [A=112,C=2] 

* Chain [1397]: 3*s(6240)+36*s(6262)+54*s(6264)+36*s(6265)+12*s(6266)+18*s(6267)+36*s(6268)+24*s(6269)+6*s(6270)+6*s(6271)+18*s(6272)+6*s(6273)+12*s(6274)+12*s(6275)+18*s(6276)+6*s(6277)+11*s(6278)+6*s(6279)+6*s(6280)+0
  Such that:s(6243) =< 2
s(6244) =< 3
aux(287) =< 4
s(6246) =< 5
s(6247) =< 6
s(6248) =< 7
s(6249) =< 8
s(6250) =< 9
s(6251) =< 10
s(6252) =< 11
s(6253) =< 12
s(6254) =< 24
s(6255) =< 25
s(6256) =< 1/2
s(6257) =< 3/2
s(6258) =< 5/2
s(6259) =< 7/2
s(6260) =< 11/2
aux(288) =< -D
s(6240) =< aux(288)
s(6262) =< aux(287)
s(6264) =< s(6246)
s(6265) =< s(6247)
s(6266) =< s(6251)
s(6267) =< s(6252)
s(6268) =< s(6244)
s(6269) =< s(6243)
s(6270) =< s(6256)
s(6271) =< s(6257)
s(6272) =< s(6258)
s(6273) =< s(6248)
s(6274) =< s(6249)
s(6275) =< s(6250)
s(6276) =< s(6253)
s(6277) =< s(6254)
s(6278) =< s(6255)
s(6279) =< s(6259)
s(6280) =< s(6260)

  with precondition: [A=112,C=2,0>=D+2] 

* Chain [1396]: 2096
  with precondition: [A=112,C=2,D+1>=0] 


#### Cost of chains of f212_loop_cont(A,B,C,D,E):
* Chain [1403]: 0
  with precondition: [A=3,C=2] 

* Chain [1402]: 0
  with precondition: [A=113,C=2] 

* Chain [1401]: 3*s(6319)+39*s(6341)+36*s(6342)+54*s(6343)+36*s(6344)+12*s(6345)+18*s(6346)+24*s(6348)+6*s(6349)+6*s(6350)+18*s(6351)+6*s(6352)+12*s(6353)+12*s(6354)+18*s(6355)+6*s(6356)+11*s(6357)+6*s(6358)+6*s(6359)+0
  Such that:s(6322) =< 2
aux(290) =< 3
s(6324) =< 4
s(6325) =< 5
s(6326) =< 6
s(6327) =< 7
s(6328) =< 8
s(6329) =< 9
s(6330) =< 10
s(6331) =< 11
s(6332) =< 12
s(6333) =< 24
s(6334) =< 25
s(6335) =< 1/2
s(6336) =< 3/2
s(6337) =< 5/2
s(6338) =< 7/2
s(6339) =< 11/2
aux(291) =< -D
s(6319) =< aux(291)
s(6341) =< aux(290)
s(6342) =< s(6324)
s(6343) =< s(6325)
s(6344) =< s(6326)
s(6345) =< s(6330)
s(6346) =< s(6331)
s(6348) =< s(6322)
s(6349) =< s(6335)
s(6350) =< s(6336)
s(6351) =< s(6337)
s(6352) =< s(6327)
s(6353) =< s(6328)
s(6354) =< s(6329)
s(6355) =< s(6332)
s(6356) =< s(6333)
s(6357) =< s(6334)
s(6358) =< s(6338)
s(6359) =< s(6339)

  with precondition: [A=113,C=2,0>=D+3] 

* Chain [1400]: 2105
  with precondition: [A=113,C=2,D+2>=0] 


#### Cost of chains of f206_loop_cont(A,B,C,D,E):
* Chain [1407]: 0
  with precondition: [A=3,C=2] 

* Chain [1406]: 0
  with precondition: [A=114,C=2] 

* Chain [1405]: 3*s(6398)+42*s(6420)+36*s(6422)+54*s(6423)+36*s(6424)+12*s(6425)+18*s(6426)+24*s(6427)+6*s(6428)+6*s(6429)+18*s(6430)+6*s(6431)+12*s(6432)+12*s(6433)+18*s(6434)+6*s(6435)+11*s(6436)+6*s(6437)+6*s(6438)+0
  Such that:s(6401) =< 2
aux(293) =< 3
s(6403) =< 4
s(6404) =< 5
s(6405) =< 6
s(6406) =< 7
s(6407) =< 8
s(6408) =< 9
s(6409) =< 10
s(6410) =< 11
s(6411) =< 12
s(6412) =< 24
s(6413) =< 25
s(6414) =< 1/2
s(6415) =< 3/2
s(6416) =< 5/2
s(6417) =< 7/2
s(6418) =< 11/2
aux(294) =< -D
s(6398) =< aux(294)
s(6420) =< aux(293)
s(6422) =< s(6403)
s(6423) =< s(6404)
s(6424) =< s(6405)
s(6425) =< s(6409)
s(6426) =< s(6410)
s(6427) =< s(6401)
s(6428) =< s(6414)
s(6429) =< s(6415)
s(6430) =< s(6416)
s(6431) =< s(6406)
s(6432) =< s(6407)
s(6433) =< s(6408)
s(6434) =< s(6411)
s(6435) =< s(6412)
s(6436) =< s(6413)
s(6437) =< s(6417)
s(6438) =< s(6418)

  with precondition: [A=114,C=2,0>=D+2] 

* Chain [1404]: 2114
  with precondition: [A=114,C=2,D+1>=0] 


#### Cost of chains of f198_loop_cont(A,B,C,D,E):
* Chain [1411]: 0
  with precondition: [A=3,C=2] 

* Chain [1410]: 0
  with precondition: [A=115,C=2] 

* Chain [1409]: 3*s(6477)+45*s(6499)+36*s(6501)+54*s(6502)+36*s(6503)+12*s(6504)+18*s(6505)+24*s(6506)+6*s(6507)+6*s(6508)+18*s(6509)+6*s(6510)+12*s(6511)+12*s(6512)+18*s(6513)+6*s(6514)+11*s(6515)+6*s(6516)+6*s(6517)+0
  Such that:s(6480) =< 2
aux(296) =< 3
s(6482) =< 4
s(6483) =< 5
s(6484) =< 6
s(6485) =< 7
s(6486) =< 8
s(6487) =< 9
s(6488) =< 10
s(6489) =< 11
s(6490) =< 12
s(6491) =< 24
s(6492) =< 25
s(6493) =< 1/2
s(6494) =< 3/2
s(6495) =< 5/2
s(6496) =< 7/2
s(6497) =< 11/2
aux(297) =< -D
s(6477) =< aux(297)
s(6499) =< aux(296)
s(6501) =< s(6482)
s(6502) =< s(6483)
s(6503) =< s(6484)
s(6504) =< s(6488)
s(6505) =< s(6489)
s(6506) =< s(6480)
s(6507) =< s(6493)
s(6508) =< s(6494)
s(6509) =< s(6495)
s(6510) =< s(6485)
s(6511) =< s(6486)
s(6512) =< s(6487)
s(6513) =< s(6490)
s(6514) =< s(6491)
s(6515) =< s(6492)
s(6516) =< s(6496)
s(6517) =< s(6497)

  with precondition: [A=115,C=2,0>=D+3] 

* Chain [1408]: 2123
  with precondition: [A=115,C=2,D+2>=0] 


#### Cost of chains of f192_loop_cont(A,B,C,D,E):
* Chain [1415]: 0
  with precondition: [A=3,C=2] 

* Chain [1414]: 0
  with precondition: [A=116,C=2] 

* Chain [1413]: 3*s(6556)+48*s(6578)+36*s(6580)+54*s(6581)+36*s(6582)+12*s(6583)+18*s(6584)+24*s(6585)+6*s(6586)+6*s(6587)+18*s(6588)+6*s(6589)+12*s(6590)+12*s(6591)+18*s(6592)+6*s(6593)+11*s(6594)+6*s(6595)+6*s(6596)+0
  Such that:s(6559) =< 2
aux(299) =< 3
s(6561) =< 4
s(6562) =< 5
s(6563) =< 6
s(6564) =< 7
s(6565) =< 8
s(6566) =< 9
s(6567) =< 10
s(6568) =< 11
s(6569) =< 12
s(6570) =< 24
s(6571) =< 25
s(6572) =< 1/2
s(6573) =< 3/2
s(6574) =< 5/2
s(6575) =< 7/2
s(6576) =< 11/2
aux(300) =< -D+3
s(6556) =< aux(300)
s(6578) =< aux(299)
s(6580) =< s(6561)
s(6581) =< s(6562)
s(6582) =< s(6563)
s(6583) =< s(6567)
s(6584) =< s(6568)
s(6585) =< s(6559)
s(6586) =< s(6572)
s(6587) =< s(6573)
s(6588) =< s(6574)
s(6589) =< s(6564)
s(6590) =< s(6565)
s(6591) =< s(6566)
s(6592) =< s(6569)
s(6593) =< s(6570)
s(6594) =< s(6571)
s(6595) =< s(6575)
s(6596) =< s(6576)

  with precondition: [A=116,C=2,2>=D] 

* Chain [1412]: 2132
  with precondition: [A=116,C=2,D>=3] 


#### Cost of chains of f186_loop_cont(A,B,C,D,E):
* Chain [1419]: 0
  with precondition: [A=3,C=2] 

* Chain [1418]: 0
  with precondition: [A=117,C=2] 

* Chain [1417]: 3*s(6635)+27*s(6657)+48*s(6658)+36*s(6659)+54*s(6660)+36*s(6661)+12*s(6662)+18*s(6663)+6*s(6665)+6*s(6666)+18*s(6667)+6*s(6668)+12*s(6669)+12*s(6670)+18*s(6671)+6*s(6672)+11*s(6673)+6*s(6674)+6*s(6675)+0
  Such that:aux(302) =< 2
s(6639) =< 3
s(6640) =< 4
s(6641) =< 5
s(6642) =< 6
s(6643) =< 7
s(6644) =< 8
s(6645) =< 9
s(6646) =< 10
s(6647) =< 11
s(6648) =< 12
s(6649) =< 24
s(6650) =< 25
s(6651) =< 1/2
s(6652) =< 3/2
s(6653) =< 5/2
s(6654) =< 7/2
s(6655) =< 11/2
aux(303) =< -D+2
s(6635) =< aux(303)
s(6657) =< aux(302)
s(6658) =< s(6639)
s(6659) =< s(6640)
s(6660) =< s(6641)
s(6661) =< s(6642)
s(6662) =< s(6646)
s(6663) =< s(6647)
s(6665) =< s(6651)
s(6666) =< s(6652)
s(6667) =< s(6653)
s(6668) =< s(6643)
s(6669) =< s(6644)
s(6670) =< s(6645)
s(6671) =< s(6648)
s(6672) =< s(6649)
s(6673) =< s(6650)
s(6674) =< s(6654)
s(6675) =< s(6655)

  with precondition: [A=117,C=2,1>=D] 

* Chain [1416]: 2138
  with precondition: [A=117,C=2,D>=2] 


#### Cost of chains of f180_loop_cont(A,B,C,D,E):
* Chain [1423]: 0
  with precondition: [A=3,C=2] 

* Chain [1422]: 0
  with precondition: [A=118,C=2] 

* Chain [1421]: 3*s(6714)+3*s(6736)+27*s(6737)+48*s(6738)+36*s(6739)+54*s(6740)+36*s(6741)+12*s(6742)+18*s(6743)+6*s(6744)+6*s(6745)+18*s(6746)+6*s(6747)+12*s(6748)+12*s(6749)+18*s(6750)+6*s(6751)+11*s(6752)+6*s(6753)+6*s(6754)+0
  Such that:s(6735) =< 1
s(6717) =< 2
s(6718) =< 3
s(6719) =< 4
s(6720) =< 5
s(6721) =< 6
s(6722) =< 7
s(6723) =< 8
s(6724) =< 9
s(6725) =< 10
s(6726) =< 11
s(6727) =< 12
s(6728) =< 24
s(6729) =< 25
s(6730) =< 1/2
s(6731) =< 3/2
s(6732) =< 5/2
s(6733) =< 7/2
s(6734) =< 11/2
aux(305) =< -D+3
s(6714) =< aux(305)
s(6736) =< s(6735)
s(6737) =< s(6717)
s(6738) =< s(6718)
s(6739) =< s(6719)
s(6740) =< s(6720)
s(6741) =< s(6721)
s(6742) =< s(6725)
s(6743) =< s(6726)
s(6744) =< s(6730)
s(6745) =< s(6731)
s(6746) =< s(6732)
s(6747) =< s(6722)
s(6748) =< s(6723)
s(6749) =< s(6724)
s(6750) =< s(6727)
s(6751) =< s(6728)
s(6752) =< s(6729)
s(6753) =< s(6733)
s(6754) =< s(6734)

  with precondition: [A=118,C=2,2>=D] 

* Chain [1420]: 2141
  with precondition: [A=118,C=2,D>=3] 


#### Cost of chains of f172_loop_cont(A,B,C,D,E):
* Chain [1427]: 0
  with precondition: [A=3,C=2] 

* Chain [1426]: 0
  with precondition: [A=119,C=2] 

* Chain [1425]: 3*s(6793)+30*s(6816)+3*s(6817)+48*s(6819)+36*s(6820)+54*s(6821)+36*s(6822)+12*s(6823)+18*s(6824)+6*s(6825)+6*s(6826)+18*s(6827)+6*s(6828)+12*s(6829)+12*s(6830)+18*s(6831)+6*s(6832)+11*s(6833)+6*s(6834)+6*s(6835)+0
  Such that:s(6796) =< 1
aux(306) =< 2
s(6798) =< 3
s(6799) =< 4
s(6800) =< 5
s(6801) =< 6
s(6802) =< 7
s(6803) =< 8
s(6804) =< 9
s(6805) =< 10
s(6806) =< 11
s(6807) =< 12
s(6808) =< 24
s(6809) =< 25
s(6810) =< 1/2
s(6811) =< 3/2
s(6812) =< 5/2
s(6813) =< 7/2
s(6814) =< 11/2
aux(307) =< -D+2
s(6793) =< aux(307)
s(6816) =< aux(306)
s(6817) =< s(6796)
s(6819) =< s(6798)
s(6820) =< s(6799)
s(6821) =< s(6800)
s(6822) =< s(6801)
s(6823) =< s(6805)
s(6824) =< s(6806)
s(6825) =< s(6810)
s(6826) =< s(6811)
s(6827) =< s(6812)
s(6828) =< s(6802)
s(6829) =< s(6803)
s(6830) =< s(6804)
s(6831) =< s(6807)
s(6832) =< s(6808)
s(6833) =< s(6809)
s(6834) =< s(6813)
s(6835) =< s(6814)

  with precondition: [A=119,C=2,1>=D] 

* Chain [1424]: 2147
  with precondition: [A=119,C=2,D>=2] 


#### Cost of chains of f166_loop_cont(A,B,C,D,E):
* Chain [1431]: 0
  with precondition: [A=3,C=2] 

* Chain [1430]: 0
  with precondition: [A=120,C=2] 

* Chain [1429]: 3*s(6876)+6*s(6899)+30*s(6900)+48*s(6902)+36*s(6903)+54*s(6904)+36*s(6905)+12*s(6906)+18*s(6907)+6*s(6908)+6*s(6909)+18*s(6910)+6*s(6911)+12*s(6912)+12*s(6913)+18*s(6914)+6*s(6915)+11*s(6916)+6*s(6917)+6*s(6918)+0
  Such that:aux(309) =< 1
s(6880) =< 2
s(6881) =< 3
s(6882) =< 4
s(6883) =< 5
s(6884) =< 6
s(6885) =< 7
s(6886) =< 8
s(6887) =< 9
s(6888) =< 10
s(6889) =< 11
s(6890) =< 12
s(6891) =< 24
s(6892) =< 25
s(6893) =< 1/2
s(6894) =< 3/2
s(6895) =< 5/2
s(6896) =< 7/2
s(6897) =< 11/2
aux(310) =< -D+4
s(6876) =< aux(310)
s(6899) =< aux(309)
s(6900) =< s(6880)
s(6902) =< s(6881)
s(6903) =< s(6882)
s(6904) =< s(6883)
s(6905) =< s(6884)
s(6906) =< s(6888)
s(6907) =< s(6889)
s(6908) =< s(6893)
s(6909) =< s(6894)
s(6910) =< s(6895)
s(6911) =< s(6885)
s(6912) =< s(6886)
s(6913) =< s(6887)
s(6914) =< s(6890)
s(6915) =< s(6891)
s(6916) =< s(6892)
s(6917) =< s(6896)
s(6918) =< s(6897)

  with precondition: [A=120,C=2,3>=D] 

* Chain [1428]: 2150
  with precondition: [A=120,C=2,D>=4] 


#### Cost of chains of f160_loop_cont(A,B,C,D,E):
* Chain [1435]: 0
  with precondition: [A=3,C=2] 

* Chain [1434]: 0
  with precondition: [A=121,C=2] 

* Chain [1433]: 3*s(6959)+39*s(6982)+6*s(6983)+30*s(6984)+48*s(6985)+54*s(6987)+36*s(6988)+12*s(6989)+18*s(6990)+6*s(6991)+6*s(6992)+18*s(6993)+6*s(6994)+12*s(6995)+12*s(6996)+18*s(6997)+6*s(6998)+11*s(6999)+6*s(7000)+6*s(7001)+0
  Such that:s(6962) =< 1
s(6963) =< 2
s(6964) =< 3
aux(312) =< 4
s(6966) =< 5
s(6967) =< 6
s(6968) =< 7
s(6969) =< 8
s(6970) =< 9
s(6971) =< 10
s(6972) =< 11
s(6973) =< 12
s(6974) =< 24
s(6975) =< 25
s(6976) =< 1/2
s(6977) =< 3/2
s(6978) =< 5/2
s(6979) =< 7/2
s(6980) =< 11/2
aux(313) =< -D+3
s(6959) =< aux(313)
s(6982) =< aux(312)
s(6983) =< s(6962)
s(6984) =< s(6963)
s(6985) =< s(6964)
s(6987) =< s(6966)
s(6988) =< s(6967)
s(6989) =< s(6971)
s(6990) =< s(6972)
s(6991) =< s(6976)
s(6992) =< s(6977)
s(6993) =< s(6978)
s(6994) =< s(6968)
s(6995) =< s(6969)
s(6996) =< s(6970)
s(6997) =< s(6973)
s(6998) =< s(6974)
s(6999) =< s(6975)
s(7000) =< s(6979)
s(7001) =< s(6980)

  with precondition: [A=121,C=2,2>=D] 

* Chain [1432]: 2162
  with precondition: [A=121,C=2,D>=3] 


#### Cost of chains of f154_loop_cont(A,B,C,D,E):
* Chain [1439]: 0
  with precondition: [A=3,C=2] 

* Chain [1438]: 0
  with precondition: [A=122,C=2] 

* Chain [1437]: 3*s(7042)+51*s(7065)+39*s(7066)+6*s(7067)+30*s(7068)+54*s(7070)+36*s(7071)+12*s(7072)+18*s(7073)+6*s(7074)+6*s(7075)+18*s(7076)+6*s(7077)+12*s(7078)+12*s(7079)+18*s(7080)+6*s(7081)+11*s(7082)+6*s(7083)+6*s(7084)+0
  Such that:s(7045) =< 1
s(7046) =< 2
aux(315) =< 3
s(7048) =< 4
s(7049) =< 5
s(7050) =< 6
s(7051) =< 7
s(7052) =< 8
s(7053) =< 9
s(7054) =< 10
s(7055) =< 11
s(7056) =< 12
s(7057) =< 24
s(7058) =< 25
s(7059) =< 1/2
s(7060) =< 3/2
s(7061) =< 5/2
s(7062) =< 7/2
s(7063) =< 11/2
aux(316) =< -D+4
s(7042) =< aux(316)
s(7065) =< aux(315)
s(7066) =< s(7048)
s(7067) =< s(7045)
s(7068) =< s(7046)
s(7070) =< s(7049)
s(7071) =< s(7050)
s(7072) =< s(7054)
s(7073) =< s(7055)
s(7074) =< s(7059)
s(7075) =< s(7060)
s(7076) =< s(7061)
s(7077) =< s(7051)
s(7078) =< s(7052)
s(7079) =< s(7053)
s(7080) =< s(7056)
s(7081) =< s(7057)
s(7082) =< s(7058)
s(7083) =< s(7062)
s(7084) =< s(7063)

  with precondition: [A=122,C=2,3>=D] 

* Chain [1436]: 2171
  with precondition: [A=122,C=2,D>=4] 


#### Cost of chains of f0(A,B,C,D):
* Chain [1440]: 2192
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D): 
-------------------------------------
* Chain [1440] with precondition: [] 
    - Upper bound: 2192 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D): 2192 
Asymptotic class: constant 
* Total analysis performed in 5728 ms.

