Certification Problem

Input (COPS 369)

The rewrite relation of the following conditional TRS is considered.

a c
a d
b c
b d
s(c) t(k)
s(c) t(l)
g(x,x) h(x,x)
f(x) pair(x,y) | s(x) ≈ t(y)

Property / Task

Prove or disprove confluence.

Answer / Result

No.

Proof (by ConCon @ CoCo 2020)

1 Non-Joinable Fork

The system is not confluent due to the following forking derivations.
a * d
a * c
The two resulting terms cannot be joined for the following reason: