YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0. f0(A) -> f1(300)    True                          (1,1)
          1. f1(A) -> f1(-1 + A) [300 + -1*A >= 0 && A >= 102] (?,1)
        Signature:
          {(f0,1);(f1,1)}
        Flow Graph:
          [0->{1},1->{1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          f0(A) -> f1(300)     True
          f1(A) -> f1(-1 + A)  [300 + -1*A >= 0 && A >= 102]
        Signature:
          {(f0,1);(f1,1)}
        Rule Graph:
          [0->{1},1->{1}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1]
          |
          `- p:[1] c: [1]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          f0(A) -> f1(300)     True
          f1(A) -> f1(-1 + A)  [300 + -1*A >= 0 && A >= 102]
        Signature:
          {(f0,1);(f1,1)}
        Rule Graph:
          [0->{1},1->{1}]
        ,We construct a looptree:
          P: [0,1]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES