/export/starexec/sandbox/solver/bin/starexec_run_Transition /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

DP problem for innermost termination.
P =
  f5#(x1, x2, x3, x4, x5) -> f1#(x1, x2, x3, x4, x5) 
R = 
  f5(x1, x2, x3, x4, x5) -> f1(x1, x2, x3, x4, x5) 
  f3(I0, I1, I2, I3, I4) -> f4(I0, I1, I2, I3, I4) 
  f1(I5, I6, I7, I8, I9) -> f2(1, I7, I7, I7, 1) [0 <= -1 + I7 /\ 0 <= I7]

The dependency graph for this problem is:
  0 -> 
Where:
  0) f5#(x1, x2, x3, x4, x5) -> f1#(x1, x2, x3, x4, x5) 

We have the following SCCs.