Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex1_Zan97_Z)
The rewrite relation of the following TRS is considered.
|
g(X) |
→ |
h(activate(X)) |
(1) |
| c |
→ |
d |
(2) |
|
h(n__d) |
→ |
g(n__c) |
(3) |
| d |
→ |
n__d |
(4) |
| c |
→ |
n__c |
(5) |
|
activate(n__d) |
→ |
d |
(6) |
|
activate(n__c) |
→ |
c |
(7) |
|
activate(X) |
→ |
X |
(8) |
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
|
= |
h(activate(n__c)) |
|
→
|
h(c) |
|
→
|
h(d) |
|
→
|
h(n__d) |
|
→
|
g(n__c) |
|
→
|
h(activate(n__c)) |
|
= |
t5
|
where t5 =
t0