(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
app(app(rec, h), app(g, 0)) → g
app(app(rec, h), app(g, app(s, x))) → app(app(h, x), app(app(rec, h), app(g, 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:
APP(app(rec, h), app(g, app(s, x))) → APP(app(h, x), app(app(rec, h), app(g, x)))
APP(app(rec, h), app(g, app(s, x))) → APP(h, x)
APP(app(rec, h), app(g, app(s, x))) → APP(app(rec, h), app(g, x))
APP(app(rec, h), app(g, app(s, x))) → APP(g, x)
The TRS R consists of the following rules:
app(app(rec, h), app(g, 0)) → g
app(app(rec, h), app(g, app(s, x))) → app(app(h, x), app(app(rec, h), app(g, x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.