YES
Input TRS:
      1: f(0(),1(),x) -> f(s(x),x,x)
      2: f(x,y,s(z)) -> s(f(0(),1(),z))
      3: rand(x) ->= x
      4: rand(x) ->= rand(s(x))
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(x,y,s(z)) -> #f(0(),1(),z)
     #2: #f(0(),1(),x) -> #f(s(x),x,x)
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      1 	s: []	p: 0	w: 0
      s 	s: [1]	p: 1	w: x1
      f 	s: 3
      rand	s: []	p: 0	w: x1 + 1
      0 	s: []	p: 2	w: 1
      #f 	s: 3
    Removed DPs: #1
Number of SCCs: 0, DPs: 0