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

NO