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

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(g(x), s(0)) -> F(g(x), g(x))
G(s(x)) -> G(x)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering


Dependency Pair:

G(s(x)) -> G(x)


Rules:


f(g(x), s(0)) -> f(g(x), g(x))
g(s(x)) -> s(g(x))
g(0) -> 0


Strategy:

innermost




The following dependency pair can be strictly oriented:

G(s(x)) -> G(x)


There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
G(x1) -> G(x1)
s(x1) -> s(x1)


   R
DPs
       →DP Problem 1
AFS
           →DP Problem 2
Dependency Graph


Dependency Pair:


Rules:


f(g(x), s(0)) -> f(g(x), g(x))
g(s(x)) -> s(g(x))
g(0) -> 0


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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