0.00/0.15 MAYBE 0.00/0.15 0.00/0.15 DP problem for innermost termination. 0.00/0.15 P = 0.00/0.15 f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1] 0.00/0.15 f#(I1, y) -> round#(I1) [I1 >= 1 && y = I1 - 1] 0.00/0.15 R = 0.00/0.15 round(x) -> x + 1 0.00/0.15 round(I0) -> I0 0.00/0.15 f(I1, y) -> f(I1, round(I1)) [I1 >= 1 && y = I1 - 1] 0.00/0.15 0.00/0.15 The dependency graph for this problem is: 0.00/0.15 0 -> 0, 1 0.00/0.15 1 -> 0.00/0.15 Where: 0.00/0.15 0) f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1] 0.00/0.15 1) f#(I1, y) -> round#(I1) [I1 >= 1 && y = I1 - 1] 0.00/0.15 0.00/0.15 We have the following SCCs. 0.00/0.15 { 0 } 0.00/0.15 0.00/0.15 DP problem for innermost termination. 0.00/0.15 P = 0.00/0.15 f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1] 0.00/0.15 R = 0.00/0.15 round(x) -> x + 1 0.00/0.15 round(I0) -> I0 0.00/0.15 f(I1, y) -> f(I1, round(I1)) [I1 >= 1 && y = I1 - 1] 0.00/0.15 0.00/3.13 EOF