Certification Problem

Input (COPS 41)

We consider the TRS containing the following rules:

f(x) g(k(x)) (1)
f(x) a (2)
g(x) a (3)
k(a) k(k(a)) (4)

The underlying signature is as follows:

{f/1, g/1, k/1, a/0}

Property / Task

Prove or disprove confluence.

Answer / Result

Yes.

Proof (by csi @ CoCo 2021)

1 Redundant Rules Transformation

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

k(a) k(k(a)) (4)
g(x) a (3)
f(x) a (2)
f(x) g(k(x)) (1)
k(a) k(k(k(a))) (5)

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

1.1 Strongly closed

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