Certification Problem
Input (TPDB TRS_Standard/Strategy_removed_CSR_05/ExConc_Zan97)
The rewrite relation of the following TRS is considered.
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by ttt2 @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
| t0
|
= |
f(X) |
|
→
|
g(h(f(X))) |
|
= |
t1
|
where t1 =
C[t0σ]
and
σ =
{X/X}
and
C = g(h(☐))