NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

c a
f(f(c)) c
f(c) a

Proof

1 Non-Joinable Fork

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

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

t0 = f(c)
ε a
= t1

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

Tool configuration

csi