Term Rewriting System R:
f(g(i(a, b, b'), c), d) -> if(e, f(.(b, c), d'), f(.(b', c), d'))
f(g(h(a, b), c), d) -> if(e, f(.(b, g(h(a, b), c)), d), f(c, d'))

Termination of R to be shown.

Dependency Pair Analysis

R contains the following Dependency Pairs:

F(g(i(a, b, b'), c), d) -> F(.(b, c), d')
F(g(i(a, b, b'), c), d) -> F(.(b', c), d')
F(g(h(a, b), c), d) -> F(.(b, g(h(a, b), c)), d)
F(g(h(a, b), c), d) -> F(c, d')

R contains no SCCs.

Termination of R successfully shown.
0:00 minutes