Certification Problem
Input (TPDB TRS_Standard/Secret_06_TRS/6)
The rewrite relation of the following TRS is considered.
|
b(x,y) |
→ |
c(a(c(y),a(0,x))) |
(1) |
|
a(y,x) |
→ |
y |
(2) |
|
a(y,c(b(a(0,x),0))) |
→ |
b(a(c(b(0,y)),x),0) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by ttt2 @ termCOMP 2023)
1 Rule Removal
Using the
linear polynomial interpretation over (3 x 3)-matrices with strict dimension 1
over the naturals
| [c(x1)] |
= |
· x1 +
|
| [a(x1, x2)] |
= |
· x1 + · x2 +
|
| [b(x1, x2)] |
= |
· x1 + · x2 +
|
| [0] |
= |
|
all of the following rules can be deleted.
|
a(y,c(b(a(0,x),0))) |
→ |
b(a(c(b(0,y)),x),0) |
(3) |
1.1 Rule Removal
Using the
Knuth Bendix order with w0 = 1 and the following precedence and weight functions
| prec(a) |
= |
2 |
|
weight(a) |
= |
0 |
|
|
|
| prec(0) |
= |
3 |
|
weight(0) |
= |
1 |
|
|
|
| prec(c) |
= |
0 |
|
weight(c) |
= |
2 |
|
|
|
| prec(b) |
= |
1 |
|
weight(b) |
= |
5 |
|
|
|
all of the following rules can be deleted.
|
b(x,y) |
→ |
c(a(c(y),a(0,x))) |
(1) |
|
a(y,x) |
→ |
y |
(2) |
1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.