Certification Problem
Input (TPDB TRS_Standard/Rubio_04/mfp95)
The rewrite relation of the following TRS is considered.
|
f(s(X),Y) |
→ |
h(s(f(h(Y),X))) |
(1) |
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#(s(X),Y) |
→ |
f#(h(Y),X) |
(2) |
1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.