Certification Problem
Input (TPDB TRS_Standard/AotoYamada_05/025)
The rewrite relation of the following TRS is considered.
|
app(app(apply,f),x) |
→ |
app(f,x) |
(1) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Uncurrying
We uncurry the binary symbol
app
in combination with the following symbol map which also determines the applicative arities of these symbols.
| apply |
is mapped to |
apply, |
apply1(x1), |
apply2(x1, x2) |
There are no uncurry rules.
No rules have to be added for the eta-expansion.
Uncurrying the rules and adding the uncurrying rules yields the new set of rules
|
apply2(f,x) |
→ |
app(f,x) |
(4) |
|
app(apply,y1) |
→ |
apply1(y1) |
(2) |
|
app(apply1(x0),y1) |
→ |
apply2(x0,y1) |
(3) |
1.1 Rule Removal
Using the
Knuth Bendix order with w0 = 1 and the following precedence and weight functions
| prec(apply) |
= |
3 |
|
weight(apply) |
= |
1 |
|
|
|
| prec(apply1) |
= |
1 |
|
weight(apply1) |
= |
1 |
|
|
|
| prec(apply2) |
= |
0 |
|
weight(apply2) |
= |
1 |
|
|
|
| prec(app) |
= |
2 |
|
weight(app) |
= |
0 |
|
|
|
all of the following rules can be deleted.
|
apply2(f,x) |
→ |
app(f,x) |
(4) |
|
app(apply,y1) |
→ |
apply1(y1) |
(2) |
|
app(apply1(x0),y1) |
→ |
apply2(x0,y1) |
(3) |
1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.