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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Argument Filtering and Ordering


Dependency Pair:

F(s(x)) -> F(x)


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

F(s(x)) -> F(x)


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
F(x1) -> F(x1)
s(x1) -> s(x1)


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


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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