NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a a
a b
a f(a,a)
f(b,b) f(a,b)
f(x0,a) f(b,b)

Proof

1 Non-Joinable Fork

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

t0 = f(f3,a)
2 f(f3,b)
= t1

t0 = f(f3,a)
ε f(b,b)
= t1

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

Tool configuration

csi