YES

Problem:
 r(r(x1)) -> s(r(x1))
 r(s(x1)) -> s(r(x1))
 r(n(x1)) -> s(r(x1))
 r(b(x1)) -> u(s(b(x1)))
 r(u(x1)) -> u(r(x1))
 s(u(x1)) -> u(s(x1))
 n(u(x1)) -> u(n(x1))
 t(r(u(x1))) -> t(c(r(x1)))
 t(s(u(x1))) -> t(c(r(x1)))
 t(n(u(x1))) -> t(c(r(x1)))
 c(u(x1)) -> u(c(x1))
 c(s(x1)) -> s(c(x1))
 c(r(x1)) -> r(c(x1))
 c(n(x1)) -> n(c(x1))
 c(n(x1)) -> n(x1)

Proof:
 Arctic Interpretation Processor:
  dimension: 1
  interpretation:
   [c](x0) = x0,
   
   [t](x0) = 4x0,
   
   [u](x0) = x0,
   
   [b](x0) = 1x0,
   
   [n](x0) = 10x0,
   
   [s](x0) = 8x0,
   
   [r](x0) = 8x0
  orientation:
   r(r(x1)) = 16x1 >= 16x1 = s(r(x1))
   
   r(s(x1)) = 16x1 >= 16x1 = s(r(x1))
   
   r(n(x1)) = 18x1 >= 16x1 = s(r(x1))
   
   r(b(x1)) = 9x1 >= 9x1 = u(s(b(x1)))
   
   r(u(x1)) = 8x1 >= 8x1 = u(r(x1))
   
   s(u(x1)) = 8x1 >= 8x1 = u(s(x1))
   
   n(u(x1)) = 10x1 >= 10x1 = u(n(x1))
   
   t(r(u(x1))) = 12x1 >= 12x1 = t(c(r(x1)))
   
   t(s(u(x1))) = 12x1 >= 12x1 = t(c(r(x1)))
   
   t(n(u(x1))) = 14x1 >= 12x1 = t(c(r(x1)))
   
   c(u(x1)) = x1 >= x1 = u(c(x1))
   
   c(s(x1)) = 8x1 >= 8x1 = s(c(x1))
   
   c(r(x1)) = 8x1 >= 8x1 = r(c(x1))
   
   c(n(x1)) = 10x1 >= 10x1 = n(c(x1))
   
   c(n(x1)) = 10x1 >= 10x1 = n(x1)
  problem:
   r(r(x1)) -> s(r(x1))
   r(s(x1)) -> s(r(x1))
   r(b(x1)) -> u(s(b(x1)))
   r(u(x1)) -> u(r(x1))
   s(u(x1)) -> u(s(x1))
   n(u(x1)) -> u(n(x1))
   t(r(u(x1))) -> t(c(r(x1)))
   t(s(u(x1))) -> t(c(r(x1)))
   c(u(x1)) -> u(c(x1))
   c(s(x1)) -> s(c(x1))
   c(r(x1)) -> r(c(x1))
   c(n(x1)) -> n(c(x1))
   c(n(x1)) -> n(x1)
  Arctic Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0,
    
    [t](x0) = 1x0,
    
    [u](x0) = 1x0,
    
    [b](x0) = 8x0,
    
    [n](x0) = 7x0,
    
    [s](x0) = 1x0,
    
    [r](x0) = 2x0
   orientation:
    r(r(x1)) = 4x1 >= 3x1 = s(r(x1))
    
    r(s(x1)) = 3x1 >= 3x1 = s(r(x1))
    
    r(b(x1)) = 10x1 >= 10x1 = u(s(b(x1)))
    
    r(u(x1)) = 3x1 >= 3x1 = u(r(x1))
    
    s(u(x1)) = 2x1 >= 2x1 = u(s(x1))
    
    n(u(x1)) = 8x1 >= 8x1 = u(n(x1))
    
    t(r(u(x1))) = 4x1 >= 3x1 = t(c(r(x1)))
    
    t(s(u(x1))) = 3x1 >= 3x1 = t(c(r(x1)))
    
    c(u(x1)) = 1x1 >= 1x1 = u(c(x1))
    
    c(s(x1)) = 1x1 >= 1x1 = s(c(x1))
    
    c(r(x1)) = 2x1 >= 2x1 = r(c(x1))
    
    c(n(x1)) = 7x1 >= 7x1 = n(c(x1))
    
    c(n(x1)) = 7x1 >= 7x1 = n(x1)
   problem:
    r(s(x1)) -> s(r(x1))
    r(b(x1)) -> u(s(b(x1)))
    r(u(x1)) -> u(r(x1))
    s(u(x1)) -> u(s(x1))
    n(u(x1)) -> u(n(x1))
    t(s(u(x1))) -> t(c(r(x1)))
    c(u(x1)) -> u(c(x1))
    c(s(x1)) -> s(c(x1))
    c(r(x1)) -> r(c(x1))
    c(n(x1)) -> n(c(x1))
    c(n(x1)) -> n(x1)
   String Reversal Processor:
    s(r(x1)) -> r(s(x1))
    b(r(x1)) -> b(s(u(x1)))
    u(r(x1)) -> r(u(x1))
    u(s(x1)) -> s(u(x1))
    u(n(x1)) -> n(u(x1))
    u(s(t(x1))) -> r(c(t(x1)))
    u(c(x1)) -> c(u(x1))
    s(c(x1)) -> c(s(x1))
    r(c(x1)) -> c(r(x1))
    n(c(x1)) -> c(n(x1))
    n(c(x1)) -> n(x1)
    Matrix Interpretation Processor: dim=3
     
     interpretation:
                [1 0 0]  
      [c](x0) = [0 0 0]x0
                [0 0 0]  ,
      
                [1 0 0]     [1]
      [t](x0) = [1 1 0]x0 + [1]
                [0 0 0]     [0],
      
                [1 0 0]  
      [u](x0) = [0 1 0]x0
                [0 0 0]  ,
      
                [1 1 0]  
      [b](x0) = [0 0 0]x0
                [0 0 0]  ,
      
                [1 0 0]  
      [n](x0) = [0 0 0]x0
                [0 0 0]  ,
      
                [1 0 0]  
      [s](x0) = [1 1 0]x0
                [0 0 0]  ,
      
                [1 0 0]     [0]
      [r](x0) = [1 1 0]x0 + [1]
                [0 0 0]     [0]
     orientation:
                 [1 0 0]     [0]    [1 0 0]     [0]           
      s(r(x1)) = [2 1 0]x1 + [1] >= [2 1 0]x1 + [1] = r(s(x1))
                 [0 0 0]     [0]    [0 0 0]     [0]           
      
                 [2 1 0]     [1]    [2 1 0]                
      b(r(x1)) = [0 0 0]x1 + [0] >= [0 0 0]x1 = b(s(u(x1)))
                 [0 0 0]     [0]    [0 0 0]                
      
                 [1 0 0]     [0]    [1 0 0]     [0]           
      u(r(x1)) = [1 1 0]x1 + [1] >= [1 1 0]x1 + [1] = r(u(x1))
                 [0 0 0]     [0]    [0 0 0]     [0]           
      
                 [1 0 0]      [1 0 0]             
      u(s(x1)) = [1 1 0]x1 >= [1 1 0]x1 = s(u(x1))
                 [0 0 0]      [0 0 0]             
      
                 [1 0 0]      [1 0 0]             
      u(n(x1)) = [0 0 0]x1 >= [0 0 0]x1 = n(u(x1))
                 [0 0 0]      [0 0 0]             
      
                    [1 0 0]     [1]    [1 0 0]     [1]              
      u(s(t(x1))) = [2 1 0]x1 + [2] >= [1 0 0]x1 + [2] = r(c(t(x1)))
                    [0 0 0]     [0]    [0 0 0]     [0]              
      
                 [1 0 0]      [1 0 0]             
      u(c(x1)) = [0 0 0]x1 >= [0 0 0]x1 = c(u(x1))
                 [0 0 0]      [0 0 0]             
      
                 [1 0 0]      [1 0 0]             
      s(c(x1)) = [1 0 0]x1 >= [0 0 0]x1 = c(s(x1))
                 [0 0 0]      [0 0 0]             
      
                 [1 0 0]     [0]    [1 0 0]             
      r(c(x1)) = [1 0 0]x1 + [1] >= [0 0 0]x1 = c(r(x1))
                 [0 0 0]     [0]    [0 0 0]             
      
                 [1 0 0]      [1 0 0]             
      n(c(x1)) = [0 0 0]x1 >= [0 0 0]x1 = c(n(x1))
                 [0 0 0]      [0 0 0]             
      
                 [1 0 0]      [1 0 0]          
      n(c(x1)) = [0 0 0]x1 >= [0 0 0]x1 = n(x1)
                 [0 0 0]      [0 0 0]          
     problem:
      s(r(x1)) -> r(s(x1))
      u(r(x1)) -> r(u(x1))
      u(s(x1)) -> s(u(x1))
      u(n(x1)) -> n(u(x1))
      u(s(t(x1))) -> r(c(t(x1)))
      u(c(x1)) -> c(u(x1))
      s(c(x1)) -> c(s(x1))
      r(c(x1)) -> c(r(x1))
      n(c(x1)) -> c(n(x1))
      n(c(x1)) -> n(x1)
     Arctic Interpretation Processor:
      dimension: 1
      interpretation:
       [c](x0) = 1x0,
       
       [t](x0) = 10x0,
       
       [u](x0) = 1x0,
       
       [n](x0) = 14x0,
       
       [s](x0) = x0,
       
       [r](x0) = x0
      orientation:
       s(r(x1)) = x1 >= x1 = r(s(x1))
       
       u(r(x1)) = 1x1 >= 1x1 = r(u(x1))
       
       u(s(x1)) = 1x1 >= 1x1 = s(u(x1))
       
       u(n(x1)) = 15x1 >= 15x1 = n(u(x1))
       
       u(s(t(x1))) = 11x1 >= 11x1 = r(c(t(x1)))
       
       u(c(x1)) = 2x1 >= 2x1 = c(u(x1))
       
       s(c(x1)) = 1x1 >= 1x1 = c(s(x1))
       
       r(c(x1)) = 1x1 >= 1x1 = c(r(x1))
       
       n(c(x1)) = 15x1 >= 15x1 = c(n(x1))
       
       n(c(x1)) = 15x1 >= 14x1 = n(x1)
      problem:
       s(r(x1)) -> r(s(x1))
       u(r(x1)) -> r(u(x1))
       u(s(x1)) -> s(u(x1))
       u(n(x1)) -> n(u(x1))
       u(s(t(x1))) -> r(c(t(x1)))
       u(c(x1)) -> c(u(x1))
       s(c(x1)) -> c(s(x1))
       r(c(x1)) -> c(r(x1))
       n(c(x1)) -> c(n(x1))
      Arctic Interpretation Processor:
       dimension: 1
       interpretation:
        [c](x0) = 2x0,
        
        [t](x0) = 3x0,
        
        [u](x0) = x0,
        
        [n](x0) = x0,
        
        [s](x0) = 3x0,
        
        [r](x0) = x0
       orientation:
        s(r(x1)) = 3x1 >= 3x1 = r(s(x1))
        
        u(r(x1)) = x1 >= x1 = r(u(x1))
        
        u(s(x1)) = 3x1 >= 3x1 = s(u(x1))
        
        u(n(x1)) = x1 >= x1 = n(u(x1))
        
        u(s(t(x1))) = 6x1 >= 5x1 = r(c(t(x1)))
        
        u(c(x1)) = 2x1 >= 2x1 = c(u(x1))
        
        s(c(x1)) = 5x1 >= 5x1 = c(s(x1))
        
        r(c(x1)) = 2x1 >= 2x1 = c(r(x1))
        
        n(c(x1)) = 2x1 >= 2x1 = c(n(x1))
       problem:
        s(r(x1)) -> r(s(x1))
        u(r(x1)) -> r(u(x1))
        u(s(x1)) -> s(u(x1))
        u(n(x1)) -> n(u(x1))
        u(c(x1)) -> c(u(x1))
        s(c(x1)) -> c(s(x1))
        r(c(x1)) -> c(r(x1))
        n(c(x1)) -> c(n(x1))
       KBO Processor:
        weight function:
         w0 = 1
         w(c) = w(u) = w(n) = w(s) = w(r) = 1
        precedence:
         u > s > r > n > c
        problem:
         
        Qed