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