Certification Problem

Input (COPS 240)

We consider the TRS containing the following rules:

a(x) b(x) (1)
a(x) c(c(x)) (2)
b(x) g(b(x)) (3)
c(x) c(x) (4)

The underlying signature is as follows:

{a/1, b/1, c/1, g/1}

Property / Task

Prove or disprove confluence.

Answer / Result

No.

Proof (by csi @ CoCo 2020)

1 Non-Joinable Fork

The system is not confluent due to the following forking derivations.

t0 = a(f4)
b(f4)
= t1

t0 = a(f4)
c(c(f4))
= t1

The two resulting terms cannot be joined for the following reason: