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