Certification Problem
Input (TPDB TRS_Relative/Relative_05/rt1-2)
The relative rewrite relation R/S is considered where R is the following TRS
|
f(x) |
→ |
x |
(1) |
|
g(x) |
→ |
x |
(2) |
and S is the following TRS.
|
f(x) |
→ |
g(x) |
(3) |
|
g(x) |
→ |
f(x) |
(4) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Rule Removal
Using the
linear polynomial interpretation over the naturals
| [f(x1)] |
= |
1 + 1 · x1
|
| [g(x1)] |
= |
1 + 1 · x1
|
all of the following rules can be deleted.
|
f(x) |
→ |
x |
(1) |
|
g(x) |
→ |
x |
(2) |
1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.