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