Certification Problem
Input (TPDB TRS_Standard/Strategy_removed_mixed_05/ex4)
The rewrite relation of the following TRS is considered.
|
f(h(x)) |
→ |
f(i(x)) |
(1) |
|
f(i(x)) |
→ |
a |
(2) |
|
i(x) |
→ |
h(x) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by ttt2 @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
| t0
|
= |
f(h(x8)) |
|
→
|
f(i(x8)) |
|
→
|
f(h(x8)) |
|
= |
t2
|
where t2 =
t0σ
and
σ =
{x8/x8}