Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex1_Zan97_L)
The rewrite relation of the following TRS is considered.
| g |
→ |
h |
(1) |
| c |
→ |
d |
(2) |
| h |
→ |
g |
(3) |
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.
where t2 =
t0