Certification Problem

Input (TPDB TRS_Standard/AG01/#3.29)

The rewrite relation of the following TRS is considered.

f(s(x),y,y) f(y,x,s(x)) (1)

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.
f#(s(x),y,y) f#(y,x,s(x)) (2)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.