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