Certification Problem

Input (TPDB TRS_Standard/Transformed_CSR_04/Ex6_GM04_GM)

The rewrite relation of the following TRS is considered.

a__c	→	a__f(g(c))	(1)
a__f(g(X))	→	g(X)	(2)
mark(c)	→	a__c	(3)
mark(f(X))	→	a__f(X)	(4)
mark(g(X))	→	g(X)	(5)
a__c	→	c	(6)
a__f(X)	→	f(X)	(7)

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.

a__c^#	→	a__f^#(g(c))	(8)
mark^#(f(X))	→	a__f^#(X)	(9)
mark^#(c)	→	a__c^#	(10)

1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.