Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex1_GM99_L)
The rewrite relation of the following TRS is considered.
|
f(X) |
→ |
f(X) |
(1) |
| c |
→ |
a |
(2) |
| c |
→ |
b |
(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 t1 =
t0σ
and
σ =
{X/X}