YES

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

Proof:
 DP Processor:
  DPs:
   a#(x1) -> c#(x1)
   a#(x1) -> b#(c(x1))
   c#(c(b(x1))) -> c#(x1)
   c#(c(b(x1))) -> a#(c(x1))
   c#(c(b(x1))) -> a#(a(c(x1)))
  TRS:
   a(x1) -> b(c(x1))
   b(b(x1)) -> x1
   c(c(b(x1))) -> a(a(c(x1)))
  TDG Processor:
   DPs:
    a#(x1) -> c#(x1)
    a#(x1) -> b#(c(x1))
    c#(c(b(x1))) -> c#(x1)
    c#(c(b(x1))) -> a#(c(x1))
    c#(c(b(x1))) -> a#(a(c(x1)))
   TRS:
    a(x1) -> b(c(x1))
    b(b(x1)) -> x1
    c(c(b(x1))) -> a(a(c(x1)))
   graph:
    c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> a#(a(c(x1)))
    c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> a#(c(x1))
    c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> c#(x1)
    c#(c(b(x1))) -> a#(c(x1)) -> a#(x1) -> b#(c(x1))
    c#(c(b(x1))) -> a#(c(x1)) -> a#(x1) -> c#(x1)
    c#(c(b(x1))) -> a#(a(c(x1))) -> a#(x1) -> b#(c(x1))
    c#(c(b(x1))) -> a#(a(c(x1))) -> a#(x1) -> c#(x1)
    a#(x1) -> c#(x1) -> c#(c(b(x1))) -> a#(a(c(x1)))
    a#(x1) -> c#(x1) -> c#(c(b(x1))) -> a#(c(x1))
    a#(x1) -> c#(x1) -> c#(c(b(x1))) -> c#(x1)
   SCC Processor:
    #sccs: 1
    #rules: 4
    #arcs: 10/25
    DPs:
     c#(c(b(x1))) -> c#(x1)
     c#(c(b(x1))) -> a#(c(x1))
     a#(x1) -> c#(x1)
     c#(c(b(x1))) -> a#(a(c(x1)))
    TRS:
     a(x1) -> b(c(x1))
     b(b(x1)) -> x1
     c(c(b(x1))) -> a(a(c(x1)))
    Arctic Interpretation Processor:
     dimension: 2
     usable rules:
      a(x1) -> b(c(x1))
      b(b(x1)) -> x1
      c(c(b(x1))) -> a(a(c(x1)))
     interpretation:
      [c#](x0) = [0 3]x0 + [0],
      
      [a#](x0) = [1 3]x0 + [0],
      
                [1  0 ]     [2]
      [b](x0) = [0  -&]x0 + [1],
      
                [-& 0 ]     [0]
      [c](x0) = [0  -&]x0 + [0],
      
                [0  1 ]     [2]
      [a](x0) = [-& 0 ]x0 + [1]
     orientation:
      c#(c(b(x1))) = [4 3]x1 + [5] >= [0 3]x1 + [0] = c#(x1)
      
      c#(c(b(x1))) = [4 3]x1 + [5] >= [3 1]x1 + [3] = a#(c(x1))
      
      a#(x1) = [1 3]x1 + [0] >= [0 3]x1 + [0] = c#(x1)
      
      c#(c(b(x1))) = [4 3]x1 + [5] >= [3 1]x1 + [4] = a#(a(c(x1)))
      
              [0  1 ]     [2]    [0  1 ]     [2]           
      a(x1) = [-& 0 ]x1 + [1] >= [-& 0 ]x1 + [1] = b(c(x1))
      
                 [2 1]     [3]           
      b(b(x1)) = [1 0]x1 + [2] >= x1 = x1
      
                    [1  0 ]     [2]    [1  0 ]     [2]              
      c(c(b(x1))) = [0  -&]x1 + [1] >= [0  -&]x1 + [1] = a(a(c(x1)))
     problem:
      DPs:
       c#(c(b(x1))) -> c#(x1)
       a#(x1) -> c#(x1)
      TRS:
       a(x1) -> b(c(x1))
       b(b(x1)) -> x1
       c(c(b(x1))) -> a(a(c(x1)))
     Restore Modifier:
      DPs:
       c#(c(b(x1))) -> c#(x1)
       a#(x1) -> c#(x1)
      TRS:
       a(x1) -> b(c(x1))
       b(b(x1)) -> x1
       c(c(b(x1))) -> a(a(c(x1)))
      EDG Processor:
       DPs:
        c#(c(b(x1))) -> c#(x1)
        a#(x1) -> c#(x1)
       TRS:
        a(x1) -> b(c(x1))
        b(b(x1)) -> x1
        c(c(b(x1))) -> a(a(c(x1)))
       graph:
        c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> c#(x1)
        a#(x1) -> c#(x1) -> c#(c(b(x1))) -> c#(x1)
       CDG Processor:
        DPs:
         c#(c(b(x1))) -> c#(x1)
         a#(x1) -> c#(x1)
        TRS:
         a(x1) -> b(c(x1))
         b(b(x1)) -> x1
         c(c(b(x1))) -> a(a(c(x1)))
        graph:
         
        Qed