NO * Step 1: Looptree NO + Considered Problem: Rules: 0. f2(A,B,C,D) -> f2(1 + A,1 + B,-1 + C,D) [B + -1*C >= 0 && A + -1*C >= 0 && A + -1*B >= 0 && -1*A + B >= 0] (?,1) 1. f1(A,B,C,D) -> f2(A,B,C,D) [A >= C && B >= A && C >= B] (1,1) 2. f1(A,B,C,D) -> f300(A,B,C,E) [C >= 1 + A && B >= A && C >= B] (1,1) 3. f1(A,B,C,D) -> f300(A,B,C,E) [B >= A && B >= 1 + C] (1,1) 4. f1(A,B,C,D) -> f300(A,B,C,E) [A >= 1 + B] (1,1) Signature: {(f1,4);(f2,4);(f300,4)} Flow Graph: [0->{0},1->{0},2->{},3->{},4->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4] | `- p:[0] c: [] NO