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