Certification Problem

Input (TPDB TRS_Standard/AProVE_04/forward_instantiation)

The rewrite relation of the following TRS is considered.

f(x,y,z) → g(x,y,z) (1)
g(0,1,x) → f(x,x,x) (2)

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#(x,y,z) → g#(x,y,z) (3)
g#(0,1,x) → f#(x,x,x) (4)

1.1.1 Usable Rules Processor

We restrict the rewrite rules to the following usable rules of the DP problem.

There are no rules.

1.1.1.1 Innermost Lhss Removal Processor

We restrict the innermost strategy to the following left hand sides.

There are no lhss.

1.1.1.1.1 Instantiation Processor

We instantiate the pair to the following set of pairs
f#(z0,z0,z0) → g#(z0,z0,z0) (5)

1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.