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