Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex5_Zan97_Z)
The rewrite relation of the following TRS is considered.
f(X) |
→ |
if(X,c,n__f(true)) |
(1) |
if(true,X,Y) |
→ |
X |
(2) |
if(false,X,Y) |
→ |
activate(Y) |
(3) |
f(X) |
→ |
n__f(X) |
(4) |
activate(n__f(X)) |
→ |
f(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.
if#(false,X,Y) |
→ |
activate#(Y) |
(7) |
f#(X) |
→ |
if#(X,c,n__f(true)) |
(8) |
activate#(n__f(X)) |
→ |
f#(X) |
(9) |
1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.