0.00/0.20	MAYBE
0.00/0.20	Input TRS:
0.00/0.20	    1: b(d(b(x1))) -> c(d(b(x1)))
0.00/0.20	    2: b(a(c(x1))) -> b(c(x1))
0.00/0.20	    3: a(d(x1)) -> d(c(x1))
0.00/0.20	    4: b(b(b(x1))) -> a(b(c(x1)))
0.00/0.20	    5: d(c(x1)) -> b(d(x1))
0.00/0.20	    6: d(c(x1)) -> d(b(d(x1)))
0.00/0.20	    7: d(a(c(x1))) -> b(b(x1))
0.00/0.20	Number of strict rules: 7
0.00/0.20	Direct POLO(bPol) ... removes: 2
0.00/0.20	      a 	w: 2 * x1 + 1
0.00/0.20	      d 	w: x1
0.00/0.20	      b 	w: 2 * x1 + 1
0.00/0.20	      c 	w: 2 * x1 + 1
0.00/0.20	Number of strict rules: 6
0.00/0.20	Direct POLO(bPol) ... failed.
0.00/0.20	Uncurrying ... failed.
0.00/0.20	Dependency Pairs:
0.00/0.20	   #1: #d(c(x1)) -> #d(b(d(x1)))
0.00/0.20	   #2: #d(c(x1)) -> #b(d(x1))
0.00/0.20	   #3: #d(c(x1)) -> #d(x1)
0.00/0.20	   #4: #d(a(c(x1))) -> #b(b(x1))
0.00/0.20	   #5: #d(a(c(x1))) -> #b(x1)
0.00/0.20	   #6: #d(c(x1)) -> #b(d(x1))
0.00/0.20	   #7: #d(c(x1)) -> #d(x1)
0.00/0.20	   #8: #a(d(x1)) -> #d(c(x1))
0.00/0.20	   #9: #b(b(b(x1))) -> #a(b(c(x1)))
0.00/0.20	   #10: #b(b(b(x1))) -> #b(c(x1))
0.00/0.20	Number of SCCs: 1, DPs: 3
0.00/0.20	  SCC { #1 #3 #7 }
0.00/0.20	POLO(Sum)... succeeded.
0.00/0.20	      a 	w: x1 + 1
0.00/0.20	      d 	w: x1
0.00/0.20	      b 	w: x1 + 1
0.00/0.20	      c 	w: x1 + 1
0.00/0.20	      #d 	w: x1
0.00/0.20	      #a 	w: 0
0.00/0.20	      #b 	w: 0
0.00/0.20	    USABLE RULES: { 1 3..7 }
0.00/0.20	    Removed DPs: #3 #7
0.00/0.20	Number of SCCs: 1, DPs: 1
0.00/0.20	  SCC { #1 }
0.00/0.20	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.20	Finding a loop...  failed.
0.00/0.20	EOF