Certification Problem

Input (TPDB TRS_Standard/Transformed_CSR_04/ExConc_Zan97_L)

The rewrite relation of the following TRS is considered.

f(X)

→

g

(1)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by NaTT @ termCOMP 2023)

1 Dependency Pair Transformation

The set of initial dependency pairs is empty, and hence the TRS is terminating.