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

YES