(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(f, x)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(
x1,
x2) =
APP(
x1,
x2)
Tags:
APP has tags [0,0]
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Lexicographic path order with status [LPO].
Quasi-Precedence:
uncurry > app2
Status:
app2: [1,2]
uncurry: []
The following usable rules [FROCOS05] were oriented:
app(app(app(uncurry, f), x), y) → app(app(f, x), y)
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
APP(app(app(uncurry, f), x), y) → APP(app(f, x), y)
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) 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)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(
x1,
x2) =
APP(
x1)
Tags:
APP has tags [1,1]
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Lexicographic path order with status [LPO].
Quasi-Precedence:
[app2, uncurry]
Status:
app2: [1,2]
uncurry: []
The following usable rules [FROCOS05] were oriented:
app(app(app(uncurry, f), x), y) → app(app(f, x), y)
(6) 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.
(7) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(8) TRUE