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