MAYBE * Step 1: FromIts MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D) -> f9(E,0,C,0) True (1,1) 1. f9(A,B,C,D) -> f22(A,B,C,D) [-1*D >= 0 (?,1) && B + -1*D >= 0 && -1*B + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*B >= 0 && B >= 0 && A >= 1] 2. f9(A,B,C,D) -> f14(A,0,E,D) [-1*D >= 0 (?,1) && B + -1*D >= 0 && -1*B + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*B >= 0 && B >= 0 && 0 >= A] 3. f22(A,B,C,D) -> f22(A,B,C,D) [-1*D >= 0 (?,1) && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1 + A + D >= 0 && -1*B >= 0 && -1 + A + -1*B >= 0 && B >= 0 && -1 + A + B >= 0 && -1 + A >= 0] 4. f14(A,B,C,D) -> f9(E,B,C,0) [-1*D >= 0 (?,1) && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1*A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*A + D >= 0 && -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && -1*A + B >= 0 && -1*A >= 0 && 0 >= C] 5. f14(A,B,C,D) -> f14(A,B,-1 + C,D) [-1*D >= 0 (?,1) && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1*A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*A + D >= 0 && -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && -1*A + B >= 0 && -1*A >= 0 && C >= 1] Signature: {(f0,4);(f14,4);(f22,4);(f9,4)} Flow Graph: [0->{1,2},1->{3},2->{4,5},3->{3},4->{1,2},5->{4,5}] + Applied Processor: FromIts + Details: () * Step 2: AddSinks MAYBE + Considered Problem: Rules: f0(A,B,C,D) -> f9(E,0,C,0) True f9(A,B,C,D) -> f22(A,B,C,D) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*B >= 0 && B >= 0 && A >= 1] f9(A,B,C,D) -> f14(A,0,E,D) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*B >= 0 && B >= 0 && 0 >= A] f22(A,B,C,D) -> f22(A,B,C,D) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1 + A + D >= 0 && -1*B >= 0 && -1 + A + -1*B >= 0 && B >= 0 && -1 + A + B >= 0 && -1 + A >= 0] f14(A,B,C,D) -> f9(E,B,C,0) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1*A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*A + D >= 0 && -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && -1*A + B >= 0 && -1*A >= 0 && 0 >= C] f14(A,B,C,D) -> f14(A,B,-1 + C,D) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1*A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*A + D >= 0 && -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && -1*A + B >= 0 && -1*A >= 0 && C >= 1] Signature: {(f0,4);(f14,4);(f22,4);(f9,4)} Rule Graph: [0->{1,2},1->{3},2->{4,5},3->{3},4->{1,2},5->{4,5}] + Applied Processor: AddSinks + Details: () * Step 3: Failure MAYBE + Considered Problem: Rules: f0(A,B,C,D) -> f9(E,0,C,0) True f9(A,B,C,D) -> f22(A,B,C,D) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*B >= 0 && B >= 0 && A >= 1] f9(A,B,C,D) -> f14(A,0,E,D) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*B >= 0 && B >= 0 && 0 >= A] f22(A,B,C,D) -> f22(A,B,C,D) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1 + A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1 + A + D >= 0 && -1*B >= 0 && -1 + A + -1*B >= 0 && B >= 0 && -1 + A + B >= 0 && -1 + A >= 0] f14(A,B,C,D) -> f9(E,B,C,0) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1*A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*A + D >= 0 && -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && -1*A + B >= 0 && -1*A >= 0 && 0 >= C] f14(A,B,C,D) -> f14(A,B,-1 + C,D) [-1*D >= 0 && B + -1*D >= 0 && -1*B + -1*D >= 0 && -1*A + -1*D >= 0 && D >= 0 && B + D >= 0 && -1*B + D >= 0 && -1*A + D >= 0 && -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && -1*A + B >= 0 && -1*A >= 0 && C >= 1] f22(A,B,C,D) -> exitus616(A,B,C,D) True Signature: {(exitus616,4);(f0,4);(f14,4);(f22,4);(f9,4)} Rule Graph: [0->{1,2},1->{3},2->{4,5},3->{3,6},4->{1,2},5->{4,5}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6] | +- p:[2,4,5] c: [] | `- p:[3] c: [] MAYBE