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