Termination Proof using AProVE

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

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

F(1) -> F(g(1))
F(1) -> G(1)
G(0) -> G(f(0))
G(0) -> F(0)

Furthermore, R contains two SCCs.

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
F(1) -> F(g(1))

Rules:

f(1) -> f(g(1))
f(f(x)) -> f(x)
g(0) -> g(f(0))
g(g(x)) -> g(x)

Strategy:
innermost
Dependency Pair:
G(0) -> G(f(0))

Rules:

f(1) -> f(g(1))
f(f(x)) -> f(x)
g(0) -> g(f(0))
g(g(x)) -> g(x)

Strategy:
innermost

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
F(1) -> F(g(1))

Rules:

f(1) -> f(g(1))
f(f(x)) -> f(x)
g(0) -> g(f(0))
g(g(x)) -> g(x)

Strategy:
innermost
Dependency Pair:
G(0) -> G(f(0))

Rules:

f(1) -> f(g(1))
f(f(x)) -> f(x)
g(0) -> g(f(0))
g(g(x)) -> g(x)

Strategy:
innermost

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