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

NO