277.42/249.62	WORST_CASE(Omega(n^1), ?)
277.42/249.64	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
277.42/249.64	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
277.42/249.64	
277.42/249.64	
277.42/249.64	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF).
277.42/249.64	
277.42/249.64	(0) CpxIntTrs
277.42/249.64	(1) Loat Proof [FINISHED, 1968 ms]
277.42/249.64	(2) BOUNDS(n^1, INF)
277.42/249.64	
277.42/249.64	
277.42/249.64	----------------------------------------
277.42/249.64	
277.42/249.64	(0)
277.42/249.64	Obligation:
277.42/249.64	Complexity Int TRS consisting of the following rules:
277.42/249.64	f12(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f116(A, B, 1, -(1), F, F, Z1, 1 + F, A2, Z1, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: A >= 2 && Y1 >= A && B >= 0 && C >= 1 && C <= 1
277.42/249.64	f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f116(A, B, 2, D, Z1, -(1) + Z1, G, H, I, A2, 2, -(1), Y1, B2, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: E >= 0 && A >= 2
277.42/249.64	f116(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f300(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, 1, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: F >= O && P >= 1 && P <= 1
277.42/249.64	f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f1(A, 1 + B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, S, Z1, S, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: B >= 0 && Q >= B + 1
277.42/249.64	f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f116(A, Z1, 0, D, E, F, G, H, I, J, K, L, M, N, O, P, A2, Y1, D2, B2, R, R, E2, F2, G2, Z1, C2, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: A >= 2 && C2 >= A && F >= A && B >= Q && B >= 0 && C >= 0 && C <= 0
277.42/249.64	f7(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f8(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, Z1, D1, D1, -(1) + Z1, -(1), G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: B1 >= 0
277.42/249.64	f7(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f10(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, E2, Z, A1, B1, F2, D2, E1, F1, B2, Z1, A2, Y1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: B1 >= 0 && G1 >= D1 && G1 <= D1
277.42/249.64	f8(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f8(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, 0, H1, W, X, Y, Z, A1, B1, D1, D1, -(1) + E1, F1, 0, H1, 0, H1, -(1) + E1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: E1 >= 0 && A >= 2 && I1 >= 0 && I1 <= 0 && H1 >= V && H1 <= V && G1 >= 0 && G1 <= 0 && U >= 0 && U <= 0 && J1 >= V && J1 <= V
277.42/249.64	f8(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f10(E2, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, F2, Z, A1, B1, G2, D2, E1, F1, B2, Z1, A2, Y1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: E1 >= 0 && G1 >= D1 && G1 <= D1
277.42/249.64	f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f8(A, B, E1 + 1, D, 0, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, 0, V, W, X, Y, Z, A1, E1, V, V, E1, F1, 0, V, 0, V, K1, -(1), M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: A >= 2 && U >= 0 && U <= 0 && E >= 0 && E <= 0 && C >= 1 && C <= 1
277.42/249.64	f116(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f116(A, B, 1 + C, D, E, -(1) + F, G, H, I, J, K, L, M, N, F, 1, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, U, 1 + C, -(1) + F, P1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: A >= 2 && C >= 0 && F >= 0 && P >= 0 && P <= 0 && U >= M1 && U <= M1
277.42/249.64	f116(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f8(A, B, E1 + 1, D, E, F, G, H, I, J, K, L, M, N, F, 1, Q, R, S, T, 0, V, W, X, Y, Z, A1, E1, V, V, E1, F1, 0, V, 0, V, K1, -(1), M1, N1, O1, Z1, Q1, R1, S1, T1, U1, V1, W1, X1)) :|: Z1 >= 0 && A >= 2 && C >= 0 && F >= 0 && U >= 0 && U <= 0 && P >= 0 && P <= 0
277.42/249.64	f9(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f1(Z1, 2, C, D, E, F, G, H, I, J, K, L, M, N, O, 0, Z1, S, B2, S, U, V, S, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, A2, Y1, D2, 2, E2, V1, W1, X1)) :|: Z1 >= 2 && S >= W && S <= W
277.42/249.64	f9(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f10(F2, E2, C, D, E, F, G, H, I, J, K, L, M, N, O, 0, C2, H2, J2, I2, 0, 0, K2, L2, M2, Z, A1, B1, N2, D2, E1, F1, B2, Z1, A2, Y1, K1, L1, M1, N1, O1, P1, Q1, G2, S1, T1, U1, V1, W1, X1)) :|: 0 >= F2
277.42/249.64	f9(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1, W1, X1) -> Com_1(f10(1, E2, C, D, E, F, G, H, I, J, K, L, M, N, O, 0, H2, I2, K2, J2, 0, 0, M2, N2, O2, Z, A1, B1, Q2, D2, E1, F1, B2, Z1, A2, Y1, K1, L1, M1, N1, O1, P1, G2, C2, L2, T1, U1, F2, G2, P2)) :|: S >= 0 && S <= 0 && W >= 0 && W <= 0
277.42/249.64	
277.42/249.64	The start-symbols are:[f9_50]
277.42/249.64	
277.42/249.64	
277.42/249.64	----------------------------------------
277.42/249.64	
277.42/249.64	(1) Loat Proof (FINISHED)
277.42/249.64	
277.42/249.64	
277.42/249.64	### Pre-processing the ITS problem ###
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Initial linear ITS problem
277.42/249.64	
277.42/249.64	   Start location: f9
277.42/249.64	
277.42/249.64	      0: f12 -> f116 : C'=1, D'=-1, E'=F, G'=free, H'=1+F, Q'=free_1, J'=free, [ A>=2 && free_2>=A && B>=0 && C==1 ], cost: 1
277.42/249.64	
277.42/249.64	      1: f13 -> f116 : C'=2, E'=free_3, F'=-1+free_3, J'=free_5, K'=2, L'=-1, M'=free_6, N'=free_4, [ E>=0 && A>=2 ], cost: 1
277.42/249.64	
277.42/249.64	      9: f13 -> f8 : B1'=E1, C'=1+E1, C1'=V, D1'=V, E'=0, G1'=0, H1'=V, Q1'=0, J1'=V, L1'=-1, U'=0, [ A>=2 && U==0 && E==0 && C==1 ], cost: 1
277.42/249.64	
277.42/249.64	      2: f116 -> f300 : A1'=B, A2'=C, B'=D, B1'=E, B2'=F, C'=G, C1'=H, C2'=Q, D'=J, D1'=K, D2'=L, E'=M, E1'=N, E2'=O, F'=1, F1'=Q_1, F2'=R, G'=S, G1'=T, G2'=U, H'=V, H1'=W, H2'=X, Q'=Y, Q1'=Z, Q2'=A1, J'=B1, J1'=C1, J2'=D1, K'=E1, K1'=F1, K2'=G1, L'=H1, L1'=Q1, L2'=J1, M'=K1, M1'=L1, M2'=M1, N'=N1, N1'=O1, N2'=P1, O'=Q1_1, O1'=R1, O2'=S1, P'=T1, P1'=U1, P2'=V1, Q_1'=W1, Q1_1'=X1, [ F>=O && P==1 ], cost: 1
277.42/249.64	
277.42/249.64	     10: f116 -> f116 : C'=1+C, F'=-1+F, M1'=U, N1'=1+C, O'=F, O1'=-1+F, P'=1, [ A>=2 && C>=0 && F>=0 && P==0 && U==M1 ], cost: 1
277.42/249.64	
277.42/249.64	     11: f116 -> f8 : B1'=E1, C'=1+E1, C1'=V, D1'=V, G1'=0, H1'=V, Q1'=0, J1'=V, L1'=-1, O'=F, P'=1, P1'=free_33, U'=0, [ free_33>=0 && A>=2 && C>=0 && F>=0 && U==0 && P==0 ], cost: 1
277.42/249.64	
277.42/249.64	      3: f1 -> f1 : B'=1+B, R'=S, S'=free_7, T'=S, [ B>=0 && Q_1>=1+B ], cost: 1
277.42/249.64	
277.42/249.64	      4: f1 -> f116 : A1'=free_10, B'=free_9, C'=0, Q_1'=free_12, R'=free_13, S'=free_11, T'=free_8, U'=R, V'=R, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ A>=2 && free_10>=A && F>=A && B>=Q_1 && B>=0 && C==0 ], cost: 1
277.42/249.64	
277.42/249.64	      5: f7 -> f8 : B1'=free_17, C1'=D1, E1'=-1+free_17, F1'=-1, [ B1>=0 ], cost: 1
277.42/249.64	
277.42/249.64	      6: f7 -> f10 : A1'=B, A2'=C, B'=D, B1'=E, B2'=F, C'=G, C1'=H, C2'=Q, D'=J, D1'=K, D2'=L, E'=M, E1'=N, E2'=O, F'=P, F1'=Q_1, F2'=R, G'=S, G1'=T, G2'=U, H'=V, H1'=W, H2'=X, Q'=free_19, Q1'=Z, Q2'=A1, J'=B1, J1'=free_21, J2'=free_22, K'=E1, K1'=F1, K2'=free_20, L'=free_18, L1'=free_24, L2'=free_23, M'=K1, M1'=L1, M2'=M1, N'=N1, N1'=O1, N2'=P1, O'=Q1_1, O1'=R1, O2'=S1, P'=T1, P1'=U1, P2'=V1, Q_1'=W1, Q1_1'=X1, [ B1>=0 && G1==D1 ], cost: 1
277.42/249.64	
277.42/249.64	      7: f8 -> f8 : C1'=D1, E1'=-1+E1, G1'=0, Q1'=0, J1'=H1, K1'=-1+E1, U'=0, V'=H1, [ E1>=0 && A>=2 && Q1==0 && H1==V && G1==0 && U==0 && J1==V ], cost: 1
277.42/249.64	
277.42/249.64	      8: f8 -> f10 : A'=free_26, A1'=B, A2'=C, B'=D, B1'=E, B2'=F, C'=G, C1'=H, C2'=Q, D'=J, D1'=K, D2'=L, E'=M, E1'=N, E2'=O, F'=P, F1'=Q_1, F2'=R, G'=S, G1'=T, G2'=U, H'=V, H1'=W, H2'=X, Q'=free_28, Q1'=Z, Q2'=A1, J'=B1, J1'=free_29, J2'=free_27, K'=E1, K1'=F1, K2'=free_25, L'=free_32, L1'=free_31, L2'=free_30, M'=K1, M1'=L1, M2'=M1, N'=N1, N1'=O1, N2'=P1, O'=Q1_1, O1'=R1, O2'=S1, P'=T1, P1'=U1, P2'=V1, Q_1'=W1, Q1_1'=X1, [ E1>=0 && G1==D1 ], cost: 1
277.42/249.64	
277.42/249.64	     12: f9 -> f1 : A'=free_35, B'=2, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=S, R1'=free_36, S'=free_37, S1'=free_34, T'=S, T1'=2, U1'=free_39, W'=S, [ free_35>=2 && S==W ], cost: 1
277.42/249.64	
277.42/249.64	     13: f9 -> f10 : A'=free_41, A1'=free_44, A2'=C, B'=D, B1'=E, B2'=F, C'=G, C1'=H, C2'=Q, D'=J, D1'=K, D2'=L, E'=M, E1'=N, E2'=O, F'=0, F1'=free_45, F2'=free_43, G'=free_40, G1'=free_55, G2'=0, H'=0, H1'=free_54, H2'=free_52, Q'=free_42, Q1'=Z, Q2'=A1, J'=B1, J1'=free_50, J2'=free_48, K'=E1, K1'=F1, K2'=free_53, L'=free_51, L1'=free_49, L2'=free_47, M'=K1, M1'=L1, M2'=M1, N'=N1, N1'=O1, N2'=P1, O'=Q1_1, O1'=free_46, O2'=S1, P'=T1, P1'=U1, P2'=V1, Q_1'=W1, Q1_1'=X1, [ 0>=free_41 ], cost: 1
277.42/249.64	
277.42/249.64	     14: f9 -> f10 : A'=1, A1'=free_57, A2'=C, B'=D, B1'=E, B2'=F, C'=G, C1'=H, C2'=Q, D'=J, D1'=K, D2'=L, E'=M, E1'=N, E2'=O, F'=0, F1'=free_60, F2'=free_64, G'=free_59, G1'=free_56, G2'=0, H'=0, H1'=free_74, H2'=free_73, Q'=free_71, Q1'=Z, Q2'=A1, J'=B1, J1'=free_58, J2'=free_69, K'=E1, K1'=F1, K2'=free_67, L'=free_72, L1'=free_70, L2'=free_68, M'=K1, M1'=L1, M2'=M1, N'=N1, N1'=O1, N2'=P1, O'=free_66, O1'=free_65, O2'=free_63, P'=T1, P1'=U1, P2'=free_62, Q_1'=free_66, Q1_1'=free_61, [ S==0 && W==0 ], cost: 1
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Removed unreachable and leaf rules:
277.42/249.64	
277.42/249.64	   Start location: f9
277.42/249.64	
277.42/249.64	     10: f116 -> f116 : C'=1+C, F'=-1+F, M1'=U, N1'=1+C, O'=F, O1'=-1+F, P'=1, [ A>=2 && C>=0 && F>=0 && P==0 && U==M1 ], cost: 1
277.42/249.64	
277.42/249.64	     11: f116 -> f8 : B1'=E1, C'=1+E1, C1'=V, D1'=V, G1'=0, H1'=V, Q1'=0, J1'=V, L1'=-1, O'=F, P'=1, P1'=free_33, U'=0, [ free_33>=0 && A>=2 && C>=0 && F>=0 && U==0 && P==0 ], cost: 1
277.42/249.64	
277.42/249.64	      3: f1 -> f1 : B'=1+B, R'=S, S'=free_7, T'=S, [ B>=0 && Q_1>=1+B ], cost: 1
277.42/249.64	
277.42/249.64	      4: f1 -> f116 : A1'=free_10, B'=free_9, C'=0, Q_1'=free_12, R'=free_13, S'=free_11, T'=free_8, U'=R, V'=R, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ A>=2 && free_10>=A && F>=A && B>=Q_1 && B>=0 && C==0 ], cost: 1
277.42/249.64	
277.42/249.64	      7: f8 -> f8 : C1'=D1, E1'=-1+E1, G1'=0, Q1'=0, J1'=H1, K1'=-1+E1, U'=0, V'=H1, [ E1>=0 && A>=2 && Q1==0 && H1==V && G1==0 && U==0 && J1==V ], cost: 1
277.42/249.64	
277.42/249.64	     12: f9 -> f1 : A'=free_35, B'=2, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=S, R1'=free_36, S'=free_37, S1'=free_34, T'=S, T1'=2, U1'=free_39, W'=S, [ free_35>=2 && S==W ], cost: 1
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	### Simplification by acceleration and chaining ###
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Accelerating simple loops of location 2.
277.42/249.64	
277.42/249.64	   Accelerating the following rules:
277.42/249.64	
277.42/249.64	     10: f116 -> f116 : C'=1+C, F'=-1+F, M1'=U, N1'=1+C, O'=F, O1'=-1+F, P'=1, [ A>=2 && C>=0 && F>=0 && P==0 && U==M1 ], cost: 1
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Accelerated rule 10 with metering function -P, yielding the new rule 15.
277.42/249.64	
277.42/249.64	   Removing the simple loops: 10.
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Accelerating simple loops of location 3.
277.42/249.64	
277.42/249.64	   Accelerating the following rules:
277.42/249.64	
277.42/249.64	      3: f1 -> f1 : B'=1+B, R'=S, S'=free_7, T'=S, [ B>=0 && Q_1>=1+B ], cost: 1
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Accelerated rule 3 with metering function -B+Q_1, yielding the new rule 16.
277.42/249.64	
277.42/249.64	   Removing the simple loops: 3.
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Accelerating simple loops of location 5.
277.42/249.64	
277.42/249.64	   Accelerating the following rules:
277.42/249.64	
277.42/249.64	      7: f8 -> f8 : C1'=D1, E1'=-1+E1, G1'=0, Q1'=0, J1'=H1, K1'=-1+E1, U'=0, V'=H1, [ E1>=0 && A>=2 && Q1==0 && H1==V && G1==0 && U==0 && J1==V ], cost: 1
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Accelerated rule 7 with metering function 1+E1, yielding the new rule 17.
277.42/249.64	
277.42/249.64	   Removing the simple loops: 7.
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Accelerated all simple loops using metering functions (where possible):
277.42/249.64	
277.42/249.64	   Start location: f9
277.42/249.64	
277.42/249.64	     11: f116 -> f8 : B1'=E1, C'=1+E1, C1'=V, D1'=V, G1'=0, H1'=V, Q1'=0, J1'=V, L1'=-1, O'=F, P'=1, P1'=free_33, U'=0, [ free_33>=0 && A>=2 && C>=0 && F>=0 && U==0 && P==0 ], cost: 1
277.42/249.64	
277.42/249.64	     15: f116 -> f116 : C'=C-P, F'=F+P, M1'=U, N1'=C-P, O'=1+F+P, O1'=F+P, P'=1, [ A>=2 && C>=0 && F>=0 && P==0 && U==M1 && -P>=1 ], cost: -P
277.42/249.64	
277.42/249.64	      4: f1 -> f116 : A1'=free_10, B'=free_9, C'=0, Q_1'=free_12, R'=free_13, S'=free_11, T'=free_8, U'=R, V'=R, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ A>=2 && free_10>=A && F>=A && B>=Q_1 && B>=0 && C==0 ], cost: 1
277.42/249.64	
277.42/249.64	     16: f1 -> f1 : B'=Q_1, R'=free_7, S'=free_7, T'=free_7, [ B>=0 && Q_1>=1+B ], cost: -B+Q_1
277.42/249.64	
277.42/249.64	     17: f8 -> f8 : C1'=D1, E1'=-1, G1'=0, Q1'=0, J1'=H1, K1'=-1, U'=0, V'=H1, [ E1>=0 && A>=2 && Q1==0 && H1==V && G1==0 && U==0 && J1==V ], cost: 1+E1
277.42/249.64	
277.42/249.64	     12: f9 -> f1 : A'=free_35, B'=2, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=S, R1'=free_36, S'=free_37, S1'=free_34, T'=S, T1'=2, U1'=free_39, W'=S, [ free_35>=2 && S==W ], cost: 1
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Chained accelerated rules (with incoming rules):
277.42/249.64	
277.42/249.64	   Start location: f9
277.42/249.64	
277.42/249.64	     11: f116 -> f8 : B1'=E1, C'=1+E1, C1'=V, D1'=V, G1'=0, H1'=V, Q1'=0, J1'=V, L1'=-1, O'=F, P'=1, P1'=free_33, U'=0, [ free_33>=0 && A>=2 && C>=0 && F>=0 && U==0 && P==0 ], cost: 1
277.42/249.64	
277.42/249.64	     19: f116 -> f8 : B1'=E1, C'=1+E1, C1'=V, D1'=V, E1'=-1, G1'=0, H1'=V, Q1'=0, J1'=V, K1'=-1, L1'=-1, O'=F, P'=1, P1'=free_33, U'=0, [ free_33>=0 && A>=2 && C>=0 && F>=0 && U==0 && P==0 && E1>=0 ], cost: 2+E1
277.42/249.64	
277.42/249.64	      4: f1 -> f116 : A1'=free_10, B'=free_9, C'=0, Q_1'=free_12, R'=free_13, S'=free_11, T'=free_8, U'=R, V'=R, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ A>=2 && free_10>=A && F>=A && B>=Q_1 && B>=0 && C==0 ], cost: 1
277.42/249.64	
277.42/249.64	     12: f9 -> f1 : A'=free_35, B'=2, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=S, R1'=free_36, S'=free_37, S1'=free_34, T'=S, T1'=2, U1'=free_39, W'=S, [ free_35>=2 && S==W ], cost: 1
277.42/249.64	
277.42/249.64	     18: f9 -> f1 : A'=free_35, B'=free_35, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=free_7, R1'=free_36, S'=free_7, S1'=free_34, T'=free_7, T1'=2, U1'=free_39, W'=S, [ S==W && free_35>=3 ], cost: -1+free_35
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Removed unreachable locations (and leaf rules with constant cost):
277.42/249.64	
277.42/249.64	   Start location: f9
277.42/249.64	
277.42/249.64	     19: f116 -> f8 : B1'=E1, C'=1+E1, C1'=V, D1'=V, E1'=-1, G1'=0, H1'=V, Q1'=0, J1'=V, K1'=-1, L1'=-1, O'=F, P'=1, P1'=free_33, U'=0, [ free_33>=0 && A>=2 && C>=0 && F>=0 && U==0 && P==0 && E1>=0 ], cost: 2+E1
277.42/249.64	
277.42/249.64	      4: f1 -> f116 : A1'=free_10, B'=free_9, C'=0, Q_1'=free_12, R'=free_13, S'=free_11, T'=free_8, U'=R, V'=R, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ A>=2 && free_10>=A && F>=A && B>=Q_1 && B>=0 && C==0 ], cost: 1
277.42/249.64	
277.42/249.64	     12: f9 -> f1 : A'=free_35, B'=2, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=S, R1'=free_36, S'=free_37, S1'=free_34, T'=S, T1'=2, U1'=free_39, W'=S, [ free_35>=2 && S==W ], cost: 1
277.42/249.64	
277.42/249.64	     18: f9 -> f1 : A'=free_35, B'=free_35, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=free_7, R1'=free_36, S'=free_7, S1'=free_34, T'=free_7, T1'=2, U1'=free_39, W'=S, [ S==W && free_35>=3 ], cost: -1+free_35
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Eliminated locations (on linear paths):
277.42/249.64	
277.42/249.64	   Start location: f9
277.42/249.64	
277.42/249.64	     20: f1 -> f8 : A1'=free_10, B'=free_9, B1'=E1, C'=1+E1, C1'=R, D1'=R, E1'=-1, G1'=0, H1'=R, Q1'=0, J1'=R, K1'=-1, L1'=-1, O'=F, P'=1, P1'=free_33, Q_1'=free_12, R'=free_13, S'=free_11, T'=free_8, U'=0, V'=R, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ A>=2 && free_10>=A && F>=A && B>=Q_1 && B>=0 && C==0 && free_33>=0 && F>=0 && R==0 && P==0 && E1>=0 ], cost: 3+E1
277.42/249.64	
277.42/249.64	     12: f9 -> f1 : A'=free_35, B'=2, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=S, R1'=free_36, S'=free_37, S1'=free_34, T'=S, T1'=2, U1'=free_39, W'=S, [ free_35>=2 && S==W ], cost: 1
277.42/249.64	
277.42/249.64	     18: f9 -> f1 : A'=free_35, B'=free_35, P'=0, Q_1'=free_35, Q1_1'=free_38, R'=free_7, R1'=free_36, S'=free_7, S1'=free_34, T'=free_7, T1'=2, U1'=free_39, W'=S, [ S==W && free_35>=3 ], cost: -1+free_35
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Eliminated locations (on tree-shaped paths):
277.42/249.64	
277.42/249.64	   Start location: f9
277.42/249.64	
277.42/249.64	     21: f9 -> f8 : A'=free_35, A1'=free_10, B'=free_9, B1'=E1, C'=1+E1, C1'=S, D1'=S, E1'=-1, G1'=0, H1'=S, Q1'=0, J1'=S, K1'=-1, L1'=-1, O'=F, P'=1, P1'=free_33, Q_1'=free_12, Q1_1'=free_38, R'=free_13, R1'=free_36, S'=free_11, S1'=free_34, T'=free_8, T1'=2, U'=0, U1'=free_39, V'=S, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ free_35>=2 && S==W && free_10>=free_35 && F>=free_35 && 2>=free_35 && C==0 && free_33>=0 && F>=0 && S==0 && E1>=0 ], cost: 4+E1
277.42/249.64	
277.42/249.64	     22: f9 -> f8 : A'=free_35, A1'=free_10, B'=free_9, B1'=E1, C'=1+E1, C1'=free_7, D1'=free_7, E1'=-1, G1'=0, H1'=free_7, Q1'=0, J1'=free_7, K1'=-1, L1'=-1, O'=F, P'=1, P1'=free_33, Q_1'=free_12, Q1_1'=free_38, R'=free_13, R1'=free_36, S'=free_11, S1'=free_34, T'=free_8, T1'=2, U'=0, U1'=free_39, V'=free_7, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ S==W && free_35>=3 && free_10>=free_35 && F>=free_35 && C==0 && free_33>=0 && F>=0 && free_7==0 && E1>=0 ], cost: 2+free_35+E1
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	### Computing asymptotic complexity ###
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Fully simplified ITS problem
277.42/249.64	
277.42/249.64	   Start location: f9
277.42/249.64	
277.42/249.64	     21: f9 -> f8 : A'=free_35, A1'=free_10, B'=free_9, B1'=E1, C'=1+E1, C1'=S, D1'=S, E1'=-1, G1'=0, H1'=S, Q1'=0, J1'=S, K1'=-1, L1'=-1, O'=F, P'=1, P1'=free_33, Q_1'=free_12, Q1_1'=free_38, R'=free_13, R1'=free_36, S'=free_11, S1'=free_34, T'=free_8, T1'=2, U'=0, U1'=free_39, V'=S, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ free_35>=2 && S==W && free_10>=free_35 && F>=free_35 && 2>=free_35 && C==0 && free_33>=0 && F>=0 && S==0 && E1>=0 ], cost: 4+E1
277.42/249.64	
277.42/249.64	     22: f9 -> f8 : A'=free_35, A1'=free_10, B'=free_9, B1'=E1, C'=1+E1, C1'=free_7, D1'=free_7, E1'=-1, G1'=0, H1'=free_7, Q1'=0, J1'=free_7, K1'=-1, L1'=-1, O'=F, P'=1, P1'=free_33, Q_1'=free_12, Q1_1'=free_38, R'=free_13, R1'=free_36, S'=free_11, S1'=free_34, T'=free_8, T1'=2, U'=0, U1'=free_39, V'=free_7, W'=free_16, X'=free_15, Y'=free_14, Z'=free_9, [ S==W && free_35>=3 && free_10>=free_35 && F>=free_35 && C==0 && free_33>=0 && F>=0 && free_7==0 && E1>=0 ], cost: 2+free_35+E1
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Computing asymptotic complexity for rule 21
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S (+/+!), 1+S-W (+/+!), 1-C (+/+!), 4+E1 (+), 1+F-free_35 (+/+!), -1+free_35 (+/+!), 1+C (+/+!), 3-free_35 (+/+!), 1+E1 (+/+!), 1-S (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1+W (+/+!), 1-C (+/+!), 4+E1 (+), 1+F-free_35 (+/+!), 1-W (+/+!), -1+free_35 (+/+!), 1+C (+/+!), 3-free_35 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1+W (+/+!), 4+E1 (+), 1+F-free_35 (+/+!), 1-W (+/+!), -1+free_35 (+/+!), 3-free_35 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1+W (+/+!), 4+E1 (+), 1+F-free_35 (+/+!), 1-W (+/+!), -1+free_35 (+/+!), 3-free_35 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+W (+/+!), 4+E1 (+), 1+F-free_35 (+/+!), 1-W (+/+!), -1+free_35 (+/+!), 3-free_35 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==2,free_35==2,free_10==n,E1==n,free_33==n,W==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solution:
277.42/249.64	
277.42/249.64	      S / 0
277.42/249.64	
277.42/249.64	      F / 2
277.42/249.64	
277.42/249.64	      free_35 / 2
277.42/249.64	
277.42/249.64	      C / 0
277.42/249.64	
277.42/249.64	      free_10 / n
277.42/249.64	
277.42/249.64	      E1 / n
277.42/249.64	
277.42/249.64	      free_33 / n
277.42/249.64	
277.42/249.64	      W / 0
277.42/249.64	
277.42/249.64	   Resulting cost 4+n has complexity: Poly(n^1)
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Found new complexity Poly(n^1).
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	Computing asymptotic complexity for rule 22
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==3,free_35==3,free_10==3,E1==n,free_33==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1 (+/+!), 2+free_35 (+), -2+free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      2+free_35 (+), -2+free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1 (+/+!), 2+free_35 (+), -2+free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 2+free_35 (+), -2+free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,free_10==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1 (+/+!), 2+free_35 (+), -2+free_35 (+/+!), 1+F-free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      2+free_35 (+), -2+free_35 (+/+!), 1+F-free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==n,free_35==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1 (+/+!), 2+free_35 (+), -2+free_35 (+/+!), 1+F-free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 2+free_35 (+), -2+free_35 (+/+!), 1+F-free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==2*n,free_35==n,free_10==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), 2+free_35 (+), -2+free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 2+free_35 (+), -2+free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 2+free_35 (+), -2+free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 2+free_35 (+), -2+free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,free_10==n,free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), 2+free_35 (+), -2+free_35 (+/+!), 1+F-free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 2+free_35 (+), -2+free_35 (+/+!), 1+F-free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==2*n,free_35==n,free_33==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 2+free_35 (+), -2+free_35 (+/+!), 1+F-free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 2+free_35 (+), -2+free_35 (+/+!), 1+F-free_35 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==n,free_35==n,free_10==n,free_33==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==3}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,E1==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==3}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+free_35 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,free_10==3,E1==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,free_10==n,E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==3}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==n,free_35==n,E1==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==2*n,free_35==n,E1==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==3}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==n,free_10==n,E1==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_33==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==3,free_35==3,free_10==3,E1==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==3}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,E1==n,free_33==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,E1==0,free_33==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==3}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1+free_33 (+/+!), -2+free_35 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,free_10==n,E1==n,free_33==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	   Solved the limit problem by the following transformations:
277.42/249.64	
277.42/249.64	      Created initial limit problem:
277.42/249.64	
277.42/249.64	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {S==W}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {C==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {F==free_35}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), -2+free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      removing all constraints (solved by SMT)
277.42/249.64	
277.42/249.64	      resulting limit problem: [solved]
277.42/249.64	
277.42/249.64	
277.42/249.64	
277.42/249.64	      applying transformation rule (C) using substitution {free_35==n,free_10==n,E1==0,free_33==n}
277.42/249.64	
277.42/249.64	      resulting limit problem:
277.42/249.64	
277.42/249.64	      [solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	   Solved the limit problem by the following transformations:
277.42/249.65	
277.42/249.65	      Created initial limit problem:
277.42/249.65	
277.42/249.65	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {S==W}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {C==0}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {free_35==3}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      -2+F (+/+!), 1+free_33 (+/+!), -2+free_35 (+/+!), 5+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      removing all constraints (solved by SMT)
277.42/249.65	
277.42/249.65	      resulting limit problem: [solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {F==n,free_35==n,E1==n,free_33==n}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      [solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	   Solved the limit problem by the following transformations:
277.42/249.65	
277.42/249.65	      Created initial limit problem:
277.42/249.65	
277.42/249.65	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {S==W}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {C==0}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {free_10==free_35}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1+free_33 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      removing all constraints (solved by SMT)
277.42/249.65	
277.42/249.65	      resulting limit problem: [solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {F==n,free_35==n,E1==0,free_33==n}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      [solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	   Solved the limit problem by the following transformations:
277.42/249.65	
277.42/249.65	      Created initial limit problem:
277.42/249.65	
277.42/249.65	      1-S+W (+/+!), 1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1+S-W (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {S==W}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), 1-C (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+C (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {C==0}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), 1-free_7 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+free_7 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {free_7==0}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      1-free_35+free_10 (+/+!), 1+free_33 (+/+!), 1 (+/+!), -2+free_35 (+/+!), 1+F-free_35 (+/+!), 2+free_35+E1 (+), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {free_35==3}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      -2+F (+/+!), 1+free_33 (+/+!), 1 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (B), deleting 1 (+/+!)
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      -2+F (+/+!), 1+free_33 (+/+!), 5+E1 (+), -2+free_10 (+/+!), 1+E1 (+/+!) [not solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      removing all constraints (solved by SMT)
277.42/249.65	
277.42/249.65	      resulting limit problem: [solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	      applying transformation rule (C) using substitution {F==n,free_10==n,E1==n,free_33==n}
277.42/249.65	
277.42/249.65	      resulting limit problem:
277.42/249.65	
277.42/249.65	      [solved]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	   Solution:
277.42/249.65	
277.42/249.65	      S / 0
277.42/249.65	
277.42/249.65	      F / 3
277.42/249.65	
277.42/249.65	      free_35 / 3
277.42/249.65	
277.42/249.65	      C / 0
277.42/249.65	
277.42/249.65	      free_10 / 3
277.42/249.65	
277.42/249.65	      free_7 / 0
277.42/249.65	
277.42/249.65	      E1 / n
277.42/249.65	
277.42/249.65	      free_33 / n
277.42/249.65	
277.42/249.65	      W / 0
277.42/249.65	
277.42/249.65	   Resulting cost 5+n has complexity: Poly(n^1)
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	Obtained the following overall complexity (w.r.t. the length of the input n):
277.42/249.65	
277.42/249.65	   Complexity:  Poly(n^1)
277.42/249.65	
277.42/249.65	   Cpx degree:  1
277.42/249.65	
277.42/249.65	   Solved cost: 4+n
277.42/249.65	
277.42/249.65	   Rule cost:   4+E1
277.42/249.65	
277.42/249.65	   Rule guard:  [ free_35>=2 && S==W && free_10>=free_35 && F>=free_35 && 2>=free_35 && C==0 && free_33>=0 && S==0 && E1>=0 ]
277.42/249.65	
277.42/249.65	
277.42/249.65	
277.42/249.65	WORST_CASE(Omega(n^1),?)
277.42/249.65	
277.42/249.65	
277.42/249.65	----------------------------------------
277.42/249.65	
277.42/249.65	(2)
277.42/249.65	BOUNDS(n^1, INF)
277.42/249.66	EOF