YES
Input TRS:
      1: a(a(x1)) -> a(b(a(x1)))
      2: b(a(b(x1))) -> a(c(a(x1)))
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #b(a(b(x1))) -> #a(c(a(x1)))
     #2: #b(a(b(x1))) -> #a(x1)
     #3: #a(a(x1)) -> #a(b(a(x1)))
     #4: #a(a(x1)) -> #b(a(x1))
Number of SCCs: 1, DPs: 3
  SCC { #2..4 }
POLO(Sum)... succeeded.
      a 	w: x1 + 21240
      b 	w: x1
      c 	w: 0
      #a 	w: x1 + 21239
      #b 	w: x1
    USABLE RULES: { 1 2 }
    Removed DPs: #2 #4
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [1,0;1,0] * x1 + [33753;1]
      b 	w: [0,1;1,1] * x1 + [33751;1]
      c 	w: [0,0;1,1] * x1 + [10110;0]
      #a 	w: [1,0;1,0] * x1
      #b 	w: [0;0]
    USABLE RULES: { 1 2 }
    Removed DPs: #3
Number of SCCs: 0, DPs: 0