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

NO