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

NO