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