MAYBE
Input TRS:
      1: a(b(x1)) -> c(b(x1))
      2: c(c(x1)) -> d(b(x1))
      3: d(x1) -> c(e(x1))
      4: b(b(x1)) -> f(x1)
      5: c(b(x1)) -> g(x1)
      6: e(x1) -> f(x1)
      7: e(x1) -> b(b(x1))
      8: f(g(x1)) -> a(c(x1))
      9: g(f(x1)) -> e(x1)
      10: a(x1) -> b(c(x1))
Number of strict rules: 10
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #c(c(x1)) -> #d(b(x1))
     #2: #c(c(x1)) -> #b(x1)
     #3: #e(x1) -> #f(x1)
     #4: #g(f(x1)) -> #e(x1)
     #5: #e(x1) -> #b(b(x1))
     #6: #e(x1) -> #b(x1)
     #7: #a(x1) -> #b(c(x1))
     #8: #a(x1) -> #c(x1)
     #9: #c(b(x1)) -> #g(x1)
     #10: #d(x1) -> #c(e(x1))
     #11: #d(x1) -> #e(x1)
     #12: #a(b(x1)) -> #c(b(x1))
     #13: #f(g(x1)) -> #a(c(x1))
     #14: #f(g(x1)) -> #c(x1)
     #15: #b(b(x1)) -> #f(x1)
Number of SCCs: 1, DPs: 15
  SCC { #1..15 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.