MAYBE * Step 1: FromIts MAYBE + Considered Problem: Rules: 0. f0(A,B,C) -> f1(A,B,C) True (1,1) 1. f1(A,B,C) -> f1(A + B,-1 + B,C) [A >= 1] (?,1) 2. f1(A,B,C) -> f1(A + C,B,-1 + C) [A >= 1] (?,1) Signature: {(f0,3);(f1,3)} Flow Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: FromIts + Details: () * Step 2: AddSinks MAYBE + Considered Problem: Rules: f0(A,B,C) -> f1(A,B,C) True f1(A,B,C) -> f1(A + B,-1 + B,C) [A >= 1] f1(A,B,C) -> f1(A + C,B,-1 + C) [A >= 1] Signature: {(f0,3);(f1,3)} Rule Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: AddSinks + Details: () * Step 3: Failure MAYBE + Considered Problem: Rules: f0(A,B,C) -> f1(A,B,C) True f1(A,B,C) -> f1(A + B,-1 + B,C) [A >= 1] f1(A,B,C) -> f1(A + C,B,-1 + C) [A >= 1] f1(A,B,C) -> exitus616(A,B,C) True f1(A,B,C) -> exitus616(A,B,C) True Signature: {(exitus616,3);(f0,3);(f1,3)} 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: [] MAYBE