Certification Problem
Input (TPDB SRS_Standard/Zantema_04/z115)
The rewrite relation of the following TRS is considered.
|
a(a(x1)) |
→ |
d(c(x1)) |
(1) |
|
a(b(x1)) |
→ |
c(c(c(x1))) |
(2) |
|
b(b(x1)) |
→ |
a(c(c(x1))) |
(3) |
|
c(c(x1)) |
→ |
b(x1) |
(4) |
|
c(d(x1)) |
→ |
a(a(x1)) |
(5) |
|
d(d(x1)) |
→ |
b(a(c(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
|
a(a(x1)) |
→ |
c(d(x1)) |
(7) |
|
b(a(x1)) |
→ |
c(c(c(x1))) |
(8) |
|
b(b(x1)) |
→ |
c(c(a(x1))) |
(9) |
|
c(c(x1)) |
→ |
b(x1) |
(4) |
|
d(c(x1)) |
→ |
a(a(x1)) |
(10) |
|
d(d(x1)) |
→ |
c(a(b(x1))) |
(11) |
1.1 Rule Removal
Using the
Knuth Bendix order with w0 = 1 and the following precedence and weight functions
| prec(b) |
= |
0 |
|
weight(b) |
= |
6 |
|
|
|
| prec(d) |
= |
3 |
|
weight(d) |
= |
7 |
|
|
|
| prec(c) |
= |
1 |
|
weight(c) |
= |
3 |
|
|
|
| prec(a) |
= |
2 |
|
weight(a) |
= |
5 |
|
|
|
all of the following rules can be deleted.
|
a(a(x1)) |
→ |
c(d(x1)) |
(7) |
|
b(a(x1)) |
→ |
c(c(c(x1))) |
(8) |
|
b(b(x1)) |
→ |
c(c(a(x1))) |
(9) |
|
c(c(x1)) |
→ |
b(x1) |
(4) |
|
d(c(x1)) |
→ |
a(a(x1)) |
(10) |
|
d(d(x1)) |
→ |
c(a(b(x1))) |
(11) |
1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.