(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) 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(app(uncurry, f), x), y) → APP(app(f, x), y)
APP(app(app(uncurry, f), x), y) → APP(f, x)

The TRS R consists of the following rules:

app(app(app(uncurry, f), x), y) → app(app(f, x), y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(app(app(uncurry, f), x), y) → APP(app(f, x), y)
APP(app(app(uncurry, f), x), y) → APP(f, x)
The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(APP(x1, x2)) = x1   
POL(app(x1, x2)) = 1 + x1 + x2   
POL(uncurry) = 1   

The following usable rules [FROCOS05] were oriented:

app(app(app(uncurry, f), x), y) → app(app(f, x), y)

(4) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(app(uncurry, f), x), y) → app(app(f, x), y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(5) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(6) TRUE