MAYBE * Step 1: ArgumentFilter MAYBE + Considered Problem: Rules: 0. 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,B,B,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. 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,B,B,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. 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,E,H1,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) 3. 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,E,H1,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) 4. 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,E,L1,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) [E >= 1 + I1] (1,1) 5. 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,E,L1,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 + E] (1,1) 6. 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) -> f11(A,J1,J1,J1,F,F,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) [A >= 1 + J1 && G >= 0 && H >= 1 && F = E] (?,1) 7. 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) -> f11(A,J1,J1,J1,F,F,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 + A && G >= 0 && H >= 1 && F = E] (?,1) Signature: {(f11,31);(f26,31);(f6,31)} Flow Graph: [0->{0,1},1->{0,1},2->{2,3,6,7},3->{2,3,6,7},4->{2,3,6,7},5->{2,3,6,7},6->{0,1},7->{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. f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [A >= 1 + B] (?,1) 1. f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [B >= 1 + A] (?,1) 2. f6(A,B,E,F,G,H) -> f6(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] (?,1) 3. f6(A,B,E,F,G,H) -> f6(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] (?,1) 4. f26(A,B,E,F,G,H) -> f6(A,B,E,L1,1,4) [E >= 1 + I1] (1,1) 5. f26(A,B,E,F,G,H) -> f6(A,B,E,L1,1,4) [I1 >= 1 + E] (1,1) 6. f6(A,B,E,F,G,H) -> f11(A,J1,F,F,G,H) [A >= 1 + J1 && G >= 0 && H >= 1 && F = E] (?,1) 7. f6(A,B,E,F,G,H) -> f11(A,J1,F,F,G,H) [J1 >= 1 + A && G >= 0 && H >= 1 && F = E] (?,1) Signature: {(f11,31);(f26,31);(f6,31)} Flow Graph: [0->{0,1},1->{0,1},2->{2,3,6,7},3->{2,3,6,7},4->{2,3,6,7},5->{2,3,6,7},6->{0,1},7->{0,1}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,1),(1,0),(6,1),(7,0)] * Step 3: FromIts MAYBE + Considered Problem: Rules: 0. f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [A >= 1 + B] (?,1) 1. f11(A,B,E,F,G,H) -> f11(A,B,E,F,G,H) [B >= 1 + A] (?,1) 2. f6(A,B,E,F,G,H) -> f6(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] (?,1) 3. f6(A,B,E,F,G,H) -> f6(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] (?,1) 4. f26(A,B,E,F,G,H) -> f6(A,B,E,L1,1,4) [E >= 1 + I1] (1,1) 5. f26(A,B,E,F,G,H) -> f6(A,B,E,L1,1,4) [I1 >= 1 + E] (1,1) 6. f6(A,B,E,F,G,H) -> f11(A,J1,F,F,G,H) [A >= 1 + J1 && G >= 0 && H >= 1 && F = E] (?,1) 7. f6(A,B,E,F,G,H) -> f11(A,J1,F,F,G,H) [J1 >= 1 + A && G >= 0 && H >= 1 && F = E] (?,1) Signature: {(f11,31);(f26,31);(f6,31)} Flow Graph: [0->{0},1->{1},2->{2,3,6,7},3->{2,3,6,7},4->{2,3,6,7},5->{2,3,6,7},6->{0},7->{1}] + Applied Processor: FromIts + Details: () * Step 4: Unfold MAYBE + Considered Problem: Rules: 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,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6(A,B,E,F,G,H) -> f6(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f26(A,B,E,F,G,H) -> f6(A,B,E,L1,1,4) [E >= 1 + I1] f26(A,B,E,F,G,H) -> f6(A,B,E,L1,1,4) [I1 >= 1 + E] f6(A,B,E,F,G,H) -> f11(A,J1,F,F,G,H) [A >= 1 + J1 && G >= 0 && H >= 1 && F = E] f6(A,B,E,F,G,H) -> f11(A,J1,F,F,G,H) [J1 >= 1 + A && G >= 0 && H >= 1 && F = E] Signature: {(f11,31);(f26,31);(f6,31)} Rule Graph: [0->{0},1->{1},2->{2,3,6,7},3->{2,3,6,7},4->{2,3,6,7},5->{2,3,6,7},6->{0},7->{1}] + Applied Processor: Unfold + Details: () * Step 5: AddSinks MAYBE + Considered Problem: Rules: f11.0(A,B,E,F,G,H) -> f11.0(A,B,E,F,G,H) [A >= 1 + B] f11.1(A,B,E,F,G,H) -> f11.1(A,B,E,F,G,H) [B >= 1 + A] f6.2(A,B,E,F,G,H) -> f6.2(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.2(A,B,E,F,G,H) -> f6.3(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.2(A,B,E,F,G,H) -> f6.6(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.2(A,B,E,F,G,H) -> f6.7(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.3(A,B,E,F,G,H) -> f6.2(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.3(A,B,E,F,G,H) -> f6.3(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.3(A,B,E,F,G,H) -> f6.6(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.3(A,B,E,F,G,H) -> f6.7(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f26.4(A,B,E,F,G,H) -> f6.2(A,B,E,L1,1,4) [E >= 1 + I1] f26.4(A,B,E,F,G,H) -> f6.3(A,B,E,L1,1,4) [E >= 1 + I1] f26.4(A,B,E,F,G,H) -> f6.6(A,B,E,L1,1,4) [E >= 1 + I1] f26.4(A,B,E,F,G,H) -> f6.7(A,B,E,L1,1,4) [E >= 1 + I1] f26.5(A,B,E,F,G,H) -> f6.2(A,B,E,L1,1,4) [I1 >= 1 + E] f26.5(A,B,E,F,G,H) -> f6.3(A,B,E,L1,1,4) [I1 >= 1 + E] f26.5(A,B,E,F,G,H) -> f6.6(A,B,E,L1,1,4) [I1 >= 1 + E] f26.5(A,B,E,F,G,H) -> f6.7(A,B,E,L1,1,4) [I1 >= 1 + E] f6.6(A,B,E,F,G,H) -> f11.0(A,J1,F,F,G,H) [A >= 1 + J1 && G >= 0 && H >= 1 && F = E] f6.7(A,B,E,F,G,H) -> f11.1(A,J1,F,F,G,H) [J1 >= 1 + A && G >= 0 && H >= 1 && F = E] Signature: {(f11.0,6);(f11.1,6);(f26.4,6);(f26.5,6);(f6.2,6);(f6.3,6);(f6.6,6);(f6.7,6)} Rule Graph: [0->{0},1->{1},2->{2,3,4,5},3->{6,7,8,9},4->{18},5->{19},6->{2,3,4,5},7->{6,7,8,9},8->{18},9->{19},10->{2 ,3,4,5},11->{6,7,8,9},12->{18},13->{19},14->{2,3,4,5},15->{6,7,8,9},16->{18},17->{19},18->{0},19->{1}] + Applied Processor: AddSinks + Details: () * Step 6: Failure MAYBE + Considered Problem: Rules: f11.0(A,B,E,F,G,H) -> f11.0(A,B,E,F,G,H) [A >= 1 + B] f11.1(A,B,E,F,G,H) -> f11.1(A,B,E,F,G,H) [B >= 1 + A] f6.2(A,B,E,F,G,H) -> f6.2(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.2(A,B,E,F,G,H) -> f6.3(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.2(A,B,E,F,G,H) -> f6.6(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.2(A,B,E,F,G,H) -> f6.7(A,B,E,H1,1 + G,-1 + H) [E >= 1 + F && G >= 0 && H >= 1] f6.3(A,B,E,F,G,H) -> f6.2(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.3(A,B,E,F,G,H) -> f6.3(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.3(A,B,E,F,G,H) -> f6.6(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f6.3(A,B,E,F,G,H) -> f6.7(A,B,E,H1,1 + G,-1 + H) [F >= 1 + E && G >= 0 && H >= 1] f26.4(A,B,E,F,G,H) -> f6.2(A,B,E,L1,1,4) [E >= 1 + I1] f26.4(A,B,E,F,G,H) -> f6.3(A,B,E,L1,1,4) [E >= 1 + I1] f26.4(A,B,E,F,G,H) -> f6.6(A,B,E,L1,1,4) [E >= 1 + I1] f26.4(A,B,E,F,G,H) -> f6.7(A,B,E,L1,1,4) [E >= 1 + I1] f26.5(A,B,E,F,G,H) -> f6.2(A,B,E,L1,1,4) [I1 >= 1 + E] f26.5(A,B,E,F,G,H) -> f6.3(A,B,E,L1,1,4) [I1 >= 1 + E] f26.5(A,B,E,F,G,H) -> f6.6(A,B,E,L1,1,4) [I1 >= 1 + E] f26.5(A,B,E,F,G,H) -> f6.7(A,B,E,L1,1,4) [I1 >= 1 + E] f6.6(A,B,E,F,G,H) -> f11.0(A,J1,F,F,G,H) [A >= 1 + J1 && G >= 0 && H >= 1 && F = E] f6.7(A,B,E,F,G,H) -> f11.1(A,J1,F,F,G,H) [J1 >= 1 + A && G >= 0 && H >= 1 && F = E] f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.1(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True f11.0(A,B,E,F,G,H) -> exitus616(A,B,E,F,G,H) True Signature: {(exitus616,6);(f11.0,6);(f11.1,6);(f26.4,6);(f26.5,6);(f6.2,6);(f6.3,6);(f6.6,6);(f6.7,6)} Rule Graph: [0->{0,21,23,25,27,29,31,33,35,37,39},1->{1,20,22,24,26,28,30,32,34,36,38},2->{2,3,4,5},3->{6,7,8,9} ,4->{18},5->{19},6->{2,3,4,5},7->{6,7,8,9},8->{18},9->{19},10->{2,3,4,5},11->{6,7,8,9},12->{18},13->{19} ,14->{2,3,4,5},15->{6,7,8,9},16->{18},17->{19},18->{0},19->{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] | +- p:[2,6,3,7] c: [2,3,6,7] | +- p:[1] c: [] | `- p:[0] c: [] MAYBE