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