YES

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

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