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

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

F(g(a)) -> F(s(g(b)))
F(g(a)) -> G(b)
G(x) -> F(g(x))
G(x) -> G(x)

Furthermore, R contains one SCC.

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

Dependency Pairs:

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

Rules:

f(g(a)) -> f(s(g(b)))
f(f(x)) -> b
g(x) -> f(g(x))

The following dependency pair can be strictly oriented:

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

Additionally, the following usable rules w.r.t. to the implicit AFS can be oriented:

g(x) -> f(g(x))
f(g(a)) -> f(s(g(b)))
f(f(x)) -> b

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

resulting in one new DP problem.

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

Dependency Pairs:

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

Rules:

f(g(a)) -> f(s(g(b)))
f(f(x)) -> b
g(x) -> f(g(x))

Using the Dependency Graph the DP problem was split into 1 DP problems.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`           →DP Problem 2`
`             ↳DGraph`
`             ...`
`               →DP Problem 3`
`                 ↳Remaining Obligation(s)`

The following remains to be proven:
Dependency Pair:

G(x) -> G(x)

Rules:

f(g(a)) -> f(s(g(b)))
f(f(x)) -> b
g(x) -> f(g(x))

Termination of R could not be shown.
Duration:
0:00 minutes