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