YES
* Step 1: UnsatRules YES
    + Considered Problem:
        Rules:
          0. f300(A,B,C) -> f300(-1 + A,-2 + A,C) [A >= 1 && A + B >= 1 && B >= 1] (?,1)
          1. f300(A,B,C) -> f1(A,B,D)             [A >= 1 && 0 >= A + B && B >= 1] (?,1)
          2. f300(A,B,C) -> f1(A,B,D)             [B >= 1 && 0 >= A]               (?,1)
          3. f300(A,B,C) -> f1(A,B,D)             [0 >= B]                         (?,1)
          4. f2(A,B,C)   -> f300(A,B,C)           True                             (1,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,1,2,3},1->{},2->{},3->{},4->{0,1,2,3}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [1]
* Step 2: UnsatPaths YES
    + Considered Problem:
        Rules:
          0. f300(A,B,C) -> f300(-1 + A,-2 + A,C) [A >= 1 && A + B >= 1 && B >= 1] (?,1)
          2. f300(A,B,C) -> f1(A,B,D)             [B >= 1 && 0 >= A]               (?,1)
          3. f300(A,B,C) -> f1(A,B,D)             [0 >= B]                         (?,1)
          4. f2(A,B,C)   -> f300(A,B,C)           True                             (1,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,2,3},2->{},3->{},4->{0,2,3}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 3: FromIts YES
    + Considered Problem:
        Rules:
          0. f300(A,B,C) -> f300(-1 + A,-2 + A,C) [A >= 1 && A + B >= 1 && B >= 1] (?,1)
          2. f300(A,B,C) -> f1(A,B,D)             [B >= 1 && 0 >= A]               (?,1)
          3. f300(A,B,C) -> f1(A,B,D)             [0 >= B]                         (?,1)
          4. f2(A,B,C)   -> f300(A,B,C)           True                             (1,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,3},2->{},3->{},4->{0,2,3}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: Decompose YES
    + Considered Problem:
        Rules:
          f300(A,B,C) -> f300(-1 + A,-2 + A,C)  [A >= 1 && A + B >= 1 && B >= 1]
          f300(A,B,C) -> f1(A,B,D)              [B >= 1 && 0 >= A]
          f300(A,B,C) -> f1(A,B,D)              [0 >= B]
          f2(A,B,C)   -> f300(A,B,C)            True
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Rule Graph:
          [0->{0,3},2->{},3->{},4->{0,2,3}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,2,3,4]
          |
          `- p:[0] c: [0]
* Step 5: CloseWith YES
    + Considered Problem:
        (Rules:
          f300(A,B,C) -> f300(-1 + A,-2 + A,C)  [A >= 1 && A + B >= 1 && B >= 1]
          f300(A,B,C) -> f1(A,B,D)              [B >= 1 && 0 >= A]
          f300(A,B,C) -> f1(A,B,D)              [0 >= B]
          f2(A,B,C)   -> f300(A,B,C)            True
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Rule Graph:
          [0->{0,3},2->{},3->{},4->{0,2,3}]
        ,We construct a looptree:
          P: [0,2,3,4]
          |
          `- p:[0] c: [0])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES