Certification Problem

Input (COPS 86)

We consider the TRS containing the following rules:

f(x) → g(x) (1)
f(x) → h(f(x)) (2)
h(f(x)) → h(g(x)) (3)
g(x) → h(g(x)) (4)

The underlying signature is as follows:

{f/1, g/1, h/1}

Property / Task

Prove or disprove confluence.

Answer / Result

Yes.

Proof (by csi @ CoCo 2023)

1 Redundant Rules Transformation

To prove that the TRS is (non-)confluent, we show (non-)confluence of the following modified system:

f(x) → h(f(x)) (2)
h(f(x)) → h(g(x)) (3)
g(x) → h(g(x)) (4)

All redundant rules that were added or removed can be simulated in 4 steps .

1.1 Strongly closed

Confluence is proven since the TRS is strongly closed. The joins can be performed using 7 step(s).