0.00/0.26	MAYBE
0.00/0.27	Input TRS:
0.00/0.27	    1: a(c(x1)) -> c(b(c(c(a(x1)))))
0.00/0.27	    2: b(b(b(x1))) -> c(b(x1))
0.00/0.27	    3: d(d(x1)) -> d(b(d(b(d(x1)))))
0.00/0.27	    4: a(a(x1)) -> a(d(a(x1)))
0.00/0.27	    5: a(b(x1)) -> c(c(a(x1)))
0.00/0.27	    6: c(c(x1)) -> c(b(c(b(c(x1)))))
0.00/0.27	    7: c(c(c(x1))) -> c(b(b(x1)))
0.00/0.27	Number of strict rules: 7
0.00/0.27	Direct POLO(bPol) ... failed.
0.00/0.27	Uncurrying ... failed.
0.00/0.27	Dependency Pairs:
0.00/0.27	   #1: #b(b(b(x1))) -> #c(b(x1))
0.00/0.27	   #2: #c(c(x1)) -> #c(b(c(b(c(x1)))))
0.00/0.27	   #3: #c(c(x1)) -> #b(c(b(c(x1))))
0.00/0.27	   #4: #c(c(x1)) -> #c(b(c(x1)))
0.00/0.27	   #5: #c(c(x1)) -> #b(c(x1))
0.00/0.27	   #6: #c(c(c(x1))) -> #c(b(b(x1)))
0.00/0.27	   #7: #c(c(c(x1))) -> #b(b(x1))
0.00/0.27	   #8: #c(c(c(x1))) -> #b(x1)
0.00/0.27	   #9: #a(b(x1)) -> #c(c(a(x1)))
0.00/0.27	   #10: #a(b(x1)) -> #c(a(x1))
0.00/0.27	   #11: #a(b(x1)) -> #a(x1)
0.00/0.27	   #12: #d(d(x1)) -> #d(b(d(b(d(x1)))))
0.00/0.27	   #13: #d(d(x1)) -> #b(d(b(d(x1))))
0.00/0.27	   #14: #d(d(x1)) -> #d(b(d(x1)))
0.00/0.27	   #15: #d(d(x1)) -> #b(d(x1))
0.00/0.27	   #16: #a(c(x1)) -> #c(b(c(c(a(x1)))))
0.00/0.27	   #17: #a(c(x1)) -> #b(c(c(a(x1))))
0.00/0.27	   #18: #a(c(x1)) -> #c(c(a(x1)))
0.00/0.27	   #19: #a(c(x1)) -> #c(a(x1))
0.00/0.27	   #20: #a(c(x1)) -> #a(x1)
0.00/0.27	   #21: #a(a(x1)) -> #a(d(a(x1)))
0.03/0.27	   #22: #a(a(x1)) -> #d(a(x1))
0.03/0.27	Number of SCCs: 2, DPs: 6
0.03/0.27	  SCC { #11 #20 }
0.03/0.27	POLO(Sum)... succeeded.
0.03/0.27	      a 	w: 0
0.03/0.27	      d 	w: 0
0.03/0.27	      b 	w: x1 + 1
0.03/0.27	      c 	w: x1 + 1
0.03/0.27	      #d 	w: 0
0.03/0.27	      #c 	w: 0
0.03/0.27	      #a 	w: x1
0.03/0.27	      #b 	w: 0
0.03/0.27	    USABLE RULES: { }
0.03/0.27	    Removed DPs: #11 #20
0.03/0.27	Number of SCCs: 1, DPs: 4
0.03/0.27	  SCC { #1 #6..8 }
0.03/0.27	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.03/0.27	Finding a loop...  failed.
0.03/0.27	EOF