NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

F(A,A) G(B,B)
A A'
F(A',x) F(x,x)
F(x,A') F(x,x)
G(B,B) F(A,A)
B B'
G(B',x) G(x,x)
G(x,B') G(x,x)

Proof

1 Non-Joinable Fork

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

t0 = G(B,B)
2 G(B,B')
1 G(B',B')
= t2

t0 = G(B,B)
ε F(A,A)
2 F(A,A')
1 F(A',A')
= t3

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

Tool configuration

csi