(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(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), X) → F(X, a(X))
F(X, c(X)) → F(s(X), X)
The TRS R consists of the following rules:
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
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 2 SCCs.
(4) Complex Obligation (AND)
(5) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(s(X), X) → F(X, a(X))
The TRS R consists of the following rules:
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(6) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
F(s(X), X) → F(X, a(X))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
F(
x1,
x2) =
F(
x1)
Tags:
F has tags [1,1]
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Homeomorphic Embedding Order
The following usable rules [FROCOS05] were oriented:
none
(7) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(8) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(9) TRUE
(10) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(X, c(X)) → F(s(X), X)
The TRS R consists of the following rules:
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(11) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
F(X, c(X)) → F(s(X), X)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
F(
x1,
x2) =
F(
x2)
Tags:
F has tags [0,1]
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Homeomorphic Embedding Order
The following usable rules [FROCOS05] were oriented:
none
(12) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(13) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(14) TRUE