YES

DP problem for innermost termination.
P =
  f3#(x1, x2) -> f1#(x1, x2) 
R = 
  f3(x1, x2) -> f1(x1, x2) 
  f1(I0, I1) -> f2(5, 5) [5 <= 0]

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

We have the following SCCs.