NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f2(A,B) [A >= 0]     (?,1)
          1. f300(A,B) -> f2(A,B) True         (1,1)
          2. f2(A,B)   -> f1(A,C) [0 >= 1 + A] (?,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{0,2},1->{0,2},2->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 2: FromIts NO
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f2(A,B) [A >= 0]     (?,1)
          1. f300(A,B) -> f2(A,B) True         (1,1)
          2. f2(A,B)   -> f1(A,C) [0 >= 1 + A] (?,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{0},1->{0,2},2->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: CloseWith NO
    + Considered Problem:
        Rules:
          f2(A,B)   -> f2(A,B)  [A >= 0]
          f300(A,B) -> f2(A,B)  True
          f2(A,B)   -> f1(A,C)  [0 >= 1 + A]
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Rule Graph:
          [0->{0},1->{0,2},2->{}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO