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