(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
app(app(app(uncurry, f), x), y) → app(app(f, x), y)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:
[app2, uncurry]
Status:
app2: multiset
uncurry: multiset
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
app(app(app(uncurry, f), x), y) → app(app(f, x), y)
(2) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(3) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(4) TRUE