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 AProVE @ termCOMP 2023)
1 Looping derivation
There is a looping derivation.
f →+ g n__h f ε
The derivation can be derived as follows.
-
f →+ g n__h f:
This is an original rule (OC1).