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
  TDG 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
   graph:
    a#(c(x1)) -> a#(a(x1)) -> a#(c(x1)) -> b#(c(c(b(a(a(x1))))))
    a#(c(x1)) -> a#(a(x1)) -> a#(c(x1)) -> b#(a(a(x1)))
    a#(c(x1)) -> a#(a(x1)) -> a#(c(x1)) -> a#(a(x1))
    a#(c(x1)) -> a#(a(x1)) -> a#(c(x1)) -> a#(x1)
    a#(c(x1)) -> a#(x1) -> a#(c(x1)) -> b#(c(c(b(a(a(x1))))))
    a#(c(x1)) -> a#(x1) -> a#(c(x1)) -> b#(a(a(x1)))
    a#(c(x1)) -> a#(x1) -> a#(c(x1)) -> a#(a(x1))
    a#(c(x1)) -> a#(x1) -> a#(c(x1)) -> a#(x1)
   SCC Processor:
    #sccs: 1
    #rules: 2
    #arcs: 8/16
    DPs:
     a#(c(x1)) -> a#(a(x1))
     a#(c(x1)) -> 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
     
     interpretation:
      [a#](x0) = 6x0 + 2,
      
      [c](x0) = 2x0 + 6,
      
      [a](x0) = 2x0,
      
      [b](x0) = 1/2x0 + 1
     orientation:
      a#(c(x1)) = 12x1 + 38 >= 12x1 + 2 = a#(a(x1))
      
      a#(c(x1)) = 12x1 + 38 >= 6x1 + 2 = a#(x1)
      
      a(b(x1)) = x1 + 2 >= x1 = x1
      
      a(c(x1)) = 4x1 + 12 >= 4x1 + 12 = b(c(c(b(a(a(x1))))))
      
      b(c(x1)) = x1 + 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