NO * Step 1: FromIts NO + 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: FromIts + Details: () * Step 2: CloseWith NO + Considered Problem: Rules: f1(A,B,C,D,E,F,G) -> f0(A,B,C,D,E,F,H) True f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,J,K,G) [J >= 1 && B >= 1 + A] f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,J,K,G) [0 >= 1 + J && B >= 1 + A] f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,0,F,G) [B >= 1 + A] f0(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G) [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: CloseWith False + Details: () NO