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

NO