Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex14_Luc06_L)
The rewrite relation of the following TRS is considered.
|
h(X) |
→ |
g(X) |
(1) |
|
g(a) |
→ |
f(b) |
(2) |
|
f(X) |
→ |
h(a) |
(3) |
| a |
→ |
b |
(4) |
The evaluation strategy is outermostProperty / Task
Prove or disprove termination.Answer / Result
No.Proof (by AProVE @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
| t0
|
= |
g(a) |
|
→
|
f(b) |
|
→
|
h(a) |
|
→
|
g(a) |
|
= |
t3
|
where t3 =
t0