MAYBE * Step 1: ArgumentFilter MAYBE + Considered Problem: Rules: 0. 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) -> f11(A,B,A,A,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) [A >= 1 + B] (?,1) 1. 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) -> f11(A,B,A,A,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) [B >= 1 + A] (?,1) 2. f11(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) -> f11(A,B,A,A,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) [A >= 1 + B] (?,1) 3. f11(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) -> f11(A,B,A,A,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) [B >= 1 + A] (?,1) 4. f6(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) -> f6(A,B,C,D,H1,F,1 + G,-1 + H,1 + G,-1 + H,F1,G1,-1 + H,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) [E >= 1 + F && G >= 0 && H >= 1] (?,1) 5. f6(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) -> f6(A,B,C,D,H1,F,1 + G,-1 + H,1 + G,-1 + H,F1,G1,-1 + H,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) [F >= 1 + E && G >= 0 && H >= 1] (?,1) 6. f26(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) -> f6(A,B,C,D,L1,F,1,4,1,4,K,L,M,F1,2,3,G1,H1,4,J1,0,K1,M1,M1,M1,M1,N1,O1,P1,4,E1) [I1 >= 1 + F] (1,1) 7. f26(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) -> f6(A,B,C,D,L1,F,1,4,1,4,K,L,M,F1,2,3,G1,H1,4,J1,0,K1,M1,M1,M1,M1,N1,O1,P1,4,E1) [F >= 1 + I1] (1,1) 8. f6(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) -> f12(J1,B,J1,J1,E,E,G,H,I,J,K,L,M,F1,O,P,Q,R,S,T,U,V,W,X,Y,G1,A1,B1,C1,D1,H1) [J1 >= 1 + B && G >= 0 && H >= 1 && E = F] (?,1) 9. f6(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) -> f12(J1,B,J1,J1,E,E,G,H,I,J,K,L,M,F1,O,P,Q,R,S,T,U,V,W,X,Y,G1,A1,B1,C1,D1,H1) [B >= 1 + J1 && G >= 0 && H >= 1 && E = F] (?,1) Signature: {(f11,31);(f12,31);(f26,31);(f6,31)} Flow Graph: [0->{2,3},1->{2,3},2->{2,3},3->{2,3},4->{4,5,8,9},5->{4,5,8,9},6->{4,5,8,9},7->{4,5,8,9},8->{0,1},9->{0 ,1}] + Applied Processor: ArgumentFilter [2,3,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30] + Details: We remove following argument positions: [2 ,3 ,8 ,9 ,10 ,11 ,12 ,13 ,14 ,15 ,16 ,17 ,18 ,19 ,20 ,21 ,22 ,23 ,24 ,25 ,26 ,27 ,28 ,29 ,30]. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f12(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [A >= 1 + B] (?,1) 1. f12(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [B >= 1 + A] (?,1) 2. f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [A >= 1 + B] (?,1) 3. f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [B >= 1 + A] (?,1) 4. f6(A,B,E,F,G,H) -> f6(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] (?,1) 5. f6(A,B,E,F,G,H) -> f6(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] (?,1) 6. f26(A,B,E,F,G,H) -> f6(A,B,L1,F,1,4) [I1 >= 1 + F] (1,1) 7. f26(A,B,E,F,G,H) -> f6(A,B,L1,F,1,4) [F >= 1 + I1] (1,1) 8. f6(A,B,E,F,G,H) -> f12(J1,B,E,E,G,H) [J1 >= 1 + B && G >= 0 && H >= 1 && E = F] (?,1) 9. f6(A,B,E,F,G,H) -> f12(J1,B,E,E,G,H) [B >= 1 + J1 && G >= 0 && H >= 1 && E = F] (?,1) Signature: {(f11,31);(f12,31);(f26,31);(f6,31)} Flow Graph: [0->{2,3},1->{2,3},2->{2,3},3->{2,3},4->{4,5,8,9},5->{4,5,8,9},6->{4,5,8,9},7->{4,5,8,9},8->{0,1},9->{0 ,1}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,3),(1,2),(2,3),(3,2),(8,1),(9,0)] * Step 3: FromIts MAYBE + Considered Problem: Rules: 0. f12(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [A >= 1 + B] (?,1) 1. f12(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [B >= 1 + A] (?,1) 2. f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [A >= 1 + B] (?,1) 3. f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [B >= 1 + A] (?,1) 4. f6(A,B,E,F,G,H) -> f6(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] (?,1) 5. f6(A,B,E,F,G,H) -> f6(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] (?,1) 6. f26(A,B,E,F,G,H) -> f6(A,B,L1,F,1,4) [I1 >= 1 + F] (1,1) 7. f26(A,B,E,F,G,H) -> f6(A,B,L1,F,1,4) [F >= 1 + I1] (1,1) 8. f6(A,B,E,F,G,H) -> f12(J1,B,E,E,G,H) [J1 >= 1 + B && G >= 0 && H >= 1 && E = F] (?,1) 9. f6(A,B,E,F,G,H) -> f12(J1,B,E,E,G,H) [B >= 1 + J1 && G >= 0 && H >= 1 && E = F] (?,1) Signature: {(f11,31);(f12,31);(f26,31);(f6,31)} Flow Graph: [0->{2},1->{3},2->{2},3->{3},4->{4,5,8,9},5->{4,5,8,9},6->{4,5,8,9},7->{4,5,8,9},8->{0},9->{1}] + Applied Processor: FromIts + Details: () * Step 4: Unfold MAYBE + Considered Problem: Rules: f12(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [A >= 1 + B] f12(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [B >= 1 + A] f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [A >= 1 + B] f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [B >= 1 + A] f6(A,B,E,F,G,H) -> f6(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6(A,B,E,F,G,H) -> f6(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f26(A,B,E,F,G,H) -> f6(A,B,L1,F,1,4) [I1 >= 1 + F] f26(A,B,E,F,G,H) -> f6(A,B,L1,F,1,4) [F >= 1 + I1] f6(A,B,E,F,G,H) -> f12(J1,B,E,E,G,H) [J1 >= 1 + B && G >= 0 && H >= 1 && E = F] f6(A,B,E,F,G,H) -> f12(J1,B,E,E,G,H) [B >= 1 + J1 && G >= 0 && H >= 1 && E = F] Signature: {(f11,31);(f12,31);(f26,31);(f6,31)} Rule Graph: [0->{2},1->{3},2->{2},3->{3},4->{4,5,8,9},5->{4,5,8,9},6->{4,5,8,9},7->{4,5,8,9},8->{0},9->{1}] + Applied Processor: Unfold + Details: () * Step 5: AddSinks MAYBE + Considered Problem: Rules: f12.0(A,B,E,F,G,H) -> f11.2(A,B,E,F,G,H) [A >= 1 + B] f12.1(A,B,E,F,G,H) -> f11.3(A,B,E,F,G,H) [B >= 1 + A] f11.2(A,B,E,F,G,H) -> f11.2(A,B,E,F,G,H) [A >= 1 + B] f11.3(A,B,E,F,G,H) -> f11.3(A,B,E,F,G,H) [B >= 1 + A] f6.4(A,B,E,F,G,H) -> f6.4(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.4(A,B,E,F,G,H) -> f6.5(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.4(A,B,E,F,G,H) -> f6.8(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.4(A,B,E,F,G,H) -> f6.9(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.5(A,B,E,F,G,H) -> f6.4(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.5(A,B,E,F,G,H) -> f6.5(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.5(A,B,E,F,G,H) -> f6.8(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.5(A,B,E,F,G,H) -> f6.9(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f26.6(A,B,E,F,G,H) -> f6.4(A,B,L1,F,1,4) [I1 >= 1 + F] f26.6(A,B,E,F,G,H) -> f6.5(A,B,L1,F,1,4) [I1 >= 1 + F] f26.6(A,B,E,F,G,H) -> f6.8(A,B,L1,F,1,4) [I1 >= 1 + F] f26.6(A,B,E,F,G,H) -> f6.9(A,B,L1,F,1,4) [I1 >= 1 + F] f26.7(A,B,E,F,G,H) -> f6.4(A,B,L1,F,1,4) [F >= 1 + I1] f26.7(A,B,E,F,G,H) -> f6.5(A,B,L1,F,1,4) [F >= 1 + I1] f26.7(A,B,E,F,G,H) -> f6.8(A,B,L1,F,1,4) [F >= 1 + I1] f26.7(A,B,E,F,G,H) -> f6.9(A,B,L1,F,1,4) [F >= 1 + I1] f6.8(A,B,E,F,G,H) -> f12.0(J1,B,E,E,G,H) [J1 >= 1 + B && G >= 0 && H >= 1 && E = F] f6.9(A,B,E,F,G,H) -> f12.1(J1,B,E,E,G,H) [B >= 1 + J1 && G >= 0 && H >= 1 && E = F] Signature: {(f11.2,6);(f11.3,6);(f12.0,6);(f12.1,6);(f26.6,6);(f26.7,6);(f6.4,6);(f6.5,6);(f6.8,6);(f6.9,6)} Rule Graph: [0->{2},1->{3},2->{2},3->{3},4->{4,5,6,7},5->{8,9,10,11},6->{20},7->{21},8->{4,5,6,7},9->{8,9,10,11} ,10->{20},11->{21},12->{4,5,6,7},13->{8,9,10,11},14->{20},15->{21},16->{4,5,6,7},17->{8,9,10,11},18->{20} ,19->{21},20->{0},21->{1}] + Applied Processor: AddSinks + Details: () * Step 6: Failure MAYBE + Considered Problem: Rules: f12.0(A,B,E,F,G,H) -> f11.2(A,B,E,F,G,H) [A >= 1 + B] f12.1(A,B,E,F,G,H) -> f11.3(A,B,E,F,G,H) [B >= 1 + A] f11.2(A,B,E,F,G,H) -> f11.2(A,B,E,F,G,H) [A >= 1 + B] f11.3(A,B,E,F,G,H) -> f11.3(A,B,E,F,G,H) [B >= 1 + A] f6.4(A,B,E,F,G,H) -> f6.4(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.4(A,B,E,F,G,H) -> f6.5(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.4(A,B,E,F,G,H) -> f6.8(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.4(A,B,E,F,G,H) -> f6.9(A,B,H1,F,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.5(A,B,E,F,G,H) -> f6.4(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.5(A,B,E,F,G,H) -> f6.5(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.5(A,B,E,F,G,H) -> f6.8(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.5(A,B,E,F,G,H) -> f6.9(A,B,H1,F,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f26.6(A,B,E,F,G,H) -> f6.4(A,B,L1,F,1,4) [I1 >= 1 + F] f26.6(A,B,E,F,G,H) -> f6.5(A,B,L1,F,1,4) [I1 >= 1 + F] f26.6(A,B,E,F,G,H) -> f6.8(A,B,L1,F,1,4) [I1 >= 1 + F] f26.6(A,B,E,F,G,H) -> f6.9(A,B,L1,F,1,4) [I1 >= 1 + F] f26.7(A,B,E,F,G,H) -> f6.4(A,B,L1,F,1,4) [F >= 1 + I1] f26.7(A,B,E,F,G,H) -> f6.5(A,B,L1,F,1,4) [F >= 1 + I1] f26.7(A,B,E,F,G,H) -> f6.8(A,B,L1,F,1,4) [F >= 1 + I1] f26.7(A,B,E,F,G,H) -> f6.9(A,B,L1,F,1,4) [F >= 1 + I1] f6.8(A,B,E,F,G,H) -> f12.0(J1,B,E,E,G,H) [J1 >= 1 + B && G >= 0 && H >= 1 && E = F] f6.9(A,B,E,F,G,H) -> f12.1(J1,B,E,E,G,H) [B >= 1 + J1 && G >= 0 && H >= 1 && E = F] f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.3(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.2(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True Signature: {(exitus616,6) ;(f11.2,6) ;(f11.3,6) ;(f12.0,6) ;(f12.1,6) ;(f26.6,6) ;(f26.7,6) ;(f6.4,6) ;(f6.5,6) ;(f6.8,6) ;(f6.9,6)} Rule Graph: [0->{2},1->{3},2->{2,23,25,27,29,31,33,35,37,39,41},3->{3,22,24,26,28,30,32,34,36,38,40},4->{4,5,6,7} ,5->{8,9,10,11},6->{20},7->{21},8->{4,5,6,7},9->{8,9,10,11},10->{20},11->{21},12->{4,5,6,7},13->{8,9,10,11} ,14->{20},15->{21},16->{4,5,6,7},17->{8,9,10,11},18->{20},19->{21},20->{0},21->{1}] + 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,29,30,31,32,33,34,35,36,37,38,39,40,41] | +- p:[4,8,5,9] c: [4,5,8,9] | +- p:[3] c: [] | `- p:[2] c: [] MAYBE