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