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