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

YES