(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(s(x), y) → f(x, s(s(x)))
f(x, s(s(y))) → f(y, 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(x), y) → F(x, s(s(x)))
F(x, s(s(y))) → F(y, x)
The TRS R consists of the following rules:
f(s(x), y) → f(x, s(s(x)))
f(x, s(s(y))) → f(y, 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(x, s(s(y))) → F(y, 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,
x2) =
F(
x0,
x1,
x2)
Tags:
F has argument tags [2,0,2] and root tag 0
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
F(
x1,
x2) =
F(
x1)
s(
x1) =
s(
x1)
Recursive path order with status [RPO].
Quasi-Precedence:
[F1, s1]
Status:
F1: multiset
s1: multiset
The following usable rules [FROCOS05] were oriented:
none
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(s(x), y) → F(x, s(s(x)))
The TRS R consists of the following rules:
f(s(x), y) → f(x, s(s(x)))
f(x, s(s(y))) → f(y, x)
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.
F(s(x), y) → F(x, s(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,
x2) =
F(
x1)
Tags:
F has argument tags [0,1,2] and root tag 0
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Recursive path order with status [RPO].
Quasi-Precedence:
[F2, s1]
Status:
F2: [2,1]
s1: multiset
The following usable rules [FROCOS05] were oriented:
none
(6) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
f(s(x), y) → f(x, s(s(x)))
f(x, s(s(y))) → f(y, x)
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