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

YES