(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
dfib(s(s(x)), y) → dfib(s(x), dfib(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:
DFIB(s(s(x)), y) → DFIB(s(x), dfib(x, y))
DFIB(s(s(x)), y) → DFIB(x, y)
The TRS R consists of the following rules:
dfib(s(s(x)), y) → dfib(s(x), dfib(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.
DFIB(s(s(x)), y) → DFIB(s(x), dfib(x, y))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
DFIB(
x0,
x1,
x2) =
DFIB(
x0,
x1)
Tags:
DFIB has argument tags [1,2,3] 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.
DFIB(
x1,
x2) =
DFIB(
x2)
s(
x1) =
s(
x1)
dfib(
x1,
x2) =
dfib(
x1)
Recursive path order with status [RPO].
Quasi-Precedence:
[DFIB1, s1, dfib1]
Status:
DFIB1: [1]
s1: [1]
dfib1: [1]
The following usable rules [FROCOS05] were oriented:
dfib(s(s(x)), y) → dfib(s(x), dfib(x, y))
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
DFIB(s(s(x)), y) → DFIB(x, y)
The TRS R consists of the following rules:
dfib(s(s(x)), y) → dfib(s(x), dfib(x, y))
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.
DFIB(s(s(x)), y) → DFIB(x, y)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
DFIB(
x0,
x1,
x2) =
DFIB(
x1)
Tags:
DFIB has argument tags [0,2,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.
DFIB(
x1,
x2) =
DFIB
s(
x1) =
s(
x1)
Recursive path order with status [RPO].
Quasi-Precedence:
trivial
Status:
DFIB: multiset
s1: [1]
The following usable rules [FROCOS05] were oriented:
none
(6) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
dfib(s(s(x)), y) → dfib(s(x), dfib(x, y))
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