Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex23_Luc06_FR)
The rewrite relation of the following TRS is considered.
|
f(f(a)) |
→ |
c(n__f(n__g(n__f(n__a)))) |
(1) |
|
f(X) |
→ |
n__f(X) |
(2) |
|
g(X) |
→ |
n__g(X) |
(3) |
| a |
→ |
n__a |
(4) |
|
activate(n__f(X)) |
→ |
f(activate(X)) |
(5) |
|
activate(n__g(X)) |
→ |
g(activate(X)) |
(6) |
|
activate(n__a) |
→ |
a |
(7) |
|
activate(X) |
→ |
X |
(8) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by ttt2 @ termCOMP 2023)
1 Rule Removal
Using the
Knuth Bendix order with w0 = 1 and the following precedence and weight functions
| prec(activate) |
= |
7 |
|
weight(activate) |
= |
6 |
|
|
|
| prec(g) |
= |
2 |
|
weight(g) |
= |
4 |
|
|
|
| prec(c) |
= |
4 |
|
weight(c) |
= |
1 |
|
|
|
| prec(n__g) |
= |
1 |
|
weight(n__g) |
= |
4 |
|
|
|
| prec(n__f) |
= |
3 |
|
weight(n__f) |
= |
4 |
|
|
|
| prec(n__a) |
= |
0 |
|
weight(n__a) |
= |
1 |
|
|
|
| prec(f) |
= |
5 |
|
weight(f) |
= |
4 |
|
|
|
| prec(a) |
= |
6 |
|
weight(a) |
= |
6 |
|
|
|
all of the following rules can be deleted.
|
f(f(a)) |
→ |
c(n__f(n__g(n__f(n__a)))) |
(1) |
|
f(X) |
→ |
n__f(X) |
(2) |
|
g(X) |
→ |
n__g(X) |
(3) |
| a |
→ |
n__a |
(4) |
|
activate(n__f(X)) |
→ |
f(activate(X)) |
(5) |
|
activate(n__g(X)) |
→ |
g(activate(X)) |
(6) |
|
activate(n__a) |
→ |
a |
(7) |
|
activate(X) |
→ |
X |
(8) |
1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.