MAYBE * Step 1: ArgumentFilter MAYBE + 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: ArgumentFilter [2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19] + Details: We remove following argument positions: [2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19]. * Step 2: UnreachableRules MAYBE + Considered Problem: Rules: 0. f47(A,B,D) -> f47(A,B,D) True (?,1) 1. f49(A,B,D) -> f52(A,B,D) True (?,1) 2. f11(A,B,D) -> f47(A,B,D) [A >= B] (?,1) 3. f35(A,B,D) -> f47(A,B,D) [D >= 3] (?,1) 4. f35(A,B,D) -> f47(A,B,D) [1 >= D] (?,1) 5. f35(A,B,D) -> f47(A,B,2) [D = 2] (?,1) 6. f11(A,B,D) -> f47(A,B,D) [U >= 1 && B >= 1 + A] (?,1) 7. f11(A,B,D) -> f35(A,B,Y) [B >= 1 + A && 0 >= U && Y >= 2] (?,1) 8. f11(A,B,D) -> f35(A,B,Y) [B >= 1 + A && 0 >= U && 0 >= Y] (?,1) 9. f11(A,B,D) -> f11(1 + A,B,1) [0 >= U && B >= 1 + A] (?,1) 10. f0(A,B,D) -> f11(A,B,D) 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: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [1] * Step 3: UnsatPaths MAYBE + Considered Problem: Rules: 0. f47(A,B,D) -> f47(A,B,D) True (?,1) 2. f11(A,B,D) -> f47(A,B,D) [A >= B] (?,1) 3. f35(A,B,D) -> f47(A,B,D) [D >= 3] (?,1) 4. f35(A,B,D) -> f47(A,B,D) [1 >= D] (?,1) 5. f35(A,B,D) -> f47(A,B,2) [D = 2] (?,1) 6. f11(A,B,D) -> f47(A,B,D) [U >= 1 && B >= 1 + A] (?,1) 7. f11(A,B,D) -> f35(A,B,Y) [B >= 1 + A && 0 >= U && Y >= 2] (?,1) 8. f11(A,B,D) -> f35(A,B,Y) [B >= 1 + A && 0 >= U && 0 >= Y] (?,1) 9. f11(A,B,D) -> f11(1 + A,B,1) [0 >= U && B >= 1 + A] (?,1) 10. f0(A,B,D) -> f11(A,B,D) 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,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 4: FromIts MAYBE + Considered Problem: Rules: 0. f47(A,B,D) -> f47(A,B,D) True (?,1) 2. f11(A,B,D) -> f47(A,B,D) [A >= B] (?,1) 3. f35(A,B,D) -> f47(A,B,D) [D >= 3] (?,1) 4. f35(A,B,D) -> f47(A,B,D) [1 >= D] (?,1) 5. f35(A,B,D) -> f47(A,B,2) [D = 2] (?,1) 6. f11(A,B,D) -> f47(A,B,D) [U >= 1 && B >= 1 + A] (?,1) 7. f11(A,B,D) -> f35(A,B,Y) [B >= 1 + A && 0 >= U && Y >= 2] (?,1) 8. f11(A,B,D) -> f35(A,B,Y) [B >= 1 + A && 0 >= U && 0 >= Y] (?,1) 9. f11(A,B,D) -> f11(1 + A,B,1) [0 >= U && B >= 1 + A] (?,1) 10. f0(A,B,D) -> f11(A,B,D) 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 5: Unfold MAYBE + Considered Problem: Rules: f47(A,B,D) -> f47(A,B,D) True f11(A,B,D) -> f47(A,B,D) [A >= B] f35(A,B,D) -> f47(A,B,D) [D >= 3] f35(A,B,D) -> f47(A,B,D) [1 >= D] f35(A,B,D) -> f47(A,B,2) [D = 2] f11(A,B,D) -> f47(A,B,D) [U >= 1 && B >= 1 + A] f11(A,B,D) -> f35(A,B,Y) [B >= 1 + A && 0 >= U && Y >= 2] f11(A,B,D) -> f35(A,B,Y) [B >= 1 + A && 0 >= U && 0 >= Y] f11(A,B,D) -> f11(1 + A,B,1) [0 >= U && B >= 1 + A] f0(A,B,D) -> f11(A,B,D) 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: Unfold + Details: () * Step 6: AddSinks MAYBE + Considered Problem: Rules: f47.0(A,B,D) -> f47.0(A,B,D) True f11.2(A,B,D) -> f47.0(A,B,D) [A >= B] f35.3(A,B,D) -> f47.0(A,B,D) [D >= 3] f35.4(A,B,D) -> f47.0(A,B,D) [1 >= D] f35.5(A,B,D) -> f47.0(A,B,2) [D = 2] f11.6(A,B,D) -> f47.0(A,B,D) [U >= 1 && B >= 1 + A] f11.7(A,B,D) -> f35.3(A,B,Y) [B >= 1 + A && 0 >= U && Y >= 2] f11.7(A,B,D) -> f35.5(A,B,Y) [B >= 1 + A && 0 >= U && Y >= 2] f11.8(A,B,D) -> f35.4(A,B,Y) [B >= 1 + A && 0 >= U && 0 >= Y] f11.9(A,B,D) -> f11.2(1 + A,B,1) [0 >= U && B >= 1 + A] f11.9(A,B,D) -> f11.6(1 + A,B,1) [0 >= U && B >= 1 + A] f11.9(A,B,D) -> f11.7(1 + A,B,1) [0 >= U && B >= 1 + A] f11.9(A,B,D) -> f11.8(1 + A,B,1) [0 >= U && B >= 1 + A] f11.9(A,B,D) -> f11.9(1 + A,B,1) [0 >= U && B >= 1 + A] f0.10(A,B,D) -> f11.2(A,B,D) True f0.10(A,B,D) -> f11.6(A,B,D) True f0.10(A,B,D) -> f11.7(A,B,D) True f0.10(A,B,D) -> f11.8(A,B,D) True f0.10(A,B,D) -> f11.9(A,B,D) True Signature: {(f0.10,3);(f11.2,3);(f11.6,3);(f11.7,3);(f11.8,3);(f11.9,3);(f35.3,3);(f35.4,3);(f35.5,3);(f47.0,3)} Rule Graph: [0->{0},1->{0},2->{0},3->{0},4->{0},5->{0},6->{2},7->{4},8->{3},9->{1},10->{5},11->{6,7},12->{8},13->{9,10 ,11,12,13},14->{1},15->{5},16->{6,7},17->{8},18->{9,10,11,12,13}] + Applied Processor: AddSinks + Details: () * Step 7: Failure MAYBE + Considered Problem: Rules: f47.0(A,B,D) -> f47.0(A,B,D) True f11.2(A,B,D) -> f47.0(A,B,D) [A >= B] f35.3(A,B,D) -> f47.0(A,B,D) [D >= 3] f35.4(A,B,D) -> f47.0(A,B,D) [1 >= D] f35.5(A,B,D) -> f47.0(A,B,2) [D = 2] f11.6(A,B,D) -> f47.0(A,B,D) [U >= 1 && B >= 1 + A] f11.7(A,B,D) -> f35.3(A,B,Y) [B >= 1 + A && 0 >= U && Y >= 2] f11.7(A,B,D) -> f35.5(A,B,Y) [B >= 1 + A && 0 >= U && Y >= 2] f11.8(A,B,D) -> f35.4(A,B,Y) [B >= 1 + A && 0 >= U && 0 >= Y] f11.9(A,B,D) -> f11.2(1 + A,B,1) [0 >= U && B >= 1 + A] f11.9(A,B,D) -> f11.6(1 + A,B,1) [0 >= U && B >= 1 + A] f11.9(A,B,D) -> f11.7(1 + A,B,1) [0 >= U && B >= 1 + A] f11.9(A,B,D) -> f11.8(1 + A,B,1) [0 >= U && B >= 1 + A] f11.9(A,B,D) -> f11.9(1 + A,B,1) [0 >= U && B >= 1 + A] f0.10(A,B,D) -> f11.2(A,B,D) True f0.10(A,B,D) -> f11.6(A,B,D) True f0.10(A,B,D) -> f11.7(A,B,D) True f0.10(A,B,D) -> f11.8(A,B,D) True f0.10(A,B,D) -> f11.9(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True f47.0(A,B,D) -> exitus616(A,B,D) True Signature: {(exitus616,3) ;(f0.10,3) ;(f11.2,3) ;(f11.6,3) ;(f11.7,3) ;(f11.8,3) ;(f11.9,3) ;(f35.3,3) ;(f35.4,3) ;(f35.5,3) ;(f47.0,3)} Rule Graph: [0->{0,19,20,21,22,23,24,25,26,27,28},1->{0},2->{0},3->{0},4->{0},5->{0},6->{2},7->{4},8->{3},9->{1} ,10->{5},11->{6,7},12->{8},13->{9,10,11,12,13},14->{1},15->{5},16->{6,7},17->{8},18->{9,10,11,12,13}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28] | +- p:[13] c: [13] | `- p:[0] c: [] MAYBE