Term Rewriting System R:
[x]
f(f(x)) -> g(f(x))
g(g(x)) -> f(x)

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

F(f(x)) -> G(f(x))
G(g(x)) -> F(x)

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polynomial Ordering`

Dependency Pairs:

G(g(x)) -> F(x)
F(f(x)) -> G(f(x))

Rules:

f(f(x)) -> g(f(x))
g(g(x)) -> f(x)

The following dependency pair can be strictly oriented:

G(g(x)) -> F(x)

Additionally, the following rules can be oriented:

f(f(x)) -> g(f(x))
g(g(x)) -> f(x)

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(g(x1)) =  1 + x1 POL(G(x1)) =  x1 POL(f(x1)) =  1 + x1 POL(F(x1)) =  x1

resulting in one new DP problem.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`           →DP Problem 2`
`             ↳Dependency Graph`

Dependency Pair:

F(f(x)) -> G(f(x))

Rules:

f(f(x)) -> g(f(x))
g(g(x)) -> f(x)

Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:00 minutes