Certification Problem

Input (TPDB TRS_Standard/Transformed_CSR_04/Ex6_Luc98_L)

The rewrite relation of the following TRS is considered.

first(0,X) nil (1)
first(s(X),cons(Y)) cons(Y) (2)
from(X) cons(X) (3)

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.