NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = f(a,a)
→2 f(a,b)
→1 f(b,b)
= t2

t0 = f(a,a)
→ε c
= t1

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

Tool configuration

csi