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