0.00/0.31	MAYBE
0.00/0.31	Input TRS:
0.00/0.31	    1: minus(x,0()) -> x
0.00/0.31	    2: minus(s(x),s(y)) -> minus(x,y)
0.00/0.31	    3: quot(0(),s(y)) -> 0()
0.00/0.31	    4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
0.00/0.31	    5: plus(0(),y) -> y
0.00/0.31	    6: plus(s(x),y) -> s(plus(x,y))
0.00/0.31	    7: plus(minus(x,s(0())),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0())))
0.00/0.31	    8: plus(plus(x,s(0())),plus(y,s(s(z)))) -> plus(plus(y,s(s(z))),plus(x,s(0())))
0.00/0.31	    9: rand(x) ->= x
0.00/0.31	    10: rand(x) ->= rand(s(x))
0.00/0.31	Number of strict rules: 8
0.00/0.31	Direct POLO(bPol) ... failed.
0.00/0.31	Uncurrying ... failed.
0.00/0.31	Dependency Pairs:
0.00/0.31	   #1: #minus(s(x),s(y)) -> #minus(x,y)
0.00/0.31	   #2: #plus(s(x),y) -> #plus(x,y)
0.00/0.31	   #3: #plus(minus(x,s(0())),minus(y,s(s(z)))) -> #plus(minus(y,s(s(z))),minus(x,s(0())))
0.00/0.31	   #4: #plus(plus(x,s(0())),plus(y,s(s(z)))) -> #plus(plus(y,s(s(z))),plus(x,s(0())))
0.00/0.31	   #5: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y))
0.00/0.31	   #6: #quot(s(x),s(y)) -> #minus(x,y)
0.00/0.31	Number of SCCs: 3, DPs: 5
0.00/0.31	  SCC { #1 }
0.00/0.31	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.31	Finding a loop...  failed.
0.00/0.31	EOF