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