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