MAYBE
Input TRS:
      1: b(c(a(x1))) -> d(d(x1))
      2: b(x1) -> c(c(x1))
      3: a(a(x1)) -> a(x1)
      4: a(b(x1)) ->= d(x1)
      5: d(x1) ->= a(b(x1))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #d(x1) ->? #a(b(x1))
     #2: #d(x1) ->? #b(x1)
     #3: #b(c(a(x1))) -> #d(d(x1))
     #4: #b(c(a(x1))) -> #d(x1)
     #5: #a(b(x1)) ->? #d(x1)
Number of SCCs: 1, DPs: 5
  SCC { #1..5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [0,0;1,1] * x1
      d 	w: [0,0;1,0] * x1 + [0;28778]
      b 	w: [0,0;1,0] * x1 + [28777;1]
      c 	w: [0,1;0,0] * x1 + [28777;0]
      #d 	w: [1,0;1,0] * x1 + [1;28778]
      #a 	w: [0,1;1,1] * x1
      #b 	w: [1,0;1,0] * x1 + [0;28778]
    USABLE RULES: { 1..5 }
    Removed DPs: #2..4
Number of SCCs: 1, DPs: 2
  SCC { #1 #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.