MAYBE * Step 1: FromIts MAYBE + Considered Problem: Rules: 0. f1(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) -> f2(0,0,0,C + D,-1 + B + E,-1 + A + F,1 + G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1) [A >= 1 && B >= 1] (?,1) 1. f999(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) -> f1(1,1,-1 + H,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,C1) [H >= 1 (1,1) && C = 0 && B = 0 && A = 0 && D = 0 && E = 0 && F = 0 && G = 0 && I = 0 && J = 0 && K = 0 && L = 0 && M = 0 && N = 0 && O = 0 && P = 0 && Q = 0 && R = 0 && S = 0 && T = 0 && U = 0 && V = 0 && W = 0 && X = 0 && Y = 0 && Z = 0 && A1 = 0 && B1 = 0] 2. f1(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) -> f1(1 + A,1 + B,-1 + C + H,D,E,F,G,0,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1) [C + H >= 1] (?,1) 3. 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) -> f1(1 + A,1 + B,-1 + C + D + H,0,E,F,G,0,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1) [D + H >= 1] (?,1) 4. 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) -> f2(A,B,C,-1 + D + I,E + K,F + M,G + N,H,0,1 + J,0,1 + L,0,0,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1) [D >= 1] (?,1) 5. 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) -> f1(1 + A + L,1 + B + J,-1 + C + D + I,0,0,0,0,H,0,0,E + K,0,F + M,G + N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 [D >= 1] (?,1) ,C1) 6. 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) -> f1(1 + A,1 + B,-2 + C + D + H + I,0,0,0,0,0,0,1 + J,E + K,1 + L,F + M,G + N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1 [D + H + I >= 2 && D >= 1] (?,1) ,B1,C1) 7. f1(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) -> f1(1 + A + R + S,1 + B + P + Q,-1 + C + O,D,E,F,G,H,I,J,K,L,M,N,0,0,0,0,0,T,U,V,W,X,Y,Z,A1,B1,C1) [C >= 1] (?,1) 8. 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) -> f2(A,B,C,1 + D + T + U,-1 + E + V + W,B1 + F + X + Z,A1 + G + Y,H,I,J,K,L,M,N,O,P,Q,R,S,0,0,0,0,0,0,0,0[G >= 1 && F >= C1 && C1 >= 1 && E >= C1] (?,1) ,0,D1) Signature: {(f1,29);(f2,29);(f999,29)} Flow Graph: [0->{3,4,5,6,8},1->{0,2,7},2->{0,2,7},3->{0,2,7},4->{3,4,5,6,8},5->{0,2,7},6->{0,2,7},7->{0,2,7},8->{3,4,5 ,6,8}] + Applied Processor: FromIts + Details: () * Step 2: AddSinks MAYBE + Considered Problem: Rules: f1(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) -> f2(0,0,0,C + D,-1 + B + E ,-1 + A + F,1 + G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [A >= 1 && B >= 1] f999(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) -> f1(1,1,-1 + H,0,0,0,0,0,0,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ,C1) [H >= 1 && C = 0 && B = 0 && A = 0 && D = 0 && E = 0 && F = 0 && G = 0 && I = 0 && J = 0 && K = 0 && L = 0 && M = 0 && N = 0 && O = 0 && P = 0 && Q = 0 && R = 0 && S = 0 && T = 0 && U = 0 && V = 0 && W = 0 && X = 0 && Y = 0 && Z = 0 && A1 = 0 && B1 = 0] f1(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) -> f1(1 + A,1 + B,-1 + C + H,D,E,F,G,0 ,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [C + H >= 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) -> f1(1 + A,1 + B,-1 + C + D + H,0,E,F ,G,0,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [D + H >= 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) -> f2(A,B,C,-1 + D + I,E + K,F + M ,G + N,H,0,1 + J,0,1 + L,0,0,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [D >= 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) -> f1(1 + A + L,1 + B + J ,-1 + C + D + I,0,0,0,0,H,0,0,E + K,0,F + M,G + N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [D >= 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) -> f1(1 + A,1 + B,-2 + C + D + H + I,0 ,0,0,0,0,0,1 + J,E + K,1 + L,F + M,G + N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [D + H + I >= 2 && D >= 1] f1(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) -> f1(1 + A + R + S,1 + B + P + Q ,-1 + C + O,D,E,F,G,H,I,J,K,L,M,N,0,0,0,0,0,T,U,V,W,X,Y,Z,A1,B1 ,C1) [C >= 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) -> f2(A,B,C,1 + D + T + U ,-1 + E + V + W,B1 + F + X + Z,A1 + G + Y,H,I,J,K,L,M,N,O,P,Q,R,S,0,0,0,0,0,0,0,0,0 ,D1) [G >= 1 && F >= C1 && C1 >= 1 && E >= C1] Signature: {(f1,29);(f2,29);(f999,29)} Rule Graph: [0->{3,4,5,6,8},1->{0,2,7},2->{0,2,7},3->{0,2,7},4->{3,4,5,6,8},5->{0,2,7},6->{0,2,7},7->{0,2,7},8->{3,4,5 ,6,8}] + Applied Processor: AddSinks + Details: () * Step 3: Failure MAYBE + Considered Problem: Rules: f1(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) -> f2(0,0,0,C + D,-1 + B + E ,-1 + A + F,1 + G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [A >= 1 && B >= 1] f999(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) -> f1(1,1,-1 + H,0,0,0,0,0,0,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ,C1) [H >= 1 && C = 0 && B = 0 && A = 0 && D = 0 && E = 0 && F = 0 && G = 0 && I = 0 && J = 0 && K = 0 && L = 0 && M = 0 && N = 0 && O = 0 && P = 0 && Q = 0 && R = 0 && S = 0 && T = 0 && U = 0 && V = 0 && W = 0 && X = 0 && Y = 0 && Z = 0 && A1 = 0 && B1 = 0] f1(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) -> f1(1 + A,1 + B,-1 + C + H,D,E,F,G,0 ,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [C + H >= 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) -> f1(1 + A,1 + B,-1 + C + D + H,0,E,F ,G,0,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [D + H >= 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) -> f2(A,B,C,-1 + D + I,E + K,F + M ,G + N,H,0,1 + J,0,1 + L,0,0,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [D >= 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) -> f1(1 + A + L,1 + B + J ,-1 + C + D + I,0,0,0,0,H,0,0,E + K,0,F + M,G + N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [D >= 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) -> f1(1 + A,1 + B,-2 + C + D + H + I,0 ,0,0,0,0,0,1 + J,E + K,1 + L,F + M,G + N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1 ,C1) [D + H + I >= 2 && D >= 1] f1(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) -> f1(1 + A + R + S,1 + B + P + Q ,-1 + C + O,D,E,F,G,H,I,J,K,L,M,N,0,0,0,0,0,T,U,V,W,X,Y,Z,A1,B1 ,C1) [C >= 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) -> f2(A,B,C,1 + D + T + U ,-1 + E + V + W,B1 + F + X + Z,A1 + G + Y,H,I,J,K,L,M,N,O,P,Q,R,S,0,0,0,0,0,0,0,0,0 ,D1) [G >= 1 && F >= C1 && C1 >= 1 && E >= C1] 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) -> exitus616(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) True f1(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) -> exitus616(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) True f1(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) -> exitus616(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) True 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) -> exitus616(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) True 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) -> exitus616(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) True f1(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) -> exitus616(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) True f1(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) -> exitus616(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) True f1(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) -> exitus616(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) True Signature: {(exitus616,29);(f1,29);(f2,29);(f999,29)} Rule Graph: [0->{3,4,5,6,8,9},1->{0,2,7},2->{0,2,7,10},3->{0,2,7,11},4->{3,4,5,6,8,12},5->{0,2,7,14},6->{0,2,7,15} ,7->{0,2,7,16},8->{3,4,5,6,8,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] | `- p:[0,2,3,4,8,5,6,7] c: [] MAYBE