Certification Problem
Input (TPDB TRS_Outermost/Zantema_08/inn_out)
The rewrite relation of the following TRS is considered.
|
f(g(x)) |
→ |
f(g(g(x))) |
(1) |
|
g(g(g(x))) |
→ |
a |
(2) |
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
|
= |
f(g(x)) |
|
→
|
f(g(g(x))) |
|
= |
t1
|
where t1 =
t0σ
and
σ =
{x/g(x)}