MAYBE * Step 1: ArgumentFilter MAYBE + Considered Problem: Rules: 0. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> f11(A,P,B,O,E,F,G,H,I,J,K,L,M,N) [A >= 0 && B >= 1] (?,1) 1. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> f11(A,P,B,O,E,F,G,H,I,J,K,L,M,N) [A >= 0 && 0 >= 1 + B] (?,1) 2. f16(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> f16(A,B,C,D,E,F,1 + G,O,O,O,K,L,M,N) [E >= 0 && F >= 2 + G] (?,1) 3. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> f13(A,0,C,D,E,F,G,H,I,J,O,L,M,N) [A >= 0 && B = 0] (?,1) 4. f16(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> f11(A,R,P,Q,E,F,G,H,I,J,O,J,J,N) [1 + G >= F && P >= 1 && E >= 0] (?,1) 5. f16(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> f11(A,R,P,Q,E,F,G,H,I,J,O,J,J,N) [1 + G >= F && 0 >= 1 + P && E >= 0] (?,1) 6. f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> f16(A,B,C,D,E,F,1,O,O,O,K,L,M,P) [F >= 2] (1,1) 7. f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> f13(A,0,C,D,E,F,0,H,I,0,O,0,0,P) [1 >= F] (1,1) Signature: {(f11,14);(f13,14);(f16,14);(f300,14)} Flow Graph: [0->{0,1,3},1->{0,1,3},2->{2,4,5},3->{},4->{0,1,3},5->{0,1,3},6->{2,4,5},7->{}] + Applied Processor: ArgumentFilter [2,3,7,8,9,10,11,12,13] + Details: We remove following argument positions: [2,3,7,8,9,10,11,12,13]. * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. f11(A,B,E,F,G) -> f11(A,P,E,F,G) [A >= 0 && B >= 1] (?,1) 1. f11(A,B,E,F,G) -> f11(A,P,E,F,G) [A >= 0 && 0 >= 1 + B] (?,1) 2. f16(A,B,E,F,G) -> f16(A,B,E,F,1 + G) [E >= 0 && F >= 2 + G] (?,1) 3. f11(A,B,E,F,G) -> f13(A,0,E,F,G) [A >= 0 && B = 0] (?,1) 4. f16(A,B,E,F,G) -> f11(A,R,E,F,G) [1 + G >= F && P >= 1 && E >= 0] (?,1) 5. f16(A,B,E,F,G) -> f11(A,R,E,F,G) [1 + G >= F && 0 >= 1 + P && E >= 0] (?,1) 6. f300(A,B,E,F,G) -> f16(A,B,E,F,1) [F >= 2] (1,1) 7. f300(A,B,E,F,G) -> f13(A,0,E,F,0) [1 >= F] (1,1) Signature: {(f11,14);(f13,14);(f16,14);(f300,14)} Flow Graph: [0->{0,1,3},1->{0,1,3},2->{2,4,5},3->{},4->{0,1,3},5->{0,1,3},6->{2,4,5},7->{}] + Applied Processor: FromIts + Details: () * Step 3: AddSinks MAYBE + Considered Problem: Rules: f11(A,B,E,F,G) -> f11(A,P,E,F,G) [A >= 0 && B >= 1] f11(A,B,E,F,G) -> f11(A,P,E,F,G) [A >= 0 && 0 >= 1 + B] f16(A,B,E,F,G) -> f16(A,B,E,F,1 + G) [E >= 0 && F >= 2 + G] f11(A,B,E,F,G) -> f13(A,0,E,F,G) [A >= 0 && B = 0] f16(A,B,E,F,G) -> f11(A,R,E,F,G) [1 + G >= F && P >= 1 && E >= 0] f16(A,B,E,F,G) -> f11(A,R,E,F,G) [1 + G >= F && 0 >= 1 + P && E >= 0] f300(A,B,E,F,G) -> f16(A,B,E,F,1) [F >= 2] f300(A,B,E,F,G) -> f13(A,0,E,F,0) [1 >= F] Signature: {(f11,14);(f13,14);(f16,14);(f300,14)} Rule Graph: [0->{0,1,3},1->{0,1,3},2->{2,4,5},3->{},4->{0,1,3},5->{0,1,3},6->{2,4,5},7->{}] + Applied Processor: AddSinks + Details: () * Step 4: Failure MAYBE + Considered Problem: Rules: f11(A,B,E,F,G) -> f11(A,P,E,F,G) [A >= 0 && B >= 1] f11(A,B,E,F,G) -> f11(A,P,E,F,G) [A >= 0 && 0 >= 1 + B] f16(A,B,E,F,G) -> f16(A,B,E,F,1 + G) [E >= 0 && F >= 2 + G] f11(A,B,E,F,G) -> f13(A,0,E,F,G) [A >= 0 && B = 0] f16(A,B,E,F,G) -> f11(A,R,E,F,G) [1 + G >= F && P >= 1 && E >= 0] f16(A,B,E,F,G) -> f11(A,R,E,F,G) [1 + G >= F && 0 >= 1 + P && E >= 0] f300(A,B,E,F,G) -> f16(A,B,E,F,1) [F >= 2] f300(A,B,E,F,G) -> f13(A,0,E,F,0) [1 >= F] f13(A,B,E,F,G) -> exitus616(A,B,E,F,G) True f13(A,B,E,F,G) -> exitus616(A,B,E,F,G) True f13(A,B,E,F,G) -> exitus616(A,B,E,F,G) True Signature: {(exitus616,5);(f11,14);(f13,14);(f16,14);(f300,14)} Rule Graph: [0->{0,1,3},1->{0,1,3},2->{2,4,5},3->{9,10},4->{0,1,3},5->{0,1,3},6->{2,4,5},7->{8}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | +- p:[2] c: [2] | `- p:[0,1] c: [] MAYBE