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