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