Certification Problem

Input (TPDB TRS_Standard/Various_04/11)

The rewrite relation of the following TRS is considered.

f(0,1,x) f(h(x),h(x),x) (1)
h(0) 0 (2)
h(g(x,y)) y (3)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Switch to Innermost Termination

The TRS is overlay and locally confluent:

10

Hence, it suffices to show innermost termination in the following.

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
f#(0,1,x) f#(h(x),h(x),x) (4)
f#(0,1,x) h#(x) (5)

1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.