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