YES
* Step 1: UnsatPaths YES
    + Considered Problem:
        Rules:
          0. f0(A,B,C)  -> f9(0,D,0)      True                                                                      (1,1)
          1. f9(A,B,C)  -> f9(A,B,1 + C)  [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C] (?,1)
          2. f17(A,B,C) -> f17(1 + A,B,C) [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]                   (?,1)
          3. f17(A,B,C) -> f24(A,B,C)     [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]                   (?,1)
          4. f9(A,B,C)  -> f17(0,B,C)     [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50] (?,1)
        Signature:
          {(f0,3);(f17,3);(f24,3);(f9,3)}
        Flow Graph:
          [0->{1,4},1->{1,4},2->{2,3},3->{},4->{2,3}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,4),(4,3)]
* Step 2: FromIts YES
    + Considered Problem:
        Rules:
          0. f0(A,B,C)  -> f9(0,D,0)      True                                                                      (1,1)
          1. f9(A,B,C)  -> f9(A,B,1 + C)  [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C] (?,1)
          2. f17(A,B,C) -> f17(1 + A,B,C) [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]                   (?,1)
          3. f17(A,B,C) -> f24(A,B,C)     [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]                   (?,1)
          4. f9(A,B,C)  -> f17(0,B,C)     [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50] (?,1)
        Signature:
          {(f0,3);(f17,3);(f24,3);(f9,3)}
        Flow Graph:
          [0->{1},1->{1,4},2->{2,3},3->{},4->{2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Decompose YES
    + Considered Problem:
        Rules:
          f0(A,B,C)  -> f9(0,D,0)       True
          f9(A,B,C)  -> f9(A,B,1 + C)   [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C]
          f17(A,B,C) -> f17(1 + A,B,C)  [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]
          f17(A,B,C) -> f24(A,B,C)      [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]
          f9(A,B,C)  -> f17(0,B,C)      [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50]
        Signature:
          {(f0,3);(f17,3);(f24,3);(f9,3)}
        Rule Graph:
          [0->{1},1->{1,4},2->{2,3},3->{},4->{2}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4]
          |
          +- p:[1] c: [1]
          |
          `- p:[2] c: [2]
* Step 4: CloseWith YES
    + Considered Problem:
        (Rules:
          f0(A,B,C)  -> f9(0,D,0)       True
          f9(A,B,C)  -> f9(A,B,1 + C)   [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C]
          f17(A,B,C) -> f17(1 + A,B,C)  [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]
          f17(A,B,C) -> f24(A,B,C)      [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]
          f9(A,B,C)  -> f17(0,B,C)      [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50]
        Signature:
          {(f0,3);(f17,3);(f24,3);(f9,3)}
        Rule Graph:
          [0->{1},1->{1,4},2->{2,3},3->{},4->{2}]
        ,We construct a looptree:
          P: [0,1,2,3,4]
          |
          +- p:[1] c: [1]
          |
          `- p:[2] c: [2])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES