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