0.00/0.09	YES
0.00/0.09	Input TRS:
0.00/0.09	    1: minus(x,0()) -> x
0.00/0.09	    2: minus(s(x),s(y)) -> minus(x,y)
0.00/0.09	    3: f(0()) -> s(0())
0.00/0.09	    4: f(s(x)) -> minus(s(x),g(f(x)))
0.00/0.09	    5: g(0()) -> 0()
0.00/0.09	    6: g(s(x)) -> minus(s(x),f(g(x)))
0.00/0.09	    7: rand(x) ->= x
0.00/0.09	    8: rand(x) ->= rand(s(x))
0.00/0.09	Number of strict rules: 6
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: #minus(s(x),s(y)) -> #minus(x,y)
0.00/0.09	   #2: #g(s(x)) -> #minus(s(x),f(g(x)))
0.00/0.09	   #3: #g(s(x)) -> #f(g(x))
0.00/0.09	   #4: #g(s(x)) -> #g(x)
0.00/0.09	   #5: #f(s(x)) -> #minus(s(x),g(f(x)))
0.00/0.09	   #6: #f(s(x)) -> #g(f(x))
0.00/0.09	   #7: #f(s(x)) -> #f(x)
0.00/0.09	Number of SCCs: 2, DPs: 5
0.00/0.09	  SCC { #1 }
0.00/0.09	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
0.00/0.09	      s 	s: [1]	p: 1	w: x1
0.00/0.09	      minus	s: [1]	p: 0	w: max(x1 + 1)
0.00/0.09	      f 	s: [1]	p: 3	w: x1 + 2
0.00/0.09	      rand	s: []	p: 0	w: x1 + 1
0.00/0.09	      0 	s: []	p: 4	w: 1
0.00/0.09	      #f 	s: []	p: 0	w: 0
0.00/0.09	      #g 	s: []	p: 0	w: 0
0.00/0.09	      #minus	s: [2]	p: 1	w: max(x2 + 1)
0.00/0.09	      g 	s: []	p: 2	w: x1 + 2
0.00/0.09	    Removed DPs: #1
0.00/0.09	Number of SCCs: 1, DPs: 4
0.00/0.09	  SCC { #3 #4 #6 #7 }
0.00/0.09	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
0.00/0.09	      s 	s: [1]	p: 2	w: x1
0.00/0.09	      minus	s: [1]	p: 0	w: max(x1)
0.00/0.09	      f 	s: [1]	p: 2	w: x1
0.00/0.09	      rand	s: []	p: 0	w: x1 + 1
0.00/0.09	      0 	s: []	p: 3	w: 1
0.00/0.09	      #f 	s: 1
0.00/0.09	      #g 	s: 1
0.00/0.09	      #minus	s: [2]	p: 1	w: max(x2 + 1)
0.00/0.09	      g 	s: [1]	p: 1	w: x1
0.00/0.09	    Removed DPs: #3 #4 #7
0.00/0.09	Number of SCCs: 0, DPs: 0
0.00/0.09	EOF