NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

f(c) g(c)
g(c) f(c)
c d

Proof

1 Non-Joinable Fork

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

t0 = f(c)
1 f(d)
= t1

t0 = f(c)
ε g(c)
1 g(d)
= t2

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

Tool configuration

csi