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