Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex14_Luc06_Z)
The rewrite relation of the following TRS is considered.
|
h(X) |
→ |
g(X,X) |
(1) |
|
g(a,X) |
→ |
f(b,activate(X)) |
(2) |
|
f(X,X) |
→ |
h(a) |
(3) |
| a |
→ |
b |
(4) |
|
activate(X) |
→ |
X |
(5) |
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,a) |
|
→
|
f(b,activate(a)) |
|
→
|
f(b,a) |
|
→
|
f(b,b) |
|
→
|
h(a) |
|
→
|
g(a,a) |
|
= |
t5
|
where t5 =
t0