Certification Problem

Input (TPDB TRS_Standard/SK90/4.50)

The rewrite relation of the following TRS is considered.

f(0,1,x) → f(x,x,x) (1)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
f#(0,1,x) → f#(x,x,x) (2)

1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.