YES

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

Proof:
 DP Processor:
  DPs:
   a#(c(x1)) -> a#(x1)
   a#(c(x1)) -> a#(a(x1))
   a#(c(x1)) -> b#(a(a(x1)))
   a#(c(x1)) -> b#(c(c(b(a(a(x1))))))
  TRS:
   a(b(x1)) -> x1
   a(c(x1)) -> b(c(c(b(a(a(x1))))))
   b(c(x1)) -> x1
  Matrix Interpretation Processor: dim=1
   
   usable rules:
    a(b(x1)) -> x1
    a(c(x1)) -> b(c(c(b(a(a(x1))))))
    b(c(x1)) -> x1
   interpretation:
    [b#](x0) = 0,
    
    [a#](x0) = 1/2x0,
    
    [c](x0) = 2x0 + 1/2,
    
    [a](x0) = 2x0,
    
    [b](x0) = 1/2x0
   orientation:
    a#(c(x1)) = x1 + 1/4 >= 1/2x1 = a#(x1)
    
    a#(c(x1)) = x1 + 1/4 >= x1 = a#(a(x1))
    
    a#(c(x1)) = x1 + 1/4 >= 0 = b#(a(a(x1)))
    
    a#(c(x1)) = x1 + 1/4 >= 0 = b#(c(c(b(a(a(x1))))))
    
    a(b(x1)) = x1 >= x1 = x1
    
    a(c(x1)) = 4x1 + 1 >= 4x1 + 3/4 = b(c(c(b(a(a(x1))))))
    
    b(c(x1)) = x1 + 1/4 >= x1 = x1
   problem:
    DPs:
     
    TRS:
     a(b(x1)) -> x1
     a(c(x1)) -> b(c(c(b(a(a(x1))))))
     b(c(x1)) -> x1
   Qed