(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
ap(ap(ff, x), x) → ap(ap(x, ap(ff, x)), ap(ap(cons, x), nil))
Q is empty.
(1) Overlay + Local Confluence (EQUIVALENT transformation)
The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
ap(ap(ff, x), x) → ap(ap(x, ap(ff, x)), ap(ap(cons, x), nil))
The set Q consists of the following terms:
ap(ap(ff, x0), x0)
(3) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
AP(ap(ff, x), x) → AP(ap(x, ap(ff, x)), ap(ap(cons, x), nil))
AP(ap(ff, x), x) → AP(x, ap(ff, x))
AP(ap(ff, x), x) → AP(ap(cons, x), nil)
AP(ap(ff, x), x) → AP(cons, x)
The TRS R consists of the following rules:
ap(ap(ff, x), x) → ap(ap(x, ap(ff, x)), ap(ap(cons, x), nil))
The set Q consists of the following terms:
ap(ap(ff, x0), x0)
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 4 less nodes.
(6) TRUE