MAYBE
Input TRS:
      1: a(a(b(b(a(a(x1)))))) -> a(a(b(b(b(b(a(a(x1))))))))
      2: b(b(a(a(b(b(x1)))))) -> b(b(a(a(a(a(b(b(x1))))))))
      3: a(a(x1)) ->= a(a(a(a(a(a(x1))))))
      4: b(b(x1)) ->= b(b(b(b(b(b(x1))))))
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #b(b(a(a(b(b(x1)))))) -> #b(b(a(a(a(a(b(b(x1))))))))
     #2: #b(b(a(a(b(b(x1)))))) -> #b(a(a(a(a(b(b(x1)))))))
     #3: #b(b(a(a(b(b(x1)))))) -> #a(a(a(a(b(b(x1))))))
     #4: #b(b(a(a(b(b(x1)))))) -> #a(a(a(b(b(x1)))))
     #5: #a(a(x1)) ->? #a(a(a(a(a(a(x1))))))
     #6: #a(a(x1)) ->? #a(a(a(a(a(x1)))))
     #7: #a(a(x1)) ->? #a(a(a(a(x1))))
     #8: #a(a(x1)) ->? #a(a(a(x1)))
     #9: #a(a(x1)) ->? #a(a(x1))
     #10: #a(a(b(b(a(a(x1)))))) -> #a(a(b(b(b(b(a(a(x1))))))))
     #11: #a(a(b(b(a(a(x1)))))) -> #a(b(b(b(b(a(a(x1)))))))
     #12: #a(a(b(b(a(a(x1)))))) -> #b(b(b(b(a(a(x1))))))
     #13: #a(a(b(b(a(a(x1)))))) -> #b(b(b(a(a(x1)))))
     #14: #b(b(x1)) ->? #b(b(b(b(b(b(x1))))))
     #15: #b(b(x1)) ->? #b(b(b(b(b(x1)))))
     #16: #b(b(x1)) ->? #b(b(b(b(x1))))
     #17: #b(b(x1)) ->? #b(b(b(x1)))
     #18: #b(b(x1)) ->? #b(b(x1))
Number of SCCs: 1, DPs: 16
  SCC { #1 #3..10 #12..18 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: 72942
      b 	w: max(x1 - 40654, 0)
      #a 	w: 32286
      #b 	w: max(x1 - 1, 0)
    USABLE RULES: { 1..4 }
    Removed DPs: #3 #4 #12 #13
Number of SCCs: 2, DPs: 12
  SCC { #5..10 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.