YES(?,O(n^1))

Problem:
 a(a(a(x1))) -> b(b(x1))
 b(b(b(x1))) -> c(d(x1))
 c(x1) -> a(a(x1))
 d(x1) -> c(x1)

Proof:
 RT Transformation Processor:
  strict:
   a(a(a(x1))) -> b(b(x1))
   b(b(b(x1))) -> c(d(x1))
   c(x1) -> a(a(x1))
   d(x1) -> c(x1)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 2,
    
    [d](x0) = x0 + 2,
    
    [b](x0) = x0 + 12,
    
    [a](x0) = x0 + 10
   orientation:
    a(a(a(x1))) = x1 + 30 >= x1 + 24 = b(b(x1))
    
    b(b(b(x1))) = x1 + 36 >= x1 + 4 = c(d(x1))
    
    c(x1) = x1 + 2 >= x1 + 20 = a(a(x1))
    
    d(x1) = x1 + 2 >= x1 + 2 = c(x1)
   problem:
    strict:
     c(x1) -> a(a(x1))
     d(x1) -> c(x1)
    weak:
     a(a(a(x1))) -> b(b(x1))
     b(b(b(x1))) -> c(d(x1))
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0,
     
     [d](x0) = x0 + 1,
     
     [b](x0) = x0 + 1,
     
     [a](x0) = x0 + 6
    orientation:
     c(x1) = x1 >= x1 + 12 = a(a(x1))
     
     d(x1) = x1 + 1 >= x1 = c(x1)
     
     a(a(a(x1))) = x1 + 18 >= x1 + 2 = b(b(x1))
     
     b(b(b(x1))) = x1 + 3 >= x1 + 1 = c(d(x1))
    problem:
     strict:
      c(x1) -> a(a(x1))
     weak:
      d(x1) -> c(x1)
      a(a(a(x1))) -> b(b(x1))
      b(b(b(x1))) -> c(d(x1))
    Matrix Interpretation Processor:
     dimension: 1
     interpretation:
      [c](x0) = x0 + 9,
      
      [d](x0) = x0 + 9,
      
      [b](x0) = x0 + 6,
      
      [a](x0) = x0 + 4
     orientation:
      c(x1) = x1 + 9 >= x1 + 8 = a(a(x1))
      
      d(x1) = x1 + 9 >= x1 + 9 = c(x1)
      
      a(a(a(x1))) = x1 + 12 >= x1 + 12 = b(b(x1))
      
      b(b(b(x1))) = x1 + 18 >= x1 + 18 = c(d(x1))
     problem:
      strict:
       
      weak:
       c(x1) -> a(a(x1))
       d(x1) -> c(x1)
       a(a(a(x1))) -> b(b(x1))
       b(b(b(x1))) -> c(d(x1))
     Qed