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

YES