NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f3(A)   -> f3(-1 + A) [A >= 1] (?,1)
          1. f3(A)   -> f3(-1 + A) [0 >= A] (?,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: [(1,0)]
* Step 2: Looptree NO
    + Considered Problem:
        Rules:
          0. f3(A)   -> f3(-1 + A) [A >= 1] (?,1)
          1. f3(A)   -> f3(-1 + A) [0 >= A] (?,1)
          2. f300(A) -> f3(A)      True     (1,1)
        Signature:
          {(f3,1);(f300,1)}
        Flow Graph:
          [0->{0,1},1->{1},2->{0,1}]
        
    + Applied Processor:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1,2]
          |
          +- p:[0] c: [0]
          |
          `- p:[1] c: []

NO