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