Certification Problem
Input (TPDB TRS_Standard/SK90/2.51)
The rewrite relation of the following TRS is considered.
|
ack(0,y) |
→ |
s(y) |
(1) |
|
ack(s(x),0) |
→ |
ack(x,s(0)) |
(2) |
|
ack(s(x),s(y)) |
→ |
ack(x,ack(s(x),y)) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by ttt2 @ termCOMP 2023)
1 Rule Removal
Using the
Weighted Path Order with the following precedence and status
| prec(s) |
= |
0 |
|
status(s) |
= |
[1] |
|
list-extension(s) |
= |
Lex |
| prec(ack) |
= |
1 |
|
status(ack) |
= |
[1, 2] |
|
list-extension(ack) |
= |
Lex |
| prec(0) |
= |
0 |
|
status(0) |
= |
[] |
|
list-extension(0) |
= |
Lex |
and the following
Max-polynomial interpretation
| [s(x1)] |
=
|
max(0, 0 + 1 · x1) |
| [ack(x1, x2)] |
=
|
max(3, 5 + 1 · x1, 0 + 1 · x2) |
| [0] |
=
|
max(2) |
all of the following rules can be deleted.
|
ack(0,y) |
→ |
s(y) |
(1) |
|
ack(s(x),0) |
→ |
ack(x,s(0)) |
(2) |
|
ack(s(x),s(y)) |
→ |
ack(x,ack(s(x),y)) |
(3) |
1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.