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

Innermost Termination of R to be shown.

Dependency Pair Analysis

R contains the following Dependency Pairs:

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

R contains no SCCs.

Innermost Termination of R successfully shown.
0:00 minutes