NO Non-Confluence Proof

Non-Confluence Proof

by Hakusan

Input

The rewrite relation of the following TRS is considered.

f(a) c
b c
b a

Proof

1 Non-Joinable Fork

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

t0 = b
ε a
= t1

t0 = b
ε c
= t1

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

Tool configuration

Hakusan