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