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