(0) Obligation:

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

+(0, y) → y
+(s(x), 0) → s(x)
+(s(x), s(y)) → s(+(s(x), +(y, 0)))

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:

+1(s(x), s(y)) → +1(s(x), +(y, 0))
+1(s(x), s(y)) → +1(y, 0)

The TRS R consists of the following rules:

+(0, y) → y
+(s(x), 0) → s(x)
+(s(x), s(y)) → s(+(s(x), +(y, 0)))

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

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(4) Obligation:

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

+1(s(x), s(y)) → +1(s(x), +(y, 0))

The TRS R consists of the following rules:

+(0, y) → y
+(s(x), 0) → s(x)
+(s(x), s(y)) → s(+(s(x), +(y, 0)))

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

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Tags:
+1 has tags [0,0]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Recursive path order with status [RPO].
Quasi-Precedence:
[s1, 0] > +2

Status:
s1: [1]
+2: multiset
0: multiset


The following usable rules [FROCOS05] were oriented:

+(0, y) → y
+(s(x), 0) → s(x)

(6) Obligation:

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

+(0, y) → y
+(s(x), 0) → s(x)
+(s(x), s(y)) → s(+(s(x), +(y, 0)))

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

(7) PisEmptyProof (EQUIVALENT transformation)

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

(8) TRUE