Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex18_Luc06_Z)
The rewrite relation of the following TRS is considered.
|
f(f(a)) |
→ |
f(g(n__f(a))) |
(1) |
|
f(X) |
→ |
n__f(X) |
(2) |
|
activate(n__f(X)) |
→ |
f(X) |
(3) |
|
activate(X) |
→ |
X |
(4) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by NaTT @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
f#(f(a)) |
→ |
f#(g(n__f(a))) |
(5) |
|
activate#(n__f(X)) |
→ |
f#(X) |
(6) |
1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.