NO * Step 1: UnsatPaths NO + Considered Problem: Rules: 0. f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (?,1) 1. f49(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f52(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (?,1) 2. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [A >= B] (?,1) 3. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [D >= 3] (?,1) 4. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [1 >= D] (?,1) 5. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,2,F,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [D = 2] (?,1) 6. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,U,V,W,X,C,U,U,M,N,O,P,Q,R,S,T) [U >= 1 && B >= 1 + A] (?,1) 7. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f35(A,B,C,Y,E,U,V,W,X,C,U,U,U,O,0,Y,Y,0,S,T) [B >= 1 + A && 0 >= U && Y >= 2] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f35(A,B,C,Y,E,U,V,W,X,C,U,U,U,O,0,Y,Y,0,S,T) [B >= 1 + A && 0 >= U && 0 >= Y] (?,1) 9. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f11(1 + A,B,C,1,E,U,V,W,X,C,U,U,U,O,O,1,1,0,S,T) [0 >= U && B >= 1 + A] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,0,0) True (1,1) Signature: {(f0,20);(f11,20);(f35,20);(f47,20);(f49,20);(f52,20)} Flow Graph: [0->{0},1->{},2->{0},3->{0},4->{0},5->{0},6->{0},7->{3,4,5},8->{3,4,5},9->{2,6,7,8,9},10->{2,6,7,8,9}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,4),(8,3),(8,5)] * Step 2: UnreachableRules NO + Considered Problem: Rules: 0. f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (?,1) 1. f49(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f52(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (?,1) 2. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [A >= B] (?,1) 3. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [D >= 3] (?,1) 4. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [1 >= D] (?,1) 5. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,2,F,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [D = 2] (?,1) 6. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,U,V,W,X,C,U,U,M,N,O,P,Q,R,S,T) [U >= 1 && B >= 1 + A] (?,1) 7. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f35(A,B,C,Y,E,U,V,W,X,C,U,U,U,O,0,Y,Y,0,S,T) [B >= 1 + A && 0 >= U && Y >= 2] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f35(A,B,C,Y,E,U,V,W,X,C,U,U,U,O,0,Y,Y,0,S,T) [B >= 1 + A && 0 >= U && 0 >= Y] (?,1) 9. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f11(1 + A,B,C,1,E,U,V,W,X,C,U,U,U,O,O,1,1,0,S,T) [0 >= U && B >= 1 + A] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,0,0) True (1,1) Signature: {(f0,20);(f11,20);(f35,20);(f47,20);(f49,20);(f52,20)} Flow Graph: [0->{0},1->{},2->{0},3->{0},4->{0},5->{0},6->{0},7->{3,5},8->{4},9->{2,6,7,8,9},10->{2,6,7,8,9}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [1] * Step 3: FromIts NO + Considered Problem: Rules: 0. f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True (?,1) 2. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [A >= B] (?,1) 3. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [D >= 3] (?,1) 4. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [1 >= D] (?,1) 5. f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,2,F,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [D = 2] (?,1) 6. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,U,V,W,X,C,U,U,M,N,O,P,Q,R,S,T) [U >= 1 && B >= 1 + A] (?,1) 7. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f35(A,B,C,Y,E,U,V,W,X,C,U,U,U,O,0,Y,Y,0,S,T) [B >= 1 + A && 0 >= U && Y >= 2] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f35(A,B,C,Y,E,U,V,W,X,C,U,U,U,O,0,Y,Y,0,S,T) [B >= 1 + A && 0 >= U && 0 >= Y] (?,1) 9. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f11(1 + A,B,C,1,E,U,V,W,X,C,U,U,U,O,O,1,1,0,S,T) [0 >= U && B >= 1 + A] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,0,0) True (1,1) Signature: {(f0,20);(f11,20);(f35,20);(f47,20);(f49,20);(f52,20)} Flow Graph: [0->{0},2->{0},3->{0},4->{0},5->{0},6->{0},7->{3,5},8->{4},9->{2,6,7,8,9},10->{2,6,7,8,9}] + Applied Processor: FromIts + Details: () * Step 4: CloseWith NO + Considered Problem: Rules: f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) True f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [A >= B] f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [D >= 3] f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [1 >= D] f35(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,2,F,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) [D = 2] f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f47(A,B,0,D,E,U,V,W,X,C,U,U,M,N,O,P,Q,R,S,T) [U >= 1 && B >= 1 + A] f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f35(A,B,C,Y,E,U,V,W,X,C,U,U,U,O,0,Y,Y,0,S,T) [B >= 1 + A && 0 >= U && Y >= 2] f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f35(A,B,C,Y,E,U,V,W,X,C,U,U,U,O,0,Y,Y,0,S,T) [B >= 1 + A && 0 >= U && 0 >= Y] f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f11(1 + A,B,C,1,E,U,V,W,X,C,U,U,U,O,O,1,1,0,S,T) [0 >= U && B >= 1 + A] f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T) -> f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,0,0) True Signature: {(f0,20);(f11,20);(f35,20);(f47,20);(f49,20);(f52,20)} Rule Graph: [0->{0},2->{0},3->{0},4->{0},5->{0},6->{0},7->{3,5},8->{4},9->{2,6,7,8,9},10->{2,6,7,8,9}] + Applied Processor: CloseWith False + Details: () NO