NO
* Step 1: TrivialSCCs NO
    + Considered Problem:
        Rules:
          0. f1(A,B,C) -> f0(A,B,C)          True     (1,1)
          1. f0(A,B,C) -> f0(A + C,B,-1 + C) [A >= 1] (?,1)
          2. f0(A,B,C) -> f2(A,D,C)          [0 >= A] (?,1)
        Signature:
          {(f0,3);(f1,3);(f2,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: Looptree NO
    + Considered Problem:
        Rules:
          0. f1(A,B,C) -> f0(A,B,C)          True     (1,1)
          1. f0(A,B,C) -> f0(A + C,B,-1 + C) [A >= 1] (?,1)
          2. f0(A,B,C) -> f2(A,D,C)          [0 >= A] (1,1)
        Signature:
          {(f0,3);(f1,3);(f2,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1,2]
          |
          `- p:[1] c: []

NO