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