MAYBE
Input TRS:
      1: a(a(b(b(x1)))) -> b(b(b(a(a(a(x1))))))
      2: a(c(x1)) -> c(a(x1))
      3: b(c(x1)) -> c(b(x1))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #a(c(x1)) -> #a(x1)
     #2: #b(c(x1)) -> #b(x1)
     #3: #a(a(b(b(x1)))) -> #b(b(b(a(a(a(x1))))))
     #4: #a(a(b(b(x1)))) -> #b(b(a(a(a(x1)))))
     #5: #a(a(b(b(x1)))) -> #b(a(a(a(x1))))
     #6: #a(a(b(b(x1)))) -> #a(a(a(x1)))
     #7: #a(a(b(b(x1)))) -> #a(a(x1))
     #8: #a(a(b(b(x1)))) -> #a(x1)
Number of SCCs: 2, DPs: 5
  SCC { #2 }
POLO(Sum)... succeeded.
      a 	w: 0
      b 	w: 0
      c 	w: x1 + 1
      #a 	w: 0
      #b 	w: x1
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 4
  SCC { #1 #6..8 }
POLO(Sum)... succeeded.
      a 	w: x1
      b 	w: x1
      c 	w: x1 + 1
      #a 	w: x1
      #b 	w: 0
    USABLE RULES: { 1..3 }
    Removed DPs: #1
Number of SCCs: 1, DPs: 3
  SCC { #6..8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.