(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
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:
BIN(s(x), s(y)) → BIN(x, s(y))
BIN(s(x), s(y)) → BIN(x, y)
The TRS R consists of the following rules:
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
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.
BIN(s(x), s(y)) → BIN(x, s(y))
BIN(s(x), s(y)) → BIN(x, y)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
BIN(
x0,
x1,
x2) =
BIN(
x1)
Tags:
BIN has argument tags [3,0,0] and root tag 0
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:
POL(BIN(x1, x2)) = 0
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:
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
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