NO
* Step 1: Looptree NO
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f0(-1 + A,C) [0 >= C] (?,1)
          1. f0(A,B) -> f0(1 + A,C)  [C >= 1] (?,1)
          2. f3(A,B) -> f0(2,B)      True     (1,1)
        Signature:
          {(f0,2);(f3,2)}
        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: []

NO