YES

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

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