NO * Step 1: UnsatPaths NO + Considered Problem: Rules: 0. f2(A,B,C,D) -> f300(A,B,C,D) True (1,1) 1. f300(A,B,C,D) -> f300(A,B,E,D) [E >= 1 && B >= 1 + A] (?,1) 2. f300(A,B,C,D) -> f300(A,B,E,D) [0 >= 1 + E && B >= 1 + A] (?,1) 3. f300(A,B,C,D) -> f300(A,-1 + B,0,D) [B >= 1 + A] (?,1) 4. f300(A,B,C,D) -> f1(A,B,C,E) [A >= B] (?,1) Signature: {(f1,4);(f2,4);(f300,4)} 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: UnsatPaths + Details: We remove following edges from the transition graph: [(1,4),(2,4)] * Step 2: FromIts NO + Considered Problem: Rules: 0. f2(A,B,C,D) -> f300(A,B,C,D) True (1,1) 1. f300(A,B,C,D) -> f300(A,B,E,D) [E >= 1 && B >= 1 + A] (?,1) 2. f300(A,B,C,D) -> f300(A,B,E,D) [0 >= 1 + E && B >= 1 + A] (?,1) 3. f300(A,B,C,D) -> f300(A,-1 + B,0,D) [B >= 1 + A] (?,1) 4. f300(A,B,C,D) -> f1(A,B,C,E) [A >= B] (?,1) Signature: {(f1,4);(f2,4);(f300,4)} Flow Graph: [0->{1,2,3,4},1->{1,2,3},2->{1,2,3},3->{1,2,3,4},4->{}] + Applied Processor: FromIts + Details: () * Step 3: CloseWith NO + Considered Problem: Rules: f2(A,B,C,D) -> f300(A,B,C,D) True f300(A,B,C,D) -> f300(A,B,E,D) [E >= 1 && B >= 1 + A] f300(A,B,C,D) -> f300(A,B,E,D) [0 >= 1 + E && B >= 1 + A] f300(A,B,C,D) -> f300(A,-1 + B,0,D) [B >= 1 + A] f300(A,B,C,D) -> f1(A,B,C,E) [A >= B] Signature: {(f1,4);(f2,4);(f300,4)} Rule Graph: [0->{1,2,3,4},1->{1,2,3},2->{1,2,3},3->{1,2,3,4},4->{}] + Applied Processor: CloseWith False + Details: () NO