YES

DP problem for innermost termination.
P =
  f3#(x1) -> f1#(x1) 
R = 
  f3(x1) -> f1(x1) 
  f1(I0) -> f2(rnd1) [y1 = y1 /\ rnd1 = rnd1]

The dependency graph for this problem is:
  0 -> 
Where:
  0) f3#(x1) -> f1#(x1) 

We have the following SCCs.