Certification Problem
Input (TPDB SRS_Relative/Waldmann_06_relative/r8)
The relative rewrite relation R/S is considered where R is the following TRS
|
a(b(a(x1))) |
→ |
c(c(c(x1))) |
(1) |
|
c(c(c(x1))) |
→ |
a(c(a(x1))) |
(2) |
and S is the following TRS.
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 String Reversal
Since only unary symbols occur, one can reverse all terms and obtains the TRS
|
a(b(a(x1))) |
→ |
c(c(c(x1))) |
(1) |
|
c(c(c(x1))) |
→ |
a(c(a(x1))) |
(2) |
|
a(x1) |
→ |
b(c(b(x1))) |
(3) |
1.1 Rule Removal
Using the
matrix interpretations of dimension 6 with strict dimension 1 over the integers
| [a(x1)] |
= |
+
|
| 1 |
1 |
0 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
| 0 |
1 |
0 |
0 |
1 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
| 0 |
1 |
0 |
0 |
0 |
0 |
|
|
· x1
|
| [b(x1)] |
= |
+
|
| 1 |
0 |
0 |
0 |
0 |
0 |
| 0 |
0 |
1 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
|
|
· x1
|
| [c(x1)] |
= |
+
|
| 1 |
0 |
0 |
0 |
1 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
0 |
1 |
| 0 |
0 |
0 |
0 |
0 |
0 |
| 0 |
1 |
0 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
0 |
0 |
|
|
· x1
|
all of the following rules can be deleted.
|
a(b(a(x1))) |
→ |
c(c(c(x1))) |
(1) |
1.1.1 Rule Removal
Using the
matrix interpretations of dimension 2 with strict dimension 1 over the integers
| [c(x1)] |
= |
+ · x1
|
| [a(x1)] |
= |
+ · x1
|
| [b(x1)] |
= |
+ · x1
|
all of the following rules can be deleted.
|
c(c(c(x1))) |
→ |
a(c(a(x1))) |
(2) |
1.1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.