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