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