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