NO * Step 1: FromIts NO + Considered Problem: Rules: 0. f2(A,B) -> f300(A,C) [A = 0] (?,1) 1. f3(A,B) -> f2(A,B) True (1,1) 2. f2(A,B) -> f2(1 + C,B) [A >= 1] (?,1) 3. f2(A,B) -> f2(-1 + C,B) [0 >= 1 + A] (?,1) Signature: {(f2,2);(f3,2);(f300,2)} Flow Graph: [0->{},1->{0,2,3},2->{0,2,3},3->{0,2,3}] + Applied Processor: FromIts + Details: () * Step 2: CloseWith NO + Considered Problem: Rules: f2(A,B) -> f300(A,C) [A = 0] f3(A,B) -> f2(A,B) True f2(A,B) -> f2(1 + C,B) [A >= 1] f2(A,B) -> f2(-1 + C,B) [0 >= 1 + A] Signature: {(f2,2);(f3,2);(f300,2)} Rule Graph: [0->{},1->{0,2,3},2->{0,2,3},3->{0,2,3}] + Applied Processor: CloseWith False + Details: () NO