(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(empty, l) → l
f(cons(x, k), l) → g(k, l, cons(x, k))
g(a, b, c) → f(a, cons(b, c))
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(cons(x, k), l) → G(k, l, cons(x, k))
G(a, b, c) → F(a, cons(b, c))
The TRS R consists of the following rules:
f(empty, l) → l
f(cons(x, k), l) → g(k, l, cons(x, k))
g(a, b, c) → f(a, cons(b, c))
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(cons(x, k), l) → G(k, l, cons(x, k))
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)
G(
x0,
x1,
x2,
x3) =
G(
x0,
x1)
Tags:
F has argument tags [0,1,0] and root tag 0
G has argument tags [0,1,7,4] and root tag 0
Comparison: MIN
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
F(
x1,
x2) =
F
cons(
x1,
x2) =
cons(
x1,
x2)
G(
x1,
x2,
x3) =
G(
x1,
x2,
x3)
Recursive path order with status [RPO].
Quasi-Precedence:
F > G3
cons2 > G3
Status:
F: multiset
cons2: multiset
G3: multiset
The following usable rules [FROCOS05] were oriented:
none
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
G(a, b, c) → F(a, cons(b, c))
The TRS R consists of the following rules:
f(empty, l) → l
f(cons(x, k), l) → g(k, l, cons(x, k))
g(a, b, c) → f(a, cons(b, c))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.
(6) TRUE