Term Rewriting System R:
[x]
f(s(x)) -> s(f(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(f(p(s(x))))
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 Pairs:

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


Rules:


f(s(x)) -> s(f(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(f(p(s(x))))
one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Rw
           →DP Problem 2
             ↳Rewriting Transformation


Dependency Pairs:

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


Rules:


f(s(x)) -> s(f(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
             ↳Rw
             ...
               →DP Problem 3
                 ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

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


Rules:


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


Strategy:

innermost



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