Term Rewriting System R:
[x, y]
f(x, y) -> g1(x, x, y)
f(x, y) -> g1(y, x, x)
f(x, y) -> g2(x, y, y)
f(x, y) -> g2(y, y, x)
g1(x, x, y) -> h(x, y)
g1(y, x, x) -> h(x, y)
g2(x, y, y) -> h(x, y)
g2(y, y, x) -> h(x, y)
h(x, x) -> x

Termination of R to be shown.

Dependency Pair Analysis

R contains the following Dependency Pairs:

F(x, y) -> G1(x, x, y)
F(x, y) -> G1(y, x, x)
F(x, y) -> G2(x, y, y)
F(x, y) -> G2(y, y, x)
G1(x, x, y) -> H(x, y)
G1(y, x, x) -> H(x, y)
G2(x, y, y) -> H(x, y)
G2(y, y, x) -> H(x, y)

R contains no SCCs.

Termination of R successfully shown.
0:00 minutes