NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

h(f,a,a) → h(g,a,a)
h(g,a,a) → h(f,a,a)
a → a'
h(x,a',y) → h(x,y,y)
h(x,y,a') → h(x,y,y)

Proof

1 Non-Joinable Fork

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

t0 = h(g,a,a)
→3 h(g,a,a')
→2 h(g,a',a')
= t2

t0 = h(g,a,a)
→ε h(f,a,a)
→3 h(f,a,a')
→2 h(f,a',a')
= t3

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

Tool configuration

csi