let R be the TRS under consideration

f(s(_1),_1) -> f(s(_1),round(_1)) is in elim_R(R)
let l0 be the left-hand side of this rule
p0 = 1 is a position in l0
we have l0|p0 = _1
round(0) -> 0 is in R
let r'0 be the right-hand side of this rule
theta0 = {_1/0} is a mgu of l0|p0 and r'0

==> f(s(0),round(0)) -> f(s(0),round(0)) is in EU_R^1
let l be the left-hand side and r be the right-hand side of this rule
let p = epsilon
let theta = {}
let theta' = {}
we have r|p = f(s(0),round(0)) and
theta'(theta(l)) = theta(r|p)
so, theta(l) = f(s(0),round(0)) is non-terminating w.r.t. R

Termination disproved by the backward process
proof stopped at iteration i=1, depth k=2
3 rule(s) generated