YES

DP problem for innermost termination.
P =
  f3# -> f1# [0 <= 0]
R = 
  f3 -> f1 [0 <= 0]
  f1 -> f2 [2 <= 0]

The dependency graph for this problem is:
  0 -> 
Where:
  0) f3# -> f1# [0 <= 0]

We have the following SCCs.