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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(s(x)) -> F(p(s(x)))
F(s(x)) -> P(s(x))

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Rewriting Transformation


Dependency Pair:

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


Rules:


f(s(x)) -> s(s(f(p(s(x)))))
f(0) -> 0
p(s(x)) -> x


Strategy:

innermost




On this DP problem, a Rewriting SCC transformation can be performed.
As a result of transforming the rule

F(s(x)) -> F(p(s(x)))
one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

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


Rules:


f(s(x)) -> s(s(f(p(s(x)))))
f(0) -> 0
p(s(x)) -> 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
         ↳Rw
           →DP Problem 2
             ↳AFS
             ...
               →DP Problem 3
                 ↳Dependency Graph


Dependency Pair:


Rules:


f(s(x)) -> s(s(f(p(s(x)))))
f(0) -> 0
p(s(x)) -> x


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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