Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/ExConc_Zan97_FR)
The rewrite relation of the following TRS is considered.
|
f(X) |
→ |
g(n__h(n__f(X))) |
(1) |
|
h(X) |
→ |
n__h(X) |
(2) |
|
f(X) |
→ |
n__f(X) |
(3) |
|
activate(n__h(X)) |
→ |
h(activate(X)) |
(4) |
|
activate(n__f(X)) |
→ |
f(activate(X)) |
(5) |
|
activate(X) |
→ |
X |
(6) |
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.
|
activate#(n__f(X)) |
→ |
activate#(X) |
(7) |
|
activate#(n__h(X)) |
→ |
h#(activate(X)) |
(8) |
|
activate#(n__f(X)) |
→ |
f#(activate(X)) |
(9) |
|
activate#(n__h(X)) |
→ |
activate#(X) |
(10) |
1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.