MAYBE * Step 1: ArgumentFilter MAYBE + Considered Problem: Rules: 0. f25(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f15(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) [A >= 1 + B] (?,1) 1. f25(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f15(A,B,1 + C,Y,0,1,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) [B >= A] (?,1) 2. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) True (?,1) 3. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f36(A,B,1,D,E,F,0,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) True (?,1) 4. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f45(A,B,C,D,E,F,G,H,Y,Z,A1,B1,B1,N,O,P,Q,R,S,T,U,V,W,X) [H >= C] (?,1) 5. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f46(A,B,C,D,E,F,G,H,I,J,K,L,M,M,O,P,Q,R,S,T,U,V,W,X) [0 >= 1 + M] (?,1) 6. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f46(A,B,C,D,E,F,G,H,I,J,K,L,M,M,O,P,Q,R,S,T,U,V,W,X) [M >= 1] (?,1) 7. f46(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f36(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) [A >= 1 + B] (?,1) 8. f45(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f36(A,B,1 + C,D,E,F,G,H,I,J,K,L,0,0,O,P,Q,R,S,T,U,V,W,X) [M = 0] (?,1) 9. f61(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f61(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) True (?,1) 10. f63(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f65(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) True (?,1) 11. f46(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f36(A,B,1 + C,Y,0,F,G,H,I,J,K,L,M,N,Z,P,Q,R,S,T,U,V,W,X) [B >= A] (?,1) 12. f46(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f45(A,B,C,D,E,F,G,H,I,Y,Z,A1,A1,N,O,B1,Q,R,S,T,U,V,W,X) [B >= A] (?,1) 13. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f61(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,0,R,S,T,U,V,W,X) [C >= 1 + H] (?,1) 14. f15(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f25(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,Y,Z,A1,A1,A1,X) [0 >= 1 + A1 && R >= 1 + C] (?,1) 15. f15(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f25(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,Y,Z,A1,A1,A1,X) [A1 >= 1 && R >= 1 + C] (?,1) 16. f15(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f15(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,Y,Z,0,0,0,X) [R >= 1 + C] (?,1) 17. f15(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) [C >= R] (?,1) 18. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f15(A,B,0,D,E,F,0,Z,I,J,K,L,M,N,O,P,0,Y,S,T,U,V,W,1) True (1,1) 19. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f36(A,B,1,D,E,F,0,A1,I,J,K,L,M,N,O,P,0,Z,S,T,U,V,W,Y) [0 >= Y] (1,1) 20. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X) -> f36(A,B,1,D,E,F,0,A1,I,J,K,L,M,N,O,P,0,Z,S,T,U,V,W,Y) [Y >= 2] (1,1) Signature: {(f0,24);(f15,24);(f25,24);(f31,24);(f33,24);(f36,24);(f45,24);(f46,24);(f61,24);(f63,24);(f65,24)} Flow Graph: [0->{14,15,16,17},1->{14,15,16,17},2->{2},3->{4,13},4->{5,6,8},5->{7,11,12},6->{7,11,12},7->{4,13},8->{4 ,13},9->{9},10->{},11->{4,13},12->{5,6,8},13->{9},14->{0,1},15->{0,1},16->{14,15,16,17},17->{2},18->{14,15 ,16,17},19->{4,13},20->{4,13}] + Applied Processor: ArgumentFilter [3,4,5,6,8,9,10,11,13,14,15,16,18,19,20,21,22,23] + Details: We remove following argument positions: [3,4,5,6,8,9,10,11,13,14,15,16,18,19,20,21,22,23]. * Step 2: UnreachableRules MAYBE + Considered Problem: Rules: 0. f25(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [A >= 1 + B] (?,1) 1. f25(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [B >= A] (?,1) 2. f31(A,B,C,H,M,R) -> f31(A,B,C,H,M,R) True (?,1) 3. f33(A,B,C,H,M,R) -> f36(A,B,1,H,M,R) True (?,1) 4. f36(A,B,C,H,M,R) -> f45(A,B,C,H,B1,R) [H >= C] (?,1) 5. f45(A,B,C,H,M,R) -> f46(A,B,C,H,M,R) [0 >= 1 + M] (?,1) 6. f45(A,B,C,H,M,R) -> f46(A,B,C,H,M,R) [M >= 1] (?,1) 7. f46(A,B,C,H,M,R) -> f36(A,B,1 + C,H,M,R) [A >= 1 + B] (?,1) 8. f45(A,B,C,H,M,R) -> f36(A,B,1 + C,H,0,R) [M = 0] (?,1) 9. f61(A,B,C,H,M,R) -> f61(A,B,C,H,M,R) True (?,1) 10. f63(A,B,C,H,M,R) -> f65(A,B,C,H,M,R) True (?,1) 11. f46(A,B,C,H,M,R) -> f36(A,B,1 + C,H,M,R) [B >= A] (?,1) 12. f46(A,B,C,H,M,R) -> f45(A,B,C,H,A1,R) [B >= A] (?,1) 13. f36(A,B,C,H,M,R) -> f61(A,B,C,H,M,R) [C >= 1 + H] (?,1) 14. f15(A,B,C,H,M,R) -> f25(A,B,C,H,M,R) [0 >= 1 + A1 && R >= 1 + C] (?,1) 15. f15(A,B,C,H,M,R) -> f25(A,B,C,H,M,R) [A1 >= 1 && R >= 1 + C] (?,1) 16. f15(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [R >= 1 + C] (?,1) 17. f15(A,B,C,H,M,R) -> f31(A,B,C,H,M,R) [C >= R] (?,1) 18. f0(A,B,C,H,M,R) -> f15(A,B,0,Z,M,Y) True (1,1) 19. f0(A,B,C,H,M,R) -> f36(A,B,1,A1,M,Z) [0 >= Y] (1,1) 20. f0(A,B,C,H,M,R) -> f36(A,B,1,A1,M,Z) [Y >= 2] (1,1) Signature: {(f0,24);(f15,24);(f25,24);(f31,24);(f33,24);(f36,24);(f45,24);(f46,24);(f61,24);(f63,24);(f65,24)} Flow Graph: [0->{14,15,16,17},1->{14,15,16,17},2->{2},3->{4,13},4->{5,6,8},5->{7,11,12},6->{7,11,12},7->{4,13},8->{4 ,13},9->{9},10->{},11->{4,13},12->{5,6,8},13->{9},14->{0,1},15->{0,1},16->{14,15,16,17},17->{2},18->{14,15 ,16,17},19->{4,13},20->{4,13}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [3,10] * Step 3: FromIts MAYBE + Considered Problem: Rules: 0. f25(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [A >= 1 + B] (?,1) 1. f25(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [B >= A] (?,1) 2. f31(A,B,C,H,M,R) -> f31(A,B,C,H,M,R) True (?,1) 4. f36(A,B,C,H,M,R) -> f45(A,B,C,H,B1,R) [H >= C] (?,1) 5. f45(A,B,C,H,M,R) -> f46(A,B,C,H,M,R) [0 >= 1 + M] (?,1) 6. f45(A,B,C,H,M,R) -> f46(A,B,C,H,M,R) [M >= 1] (?,1) 7. f46(A,B,C,H,M,R) -> f36(A,B,1 + C,H,M,R) [A >= 1 + B] (?,1) 8. f45(A,B,C,H,M,R) -> f36(A,B,1 + C,H,0,R) [M = 0] (?,1) 9. f61(A,B,C,H,M,R) -> f61(A,B,C,H,M,R) True (?,1) 11. f46(A,B,C,H,M,R) -> f36(A,B,1 + C,H,M,R) [B >= A] (?,1) 12. f46(A,B,C,H,M,R) -> f45(A,B,C,H,A1,R) [B >= A] (?,1) 13. f36(A,B,C,H,M,R) -> f61(A,B,C,H,M,R) [C >= 1 + H] (?,1) 14. f15(A,B,C,H,M,R) -> f25(A,B,C,H,M,R) [0 >= 1 + A1 && R >= 1 + C] (?,1) 15. f15(A,B,C,H,M,R) -> f25(A,B,C,H,M,R) [A1 >= 1 && R >= 1 + C] (?,1) 16. f15(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [R >= 1 + C] (?,1) 17. f15(A,B,C,H,M,R) -> f31(A,B,C,H,M,R) [C >= R] (?,1) 18. f0(A,B,C,H,M,R) -> f15(A,B,0,Z,M,Y) True (1,1) 19. f0(A,B,C,H,M,R) -> f36(A,B,1,A1,M,Z) [0 >= Y] (1,1) 20. f0(A,B,C,H,M,R) -> f36(A,B,1,A1,M,Z) [Y >= 2] (1,1) Signature: {(f0,24);(f15,24);(f25,24);(f31,24);(f33,24);(f36,24);(f45,24);(f46,24);(f61,24);(f63,24);(f65,24)} Flow Graph: [0->{14,15,16,17},1->{14,15,16,17},2->{2},4->{5,6,8},5->{7,11,12},6->{7,11,12},7->{4,13},8->{4,13},9->{9} ,11->{4,13},12->{5,6,8},13->{9},14->{0,1},15->{0,1},16->{14,15,16,17},17->{2},18->{14,15,16,17},19->{4,13} ,20->{4,13}] + Applied Processor: FromIts + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: f25(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [A >= 1 + B] f25(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [B >= A] f31(A,B,C,H,M,R) -> f31(A,B,C,H,M,R) True f36(A,B,C,H,M,R) -> f45(A,B,C,H,B1,R) [H >= C] f45(A,B,C,H,M,R) -> f46(A,B,C,H,M,R) [0 >= 1 + M] f45(A,B,C,H,M,R) -> f46(A,B,C,H,M,R) [M >= 1] f46(A,B,C,H,M,R) -> f36(A,B,1 + C,H,M,R) [A >= 1 + B] f45(A,B,C,H,M,R) -> f36(A,B,1 + C,H,0,R) [M = 0] f61(A,B,C,H,M,R) -> f61(A,B,C,H,M,R) True f46(A,B,C,H,M,R) -> f36(A,B,1 + C,H,M,R) [B >= A] f46(A,B,C,H,M,R) -> f45(A,B,C,H,A1,R) [B >= A] f36(A,B,C,H,M,R) -> f61(A,B,C,H,M,R) [C >= 1 + H] f15(A,B,C,H,M,R) -> f25(A,B,C,H,M,R) [0 >= 1 + A1 && R >= 1 + C] f15(A,B,C,H,M,R) -> f25(A,B,C,H,M,R) [A1 >= 1 && R >= 1 + C] f15(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [R >= 1 + C] f15(A,B,C,H,M,R) -> f31(A,B,C,H,M,R) [C >= R] f0(A,B,C,H,M,R) -> f15(A,B,0,Z,M,Y) True f0(A,B,C,H,M,R) -> f36(A,B,1,A1,M,Z) [0 >= Y] f0(A,B,C,H,M,R) -> f36(A,B,1,A1,M,Z) [Y >= 2] Signature: {(f0,24);(f15,24);(f25,24);(f31,24);(f33,24);(f36,24);(f45,24);(f46,24);(f61,24);(f63,24);(f65,24)} Rule Graph: [0->{14,15,16,17},1->{14,15,16,17},2->{2},4->{5,6,8},5->{7,11,12},6->{7,11,12},7->{4,13},8->{4,13},9->{9} ,11->{4,13},12->{5,6,8},13->{9},14->{0,1},15->{0,1},16->{14,15,16,17},17->{2},18->{14,15,16,17},19->{4,13} ,20->{4,13}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: f25(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [A >= 1 + B] f25(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [B >= A] f31(A,B,C,H,M,R) -> f31(A,B,C,H,M,R) True f36(A,B,C,H,M,R) -> f45(A,B,C,H,B1,R) [H >= C] f45(A,B,C,H,M,R) -> f46(A,B,C,H,M,R) [0 >= 1 + M] f45(A,B,C,H,M,R) -> f46(A,B,C,H,M,R) [M >= 1] f46(A,B,C,H,M,R) -> f36(A,B,1 + C,H,M,R) [A >= 1 + B] f45(A,B,C,H,M,R) -> f36(A,B,1 + C,H,0,R) [M = 0] f61(A,B,C,H,M,R) -> f61(A,B,C,H,M,R) True f46(A,B,C,H,M,R) -> f36(A,B,1 + C,H,M,R) [B >= A] f46(A,B,C,H,M,R) -> f45(A,B,C,H,A1,R) [B >= A] f36(A,B,C,H,M,R) -> f61(A,B,C,H,M,R) [C >= 1 + H] f15(A,B,C,H,M,R) -> f25(A,B,C,H,M,R) [0 >= 1 + A1 && R >= 1 + C] f15(A,B,C,H,M,R) -> f25(A,B,C,H,M,R) [A1 >= 1 && R >= 1 + C] f15(A,B,C,H,M,R) -> f15(A,B,1 + C,H,M,R) [R >= 1 + C] f15(A,B,C,H,M,R) -> f31(A,B,C,H,M,R) [C >= R] f0(A,B,C,H,M,R) -> f15(A,B,0,Z,M,Y) True f0(A,B,C,H,M,R) -> f36(A,B,1,A1,M,Z) [0 >= Y] f0(A,B,C,H,M,R) -> f36(A,B,1,A1,M,Z) [Y >= 2] f61(A,B,C,H,M,R) -> exitus616(A,B,C,H,M,R) True f61(A,B,C,H,M,R) -> exitus616(A,B,C,H,M,R) True f31(A,B,C,H,M,R) -> exitus616(A,B,C,H,M,R) True Signature: {(exitus616,6) ;(f0,24) ;(f15,24) ;(f25,24) ;(f31,24) ;(f33,24) ;(f36,24) ;(f45,24) ;(f46,24) ;(f61,24) ;(f63,24) ;(f65,24)} Rule Graph: [0->{14,15,16,17},1->{14,15,16,17},2->{2,23},4->{5,6,8},5->{7,11,12},6->{7,11,12},7->{4,13},8->{4,13} ,9->{9,21,22},11->{4,13},12->{5,6,8},13->{9},14->{0,1},15->{0,1},16->{14,15,16,17},17->{2},18->{14,15,16,17} ,19->{4,13},20->{4,13}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,4,5,6,7,8,9,11,12,13,14,15,16,17,18,19,20,21,22,23] | +- p:[4,7,5,12,6,8,11] c: [4,7,8,11] | | | `- p:[5,12,6] c: [] | +- p:[9] c: [] | +- p:[0,14,1,15,16] c: [0,1,14,15,16] | `- p:[2] c: [] MAYBE