YES
Input TRS:
      1: tests(0()) -> true()
      2: tests(s(x)) -> and(test(rands(rand(0()),nil())),x)
      3: test(done(y)) -> eq(f(y),g(y))
      4: eq(x,x) -> true()
      5: rands(0(),y) -> done(y)
      6: rands(s(x),y) -> rands(x,::(rand(0()),y))
      7: rand(x) ->= x
      8: rand(x) ->= rand(s(x))
Number of strict rules: 6
Direct POLO(bPol) ... removes: 4 1 3 5 2
      rands	w: x1 + x2 + 21657
      tests	w: x1 + 234323
      test	w: 2 * x1 + 31893
      s 	w: x1
      done	w: x1 + 1
      and	w: 2 * x1 + x2
      eq	w: x1 + x2 + 1
      ::	w: x1 + x2
      true	w: 0
      rand	w: x1
      f 	w: x1 + 1
      0 	w: 0
      nil	w: 20977
      g 	w: x1 + 31892
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #rands(s(x),y) -> #rands(x,::(rand(0()),y))
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      rands	s: []	p: 3	w: 4
      tests	s: []	p: 0	w: 1
      test	s: []	p: 0	w: 1
      s 	s: [1]	p: 1	w: x1
      done	s: []	p: 0	w: 1
      and	s: [1]	p: 0	w: x1 + 1
      eq	s: []	p: 0	w: x2 + 1
      ::	s: [1]	p: 2	w: x1 + 1
      true	s: []	p: 0	w: 0
      rand	s: []	p: 1	w: x1 + 1
      f 	s: []	p: 0	w: 1
      #rands	s: 1
      0 	s: []	p: 4	w: 1
      nil	s: []	p: 0	w: 0
      g 	s: []	p: 0	w: 1
    Removed DPs: #1
Number of SCCs: 0, DPs: 0