YES

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

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