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