0.00/0.19	YES
0.00/0.20	Input TRS:
0.00/0.20	    1: le(0(),y) -> true()
0.00/0.20	    2: le(s(x),0()) -> false()
0.00/0.20	    3: le(s(x),s(y)) -> le(x,y)
0.00/0.20	    4: pred(s(x)) -> x
0.00/0.20	    5: minus(x,0()) -> x
0.00/0.20	    6: minus(x,s(y)) -> pred(minus(x,y))
0.00/0.20	    7: mod(0(),y) -> 0()
0.00/0.20	    8: mod(s(x),0()) -> 0()
0.00/0.20	    9: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
0.00/0.20	    10: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
0.00/0.20	    11: if_mod(false(),s(x),s(y)) -> s(x)
0.00/0.20	    12: rand(x) ->= x
0.00/0.20	    13: rand(x) ->= rand(s(x))
0.00/0.20	Number of strict rules: 11
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: #minus(x,s(y)) -> #pred(minus(x,y))
0.00/0.20	   #2: #minus(x,s(y)) -> #minus(x,y)
0.00/0.20	   #3: #mod(s(x),s(y)) -> #if_mod(le(y,x),s(x),s(y))
0.00/0.20	   #4: #mod(s(x),s(y)) -> #le(y,x)
0.00/0.20	   #5: #if_mod(true(),s(x),s(y)) -> #mod(minus(x,y),s(y))
0.00/0.20	   #6: #if_mod(true(),s(x),s(y)) -> #minus(x,y)
0.00/0.20	   #7: #le(s(x),s(y)) -> #le(x,y)
0.00/0.20	Number of SCCs: 3, DPs: 4
0.00/0.20	  SCC { #2 }
0.00/0.20	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
0.00/0.20	      le	s: [2,1]	p: 0	w: max(x1 + 4, x2 + 2)
0.00/0.20	      s 	s: [1]	p: 1	w: x1
0.00/0.20	      #le	s: [2]	p: 0	w: max(x2)
0.00/0.20	      minus	s: 1
0.00/0.20	      mod	s: [2,1]	p: 1	w: max(x1 + 2, x2 + 4)
0.00/0.20	      false	s: []	p: 1	w: 1
0.00/0.20	      true	s: []	p: 0	w: 3
0.00/0.20	      pred	s: 1
0.00/0.20	      rand	s: []	p: 0	w: x1 + 1
0.00/0.20	      if_mod	s: [3,2]	p: 1	w: max(x1, x2 + 2, x3 + 4)
0.00/0.20	      0 	s: []	p: 1	w: 0
0.00/0.20	      #minus	s: [2]	p: 0	w: max(x2)
0.00/0.20	      #mod	s: []	p: 0	w: max(x2)
0.00/0.20	      #if_mod	s: [1,2,3]	p: 0	w: max(x1 + 1, x2 + 1, x3 + 1)
0.00/0.20	      #pred	s: []	p: 0	w: 0
0.00/0.20	    Removed DPs: #2
0.00/0.20	Number of SCCs: 2, DPs: 3
0.00/0.20	  SCC { #7 }
0.00/0.20	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
0.00/0.20	      le	s: [2,1]	p: 0	w: max(x1 + 4, x2 + 2)
0.00/0.20	      s 	s: [1]	p: 1	w: x1
0.00/0.20	      #le	s: 2
0.00/0.20	      minus	s: 1
0.00/0.20	      mod	s: [2,1]	p: 1	w: max(x1 + 2, x2 + 4)
0.00/0.20	      false	s: []	p: 1	w: 1
0.00/0.20	      true	s: []	p: 0	w: 3
0.00/0.20	      pred	s: 1
0.00/0.20	      rand	s: []	p: 0	w: x1 + 1
0.00/0.20	      if_mod	s: [3,2]	p: 1	w: max(x1, x2 + 2, x3 + 4)
0.00/0.20	      0 	s: []	p: 1	w: 0
0.00/0.20	      #minus	s: [2]	p: 0	w: max(x2)
0.00/0.20	      #mod	s: []	p: 0	w: max(x2)
0.00/0.20	      #if_mod	s: [1,2,3]	p: 0	w: max(x1 + 1, x2 + 1, x3 + 1)
0.00/0.20	      #pred	s: []	p: 0	w: 0
0.00/0.20	    Removed DPs: #7
0.00/0.20	Number of SCCs: 1, DPs: 2
0.00/0.20	  SCC { #3 #5 }
0.00/0.20	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
0.00/0.20	      le	s: [2]	p: 0	w: max(x1 + 4, x2 + 2)
0.00/0.20	      s 	s: [1]	p: 1	w: x1
0.00/0.20	      #le	s: 2
0.00/0.20	      minus	s: 1
0.00/0.20	      mod	s: [2,1]	p: 1	w: max(x1 + 2, x2 + 4)
0.00/0.20	      false	s: []	p: 1	w: 1
0.00/0.20	      true	s: []	p: 0	w: 3
0.00/0.20	      pred	s: 1
0.00/0.20	      rand	s: []	p: 0	w: x1 + 1
0.00/0.20	      if_mod	s: [3,2]	p: 1	w: max(x1, x2 + 2, x3 + 4)
0.00/0.20	      0 	s: []	p: 1	w: 0
0.00/0.20	      #minus	s: [2]	p: 0	w: max(x2)
0.00/0.20	      #mod	s: 1
0.00/0.20	      #if_mod	s: 2
0.00/0.20	      #pred	s: []	p: 0	w: 0
0.00/0.20	    Removed DPs: #5
0.00/0.20	Number of SCCs: 0, DPs: 0
0.00/0.20	EOF