Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/ExConc_Zan97_GM)
The rewrite relation of the following TRS is considered.
a__f(X) |
→ |
g(h(f(X))) |
(1) |
mark(f(X)) |
→ |
a__f(mark(X)) |
(2) |
mark(g(X)) |
→ |
g(X) |
(3) |
mark(h(X)) |
→ |
h(mark(X)) |
(4) |
a__f(X) |
→ |
f(X) |
(5) |
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.
mark#(f(X)) |
→ |
mark#(X) |
(6) |
mark#(h(X)) |
→ |
mark#(X) |
(7) |
mark#(f(X)) |
→ |
a__f#(mark(X)) |
(8) |
1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.