YES

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

Proof:
 DP Processor:
  DPs:
   a#(c(x1)) -> b#(c(c(x1)))
   b#(c(x1)) -> b#(x1)
   b#(c(x1)) -> a#(b(x1))
  TRS:
   a(b(x1)) -> x1
   a(c(x1)) -> c(b(c(c(x1))))
   b(c(x1)) -> a(b(x1))
  TDG Processor:
   DPs:
    a#(c(x1)) -> b#(c(c(x1)))
    b#(c(x1)) -> b#(x1)
    b#(c(x1)) -> a#(b(x1))
   TRS:
    a(b(x1)) -> x1
    a(c(x1)) -> c(b(c(c(x1))))
    b(c(x1)) -> a(b(x1))
   graph:
    b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> a#(b(x1))
    b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> b#(x1)
    b#(c(x1)) -> a#(b(x1)) -> a#(c(x1)) -> b#(c(c(x1)))
    a#(c(x1)) -> b#(c(c(x1))) -> b#(c(x1)) -> a#(b(x1))
    a#(c(x1)) -> b#(c(c(x1))) -> b#(c(x1)) -> b#(x1)
   Arctic Interpretation Processor:
    dimension: 1
    usable rules:
     a(b(x1)) -> x1
     a(c(x1)) -> c(b(c(c(x1))))
     b(c(x1)) -> a(b(x1))
    interpretation:
     [b#](x0) = -8x0 + 6,
     
     [a#](x0) = x0 + -16,
     
     [c](x0) = 4x0 + 8,
     
     [a](x0) = 4x0 + 0,
     
     [b](x0) = -4x0 + 0
    orientation:
     a#(c(x1)) = 4x1 + 8 >= x1 + 6 = b#(c(c(x1)))
     
     b#(c(x1)) = -4x1 + 6 >= -8x1 + 6 = b#(x1)
     
     b#(c(x1)) = -4x1 + 6 >= -4x1 + 0 = a#(b(x1))
     
     a(b(x1)) = x1 + 4 >= x1 = x1
     
     a(c(x1)) = 8x1 + 12 >= 8x1 + 12 = c(b(c(c(x1))))
     
     b(c(x1)) = x1 + 4 >= x1 + 4 = a(b(x1))
    problem:
     DPs:
      b#(c(x1)) -> b#(x1)
      b#(c(x1)) -> a#(b(x1))
     TRS:
      a(b(x1)) -> x1
      a(c(x1)) -> c(b(c(c(x1))))
      b(c(x1)) -> a(b(x1))
    Restore Modifier:
     DPs:
      b#(c(x1)) -> b#(x1)
      b#(c(x1)) -> a#(b(x1))
     TRS:
      a(b(x1)) -> x1
      a(c(x1)) -> c(b(c(c(x1))))
      b(c(x1)) -> a(b(x1))
     EDG Processor:
      DPs:
       b#(c(x1)) -> b#(x1)
       b#(c(x1)) -> a#(b(x1))
      TRS:
       a(b(x1)) -> x1
       a(c(x1)) -> c(b(c(c(x1))))
       b(c(x1)) -> a(b(x1))
      graph:
       b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> b#(x1)
       b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> a#(b(x1))
      CDG Processor:
       DPs:
        b#(c(x1)) -> b#(x1)
        b#(c(x1)) -> a#(b(x1))
       TRS:
        a(b(x1)) -> x1
        a(c(x1)) -> c(b(c(c(x1))))
        b(c(x1)) -> a(b(x1))
       graph:
        
       Qed