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