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