NO Non-Confluence Proof

Non-Confluence Proof

by Hakusan

Input

The rewrite relation of the following TRS is considered.

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

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

t₀ = h(c,a)

→₂ h(c,f(a))

= t₁

t₀ = h(c,a)

→_ε b

= t₁

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

When applying the cap-function on both terms (where variables may be treated like constants) then the resulting terms do not unify.

Hakusan