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