Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex3_12_Luc96a_Z)
The rewrite relation of the following TRS is considered.
|
from(X) |
→ |
cons(X,n__from(s(X))) |
(1) |
|
sel(0,cons(X,Y)) |
→ |
X |
(2) |
|
sel(s(X),cons(Y,Z)) |
→ |
sel(X,activate(Z)) |
(3) |
|
from(X) |
→ |
n__from(X) |
(4) |
|
activate(n__from(X)) |
→ |
from(X) |
(5) |
|
activate(X) |
→ |
X |
(6) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Rule Removal
Using the
| prec(from) |
= |
1 |
|
stat(from) |
= |
mul
|
| prec(cons) |
= |
0 |
|
stat(cons) |
= |
mul
|
| prec(s) |
= |
0 |
|
stat(s) |
= |
mul
|
| prec(sel) |
= |
2 |
|
stat(sel) |
= |
lex
|
| prec(0) |
= |
3 |
|
stat(0) |
= |
mul
|
| prec(activate) |
= |
1 |
|
stat(activate) |
= |
mul
|
| π(from) |
= |
[1] |
| π(cons) |
= |
[1,2] |
| π(n__from) |
= |
1 |
| π(s) |
= |
[1] |
| π(sel) |
= |
[1,2] |
| π(0) |
= |
[] |
| π(activate) |
= |
[1] |
all of the following rules can be deleted.
|
from(X) |
→ |
cons(X,n__from(s(X))) |
(1) |
|
sel(0,cons(X,Y)) |
→ |
X |
(2) |
|
sel(s(X),cons(Y,Z)) |
→ |
sel(X,activate(Z)) |
(3) |
|
from(X) |
→ |
n__from(X) |
(4) |
|
activate(X) |
→ |
X |
(6) |
1.1 Rule Removal
Using the
Knuth Bendix order with w0 = 1 and the following precedence and weight functions
| prec(activate) |
= |
2 |
|
weight(activate) |
= |
1 |
|
|
|
| prec(n__from) |
= |
0 |
|
weight(n__from) |
= |
1 |
|
|
|
| prec(from) |
= |
1 |
|
weight(from) |
= |
2 |
|
|
|
all of the following rules can be deleted.
|
activate(n__from(X)) |
→ |
from(X) |
(5) |
1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.