7.08/2.85	WORST_CASE(NON_POLY, ?)
7.08/2.86	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
7.08/2.86	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
7.08/2.86	
7.08/2.86	
7.08/2.86	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF).
7.08/2.86	
7.08/2.86	(0) CpxIntTrs
7.08/2.86	(1) Loat Proof [FINISHED, 1102 ms]
7.08/2.86	(2) BOUNDS(INF, INF)
7.08/2.86	
7.08/2.86	
7.08/2.86	----------------------------------------
7.08/2.86	
7.08/2.86	(0)
7.08/2.86	Obligation:
7.08/2.86	Complexity Int TRS consisting of the following rules:
7.08/2.86	f8(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f32(A, B, N, D, E, F, G, H, I, J, K, L, M)) :|: A >= B
7.08/2.86	f15(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f8(A, B, C, N, E, F, G, H, I, J, K, L, M)) :|: TRUE
7.08/2.86	f300(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f8(1 + A, B, C, D, E, F, G, H, I, J, K, L, M)) :|: B >= E
7.08/2.86	f8(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f8(1 + A, B, C, D, E, F, G, H, I, J, K, L, M)) :|: B >= 1 + A && B >= E
7.08/2.86	f13(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f1(A, B, N, D, E, O, P, 0, -(2), 0, 0, L, M)) :|: TRUE
7.08/2.86	f12(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f1(A, B, N, D, E, O, P, 0, I, 0, 0, -(1) + I, M)) :|: 4 >= I
7.08/2.86	f10(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f1(A, B, N, D, E, O, P, 0, I, 0, 0, L, -(2))) :|: TRUE
7.08/2.86	f8(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f1(A, B, N, D, E, O, P, 0, I, 0, 0, L, M)) :|: B >= 1 + A && E >= 1 + B
7.08/2.86	f1(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f1(A, B, N, D, E, O, P, 0, I, 0, 0, L, M)) :|: E >= 1 + B && 4 >= M
7.08/2.86	f300(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f1(A, B, N, D, E, O, P, 0, I, 0, 0, L, M)) :|: E >= 1 + B
7.08/2.86	f12(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f300(A, 1 + B, N, D, E, O, G, 1, I, 1, 1, L, M)) :|: I >= 5
7.08/2.86	f1(A, B, C, D, E, F, G, H, I, J, K, L, M) -> Com_1(f300(A, 1 + B, N, D, E, O, G, 1, I, 1, 1, L, M)) :|: E >= 1 + B && M >= 5
7.08/2.86	
7.08/2.86	The start-symbols are:[f15_13]
7.08/2.86	
7.08/2.86	
7.08/2.86	----------------------------------------
7.08/2.86	
7.08/2.86	(1) Loat Proof (FINISHED)
7.08/2.86	
7.08/2.86	
7.08/2.86	### Pre-processing the ITS problem ###
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Initial linear ITS problem
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	      0: f8 -> f32 : C'=free, [ A>=B ], cost: 1
7.08/2.86	
7.08/2.86	      3: f8 -> f8 : A'=1+A, [ B>=1+A && B>=E ], cost: 1
7.08/2.86	
7.08/2.86	      7: f8 -> f1 : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	      2: f300 -> f8 : A'=1+A, [ B>=E ], cost: 1
7.08/2.86	
7.08/2.86	      9: f300 -> f1 : C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	      4: f13 -> f1 : C'=free_3, F'=free_4, G'=free_2, H'=0, Q'=-2, J'=0, K'=0, [], cost: 1
7.08/2.86	
7.08/2.86	      5: f12 -> f1 : C'=free_6, F'=free_7, G'=free_5, H'=0, J'=0, K'=0, L'=-1+Q, [ 4>=Q ], cost: 1
7.08/2.86	
7.08/2.86	     10: f12 -> f300 : B'=1+B, C'=free_20, F'=free_21, H'=1, J'=1, K'=1, [ Q>=5 ], cost: 1
7.08/2.86	
7.08/2.86	      6: f10 -> f1 : C'=free_9, F'=free_10, G'=free_8, H'=0, J'=0, K'=0, M'=-2, [], cost: 1
7.08/2.86	
7.08/2.86	      8: f1 -> f1 : C'=free_15, F'=free_16, G'=free_14, H'=0, J'=0, K'=0, [ E>=1+B && 4>=M ], cost: 1
7.08/2.86	
7.08/2.86	     11: f1 -> f300 : B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 ], cost: 1
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Removed unreachable and leaf rules:
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	      3: f8 -> f8 : A'=1+A, [ B>=1+A && B>=E ], cost: 1
7.08/2.86	
7.08/2.86	      7: f8 -> f1 : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	      2: f300 -> f8 : A'=1+A, [ B>=E ], cost: 1
7.08/2.86	
7.08/2.86	      9: f300 -> f1 : C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	      8: f1 -> f1 : C'=free_15, F'=free_16, G'=free_14, H'=0, J'=0, K'=0, [ E>=1+B && 4>=M ], cost: 1
7.08/2.86	
7.08/2.86	     11: f1 -> f300 : B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 ], cost: 1
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	### Simplification by acceleration and chaining ###
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Accelerating simple loops of location 0.
7.08/2.86	
7.08/2.86	   Accelerating the following rules:
7.08/2.86	
7.08/2.86	      3: f8 -> f8 : A'=1+A, [ B>=1+A && B>=E ], cost: 1
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	   Accelerated rule 3 with metering function -A+B, yielding the new rule 12.
7.08/2.86	
7.08/2.86	   Removing the simple loops: 3.
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Accelerating simple loops of location 6.
7.08/2.86	
7.08/2.86	   Accelerating the following rules:
7.08/2.86	
7.08/2.86	      8: f1 -> f1 : C'=free_15, F'=free_16, G'=free_14, H'=0, J'=0, K'=0, [ E>=1+B && 4>=M ], cost: 1
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	   Accelerated rule 8 with NONTERM, yielding the new rule 13.
7.08/2.86	
7.08/2.86	   Removing the simple loops: 8.
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Accelerated all simple loops using metering functions (where possible):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	      7: f8 -> f1 : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	     12: f8 -> f8 : A'=B, [ B>=1+A && B>=E ], cost: -A+B
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	      2: f300 -> f8 : A'=1+A, [ B>=E ], cost: 1
7.08/2.86	
7.08/2.86	      9: f300 -> f1 : C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	     11: f1 -> f300 : B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 ], cost: 1
7.08/2.86	
7.08/2.86	     13: f1 -> [9] : [ E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Chained accelerated rules (with incoming rules):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	      7: f8 -> f1 : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	     16: f8 -> [9] : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	     14: f15 -> f8 : A'=B, D'=free_1, [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	      2: f300 -> f8 : A'=1+A, [ B>=E ], cost: 1
7.08/2.86	
7.08/2.86	      9: f300 -> f1 : C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	     15: f300 -> f8 : A'=B, [ B>=E && B>=2+A ], cost: -A+B
7.08/2.86	
7.08/2.86	     17: f300 -> [9] : C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	     11: f1 -> f300 : B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 ], cost: 1
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Eliminated locations (on tree-shaped paths):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	      7: f8 -> f1 : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	     16: f8 -> [9] : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	     14: f15 -> f8 : A'=B, D'=free_1, [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	     18: f1 -> f8 : A'=1+A, B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 && 1+B>=E ], cost: 2
7.08/2.86	
7.08/2.86	     19: f1 -> f1 : B'=1+B, C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ M>=5 && E>=2+B ], cost: 2
7.08/2.86	
7.08/2.86	     20: f1 -> f8 : A'=1+B, B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 && 1+B>=E && 1+B>=2+A ], cost: 2-A+B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Accelerating simple loops of location 6.
7.08/2.86	
7.08/2.86	   Accelerating the following rules:
7.08/2.86	
7.08/2.86	     19: f1 -> f1 : B'=1+B, C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ M>=5 && E>=2+B ], cost: 2
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	   Accelerated rule 19 with metering function -1+E-B, yielding the new rule 21.
7.08/2.86	
7.08/2.86	   Removing the simple loops: 19.
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Accelerated all simple loops using metering functions (where possible):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	      7: f8 -> f1 : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	     16: f8 -> [9] : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	     14: f15 -> f8 : A'=B, D'=free_1, [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	     18: f1 -> f8 : A'=1+A, B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 && 1+B>=E ], cost: 2
7.08/2.86	
7.08/2.86	     20: f1 -> f8 : A'=1+B, B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 && 1+B>=E && 1+B>=2+A ], cost: 2-A+B
7.08/2.86	
7.08/2.86	     21: f1 -> f1 : B'=-1+E, C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ M>=5 && E>=2+B ], cost: -2+2*E-2*B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Chained accelerated rules (with incoming rules):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	      7: f8 -> f1 : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B ], cost: 1
7.08/2.86	
7.08/2.86	     16: f8 -> [9] : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	     22: f8 -> f1 : B'=-1+E, C'=free_18, F'=free_19, G'=free_17, H'=0, J'=0, K'=0, [ B>=1+A && M>=5 && E>=2+B ], cost: -1+2*E-2*B
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	     14: f15 -> f8 : A'=B, D'=free_1, [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	     18: f1 -> f8 : A'=1+A, B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 && 1+B>=E ], cost: 2
7.08/2.86	
7.08/2.86	     20: f1 -> f8 : A'=1+B, B'=1+B, C'=free_22, F'=free_23, H'=1, J'=1, K'=1, [ E>=1+B && M>=5 && 1+B>=E && 1+B>=2+A ], cost: 2-A+B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Eliminated locations (on tree-shaped paths):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	     16: f8 -> [9] : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	     23: f8 -> f8 : A'=1+A, B'=1+B, C'=free_22, F'=free_23, G'=free_11, H'=1, J'=1, K'=1, [ B>=1+A && E>=1+B && M>=5 && 1+B>=E ], cost: 3
7.08/2.86	
7.08/2.86	     24: f8 -> f8 : A'=1+B, B'=1+B, C'=free_22, F'=free_23, G'=free_11, H'=1, J'=1, K'=1, [ B>=1+A && E>=1+B && M>=5 && 1+B>=E ], cost: 3-A+B
7.08/2.86	
7.08/2.86	     25: f8 -> f8 : A'=1+A, B'=E, C'=free_22, F'=free_23, G'=free_17, H'=1, J'=1, K'=1, [ B>=1+A && M>=5 && E>=2+B ], cost: 1+2*E-2*B
7.08/2.86	
7.08/2.86	     26: f8 -> f8 : A'=E, B'=E, C'=free_22, F'=free_23, G'=free_17, H'=1, J'=1, K'=1, [ B>=1+A && M>=5 && E>=2+B && E>=2+A ], cost: -A+3*E-2*B
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	     14: f15 -> f8 : A'=B, D'=free_1, [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Accelerating simple loops of location 0.
7.08/2.86	
7.08/2.86	   Simplified some of the simple loops (and removed duplicate rules).
7.08/2.86	
7.08/2.86	   Accelerating the following rules:
7.08/2.86	
7.08/2.86	     23: f8 -> f8 : A'=1+A, B'=1+B, C'=free_22, F'=free_23, G'=free_11, H'=1, J'=1, K'=1, [ B>=1+A && 1-E+B==0 && M>=5 ], cost: 3
7.08/2.86	
7.08/2.86	     24: f8 -> f8 : A'=1+B, B'=1+B, C'=free_22, F'=free_23, G'=free_11, H'=1, J'=1, K'=1, [ B>=1+A && 1-E+B==0 && M>=5 ], cost: 3-A+B
7.08/2.86	
7.08/2.86	     25: f8 -> f8 : A'=1+A, B'=E, C'=free_22, F'=free_23, G'=free_17, H'=1, J'=1, K'=1, [ B>=1+A && M>=5 && E>=2+B ], cost: 1+2*E-2*B
7.08/2.86	
7.08/2.86	     26: f8 -> f8 : A'=E, B'=E, C'=free_22, F'=free_23, G'=free_17, H'=1, J'=1, K'=1, [ B>=1+A && M>=5 && E>=2+B && E>=2+A ], cost: -A+3*E-2*B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	   Accelerated rule 23 with metering function E-B, yielding the new rule 27.
7.08/2.86	
7.08/2.86	   Accelerated rule 24 with metering function -1+E-B, yielding the new rule 28.
7.08/2.86	
7.08/2.86	   Found no metering function for rule 25.
7.08/2.86	
7.08/2.86	   Found no metering function for rule 26.
7.08/2.86	
7.08/2.86	   Removing the simple loops: 23 24.
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Accelerated all simple loops using metering functions (where possible):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	     16: f8 -> [9] : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	     25: f8 -> f8 : A'=1+A, B'=E, C'=free_22, F'=free_23, G'=free_17, H'=1, J'=1, K'=1, [ B>=1+A && M>=5 && E>=2+B ], cost: 1+2*E-2*B
7.08/2.86	
7.08/2.86	     26: f8 -> f8 : A'=E, B'=E, C'=free_22, F'=free_23, G'=free_17, H'=1, J'=1, K'=1, [ B>=1+A && M>=5 && E>=2+B && E>=2+A ], cost: -A+3*E-2*B
7.08/2.86	
7.08/2.86	     27: f8 -> f8 : A'=A+E-B, B'=E, C'=free_22, F'=free_23, G'=free_11, H'=1, J'=1, K'=1, [ B>=1+A && 1-E+B==0 && M>=5 ], cost: 3*E-3*B
7.08/2.86	
7.08/2.86	     28: f8 -> f8 : A'=-1+E, B'=-1+E, C'=free_22, F'=free_23, G'=free_11, H'=1, J'=1, K'=1, [ B>=1+A && 1-E+B==0 && M>=5 && -1+E-B>=1 ], cost: -3+3*E-3*B
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	     14: f15 -> f8 : A'=B, D'=free_1, [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Chained accelerated rules (with incoming rules):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	     16: f8 -> [9] : C'=free_12, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	      1: f15 -> f8 : D'=free_1, [], cost: 1
7.08/2.86	
7.08/2.86	     14: f15 -> f8 : A'=B, D'=free_1, [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	     29: f15 -> f8 : A'=1+A, B'=E, C'=free_22, D'=free_1, F'=free_23, G'=free_17, H'=1, J'=1, K'=1, [ B>=1+A && M>=5 && E>=2+B ], cost: 2+2*E-2*B
7.08/2.86	
7.08/2.86	     30: f15 -> f8 : A'=E, B'=E, C'=free_22, D'=free_1, F'=free_23, G'=free_17, H'=1, J'=1, K'=1, [ B>=1+A && M>=5 && E>=2+B && E>=2+A ], cost: 1-A+3*E-2*B
7.08/2.86	
7.08/2.86	     31: f15 -> f8 : A'=A+E-B, B'=E, C'=free_22, D'=free_1, F'=free_23, G'=free_11, H'=1, J'=1, K'=1, [ B>=1+A && 1-E+B==0 && M>=5 ], cost: 1+3*E-3*B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Eliminated locations (on tree-shaped paths):
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	     32: f15 -> [9] : C'=free_12, D'=free_1, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	     33: f15 -> [12] : [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	     34: f15 -> [12] : [ B>=1+A && M>=5 && E>=2+B ], cost: 2+2*E-2*B
7.08/2.86	
7.08/2.86	     35: f15 -> [12] : [ B>=1+A && M>=5 && E>=2+B && E>=2+A ], cost: 1-A+3*E-2*B
7.08/2.86	
7.08/2.86	     36: f15 -> [12] : [ B>=1+A && 1-E+B==0 && M>=5 ], cost: 1+3*E-3*B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	### Computing asymptotic complexity ###
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Fully simplified ITS problem
7.08/2.86	
7.08/2.86	   Start location: f15
7.08/2.86	
7.08/2.86	     32: f15 -> [9] : C'=free_12, D'=free_1, F'=free_13, G'=free_11, H'=0, J'=0, K'=0, [ B>=1+A && E>=1+B && 4>=M ], cost: INF
7.08/2.86	
7.08/2.86	     33: f15 -> [12] : [ B>=1+A && B>=E ], cost: 1-A+B
7.08/2.86	
7.08/2.86	     34: f15 -> [12] : [ B>=1+A && M>=5 && E>=2+B ], cost: 2+2*E-2*B
7.08/2.86	
7.08/2.86	     35: f15 -> [12] : [ B>=1+A && M>=5 && E>=2+B && E>=2+A ], cost: 1-A+3*E-2*B
7.08/2.86	
7.08/2.86	     36: f15 -> [12] : [ B>=1+A && 1-E+B==0 && M>=5 ], cost: 1+3*E-3*B
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Computing asymptotic complexity for rule 32
7.08/2.86	
7.08/2.86	   Resulting cost INF has complexity: Nonterm
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Found new complexity Nonterm.
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	Obtained the following overall complexity (w.r.t. the length of the input n):
7.08/2.86	
7.08/2.86	   Complexity:  Nonterm
7.08/2.86	
7.08/2.86	   Cpx degree:  Nonterm
7.08/2.86	
7.08/2.86	   Solved cost: INF
7.08/2.86	
7.08/2.86	   Rule cost:   INF
7.08/2.86	
7.08/2.86	   Rule guard:  [ B>=1+A && E>=1+B && 4>=M ]
7.08/2.86	
7.08/2.86	
7.08/2.86	
7.08/2.86	NO
7.08/2.86	
7.08/2.86	
7.08/2.86	----------------------------------------
7.08/2.86	
7.08/2.86	(2)
7.08/2.86	BOUNDS(INF, INF)
7.08/2.89	EOF