NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a b
f(a,b) f(a,a)
f(b,a) f(a,a)
f(a,a) c
g(x) f(x,x)

Proof

1 Non-Joinable Fork

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

t0 = f(a,b)
1 f(b,b)
= t1

t0 = f(a,b)
ε f(a,a)
ε c
= t2

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

Tool configuration

csi