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

NO