Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex25_Luc06_L)
The rewrite relation of the following TRS is considered.
|
f(f(X)) |
→ |
c |
(1) |
| c |
→ |
d |
(2) |
|
h(X) |
→ |
c |
(3) |
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(X)) |
→ |
c# |
(4) |
|
h#(X) |
→ |
c# |
(5) |
1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.