(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
app(app(iterate, f), x) → app(app(cons, x), app(app(iterate, f), app(f, x)))
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:
app(app(iterate, f), x) → app(app(cons, x), app(app(iterate, f), app(f, x)))
The set Q consists of the following terms:
app(app(iterate, x0), x1)
(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:
APP(app(iterate, f), x) → APP(app(cons, x), app(app(iterate, f), app(f, x)))
APP(app(iterate, f), x) → APP(cons, x)
APP(app(iterate, f), x) → APP(app(iterate, f), app(f, x))
APP(app(iterate, f), x) → APP(f, x)
The TRS R consists of the following rules:
app(app(iterate, f), x) → app(app(cons, x), app(app(iterate, f), app(f, x)))
The set Q consists of the following terms:
app(app(iterate, x0), x1)
We have to consider all minimal (P,Q,R)-chains.
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
(6) Obligation:
Q DP problem:
The TRS P consists of the following rules:
APP(app(iterate, f), x) → APP(f, x)
APP(app(iterate, f), x) → APP(app(iterate, f), app(f, x))
The TRS R consists of the following rules:
app(app(iterate, f), x) → app(app(cons, x), app(app(iterate, f), app(f, x)))
The set Q consists of the following terms:
app(app(iterate, x0), x1)
We have to consider all minimal (P,Q,R)-chains.