YES(?,O(1))
* Step 1: UnsatPaths WORST_CASE(?,O(1))
    + 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: TrivialSCCs WORST_CASE(?,O(1))
    + 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:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 3: PolyRank WORST_CASE(?,O(1))
    + 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,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,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:
        PolyRank {useFarkas = True, withSizebounds = [], shape = Linear}
    + Details:
        We apply a polynomial interpretation of shape linear:
           p(f0) = 50        
          p(f17) = 50 + -1*x1
          p(f24) = 50 + -1*x1
           p(f9) = 50        
        
        Following rules are strictly oriented:
        [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A] ==>               
                                                     f17(A,B,C)   = 50 + -1*A     
                                                                  > 49 + -1*A     
                                                                  = f17(1 + A,B,C)
        
        
        Following rules are weakly oriented:
                                                                             True ==>              
                                                                        f0(A,B,C)   = 50           
                                                                                   >= 50           
                                                                                    = f9(0,D,0)    
        
        [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C] ==>              
                                                                        f9(A,B,C)   = 50           
                                                                                   >= 50           
                                                                                    = f9(A,B,1 + C)
        
                          [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50] ==>              
                                                                       f17(A,B,C)   = 50 + -1*A    
                                                                                   >= 50 + -1*A    
                                                                                    = f24(A,B,C)   
        
        [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50] ==>              
                                                                        f9(A,B,C)   = 50           
                                                                                   >= 50           
                                                                                    = f17(0,B,C)   
        
        
* Step 4: PolyRank WORST_CASE(?,O(1))
    + 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]                   (50,1)
          3. f17(A,B,C) -> f24(A,B,C)     [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]                   (1,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,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:
        PolyRank {useFarkas = True, withSizebounds = [], shape = Linear}
    + Details:
        We apply a polynomial interpretation of shape linear:
           p(f0) = 50        
          p(f17) = 50 + -1*x3
          p(f24) = 50 + -1*x3
           p(f9) = 50 + -1*x3
        
        Following rules are strictly oriented:
        [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && 49 >= C] ==>              
                                                                        f9(A,B,C)   = 50 + -1*C    
                                                                                    > 49 + -1*C    
                                                                                    = f9(A,B,1 + C)
        
        
        Following rules are weakly oriented:
                                                                             True ==>               
                                                                        f0(A,B,C)   = 50            
                                                                                   >= 50            
                                                                                    = f9(0,D,0)     
        
                          [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A] ==>               
                                                                       f17(A,B,C)   = 50 + -1*C     
                                                                                   >= 50 + -1*C     
                                                                                    = f17(1 + A,B,C)
        
                          [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50] ==>               
                                                                       f17(A,B,C)   = 50 + -1*C     
                                                                                   >= 50 + -1*C     
                                                                                    = f24(A,B,C)    
        
        [C >= 0 && A + C >= 0 && -1*A + C >= 0 && -1*A >= 0 && A >= 0 && C >= 50] ==>               
                                                                        f9(A,B,C)   = 50 + -1*C     
                                                                                   >= 50 + -1*C     
                                                                                    = f17(0,B,C)    
        
        
* Step 5: KnowledgePropagation WORST_CASE(?,O(1))
    + 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] (50,1)
          2. f17(A,B,C) -> f17(1 + A,B,C) [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && 49 >= A]                   (50,1)
          3. f17(A,B,C) -> f24(A,B,C)     [-50 + C >= 0 && -50 + A + C >= 0 && A >= 0 && A >= 50]                   (1,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,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:
        KnowledgePropagation
    + Details:
        The problem is already solved.

YES(?,O(1))