YES

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

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