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