Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/ExConc_Zan97_Z)
The rewrite relation of the following TRS is considered.
|
f(X) |
→ |
g(n__h(f(X))) |
(1) |
|
h(X) |
→ |
n__h(X) |
(2) |
|
activate(n__h(X)) |
→ |
h(X) |
(3) |
|
activate(X) |
→ |
X |
(4) |
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(n__h(f(X))) |
|
= |
t1
|
where t1 =
C[t0σ]
and
σ =
{X/X}
and
C = g(n__h(☐))