NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

b a
b c
c c
d c
d e
f(x,a) A
f(x,e) A
f(x,A) A
f(c,x) A

Proof

1 Non-Joinable Fork

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

t0 = d
ε e
= t1

t0 = d
ε c
= t1

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

Tool configuration

csi