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

YES