(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(0) → s(0)
f(s(0)) → s(0)
f(s(s(x))) → f(f(s(x)))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F(s(s(x))) → F(f(s(x)))
F(s(s(x))) → F(s(x))

The TRS R consists of the following rules:

f(0) → s(0)
f(s(0)) → s(0)
f(s(s(x))) → f(f(s(x)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


F(s(s(x))) → F(f(s(x)))
F(s(s(x))) → F(s(x))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
F(x0, x1)  =  F(x0, x1)

Tags:
F has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(F(x1)) = 0   
POL(f(x1)) = 1   
POL(s(x1)) = 1 + x1   

The following usable rules [FROCOS05] were oriented: none

(4) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f(0) → s(0)
f(s(0)) → s(0)
f(s(s(x))) → f(f(s(x)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(5) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(6) TRUE