Certification Problem
Input (TPDB SRS_Relative/Waldmann_19/random-113)
The relative rewrite relation R/S is considered where R is the following TRS
|
b(b(b(x1))) |
→ |
b(a(c(x1))) |
(1) |
|
a(a(c(x1))) |
→ |
b(b(a(x1))) |
(2) |
and S is the following TRS.
|
a(b(c(x1))) |
→ |
c(b(a(x1))) |
(3) |
|
b(b(a(x1))) |
→ |
c(b(c(x1))) |
(4) |
|
c(a(c(x1))) |
→ |
a(b(c(x1))) |
(5) |
|
a(b(b(x1))) |
→ |
c(b(a(x1))) |
(6) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by ttt2 @ termCOMP 2023)
1 String Reversal
Since only unary symbols occur, one can reverse all terms and obtains the TRS
|
b(b(b(x1))) |
→ |
c(a(b(x1))) |
(7) |
|
c(a(a(x1))) |
→ |
a(b(b(x1))) |
(8) |
|
c(b(a(x1))) |
→ |
a(b(c(x1))) |
(9) |
|
a(b(b(x1))) |
→ |
c(b(c(x1))) |
(10) |
|
c(a(c(x1))) |
→ |
c(b(a(x1))) |
(11) |
|
b(b(a(x1))) |
→ |
a(b(c(x1))) |
(12) |
1.1 Rule Removal
Using the
linear polynomial interpretation over (2 x 2)-matrices with strict dimension 1
over the arctic semiring over the integers
| [c(x1)] |
= |
· x1 +
|
| [b(x1)] |
= |
· x1 +
|
| [a(x1)] |
= |
· x1 +
|
all of the following rules can be deleted.
|
a(b(b(x1))) |
→ |
c(b(c(x1))) |
(10) |
|
b(b(a(x1))) |
→ |
a(b(c(x1))) |
(12) |
1.1.1 Rule Removal
Using the
Knuth Bendix order with w0 = 1 and the following precedence and weight functions
| prec(a) |
= |
0 |
|
weight(a) |
= |
2 |
|
|
|
| prec(c) |
= |
2 |
|
weight(c) |
= |
4 |
|
|
|
| prec(b) |
= |
3 |
|
weight(b) |
= |
3 |
|
|
|
all of the following rules can be deleted.
|
b(b(b(x1))) |
→ |
c(a(b(x1))) |
(7) |
|
c(a(a(x1))) |
→ |
a(b(b(x1))) |
(8) |
|
c(b(a(x1))) |
→ |
a(b(c(x1))) |
(9) |
|
c(a(c(x1))) |
→ |
c(b(a(x1))) |
(11) |
1.1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.