NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

if(true,a,x) → a
if(true,b,x) → b
if(true,g(a),x) → g(a)
if(true,g(b),x) → g(b)
if(false,x,a) → a
if(false,x,b) → b
if(false,x,g(a)) → g(a)
if(false,x,g(b)) → g(b)
g(a) → g(g(a))
g(b) → a
f(a,b) → b
f(g(g(a)),x) → b

Proof

1 Non-Joinable Fork

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

t0 = if(true,g(a),f7)
→2 if(true,g(g(a)),f7)
= t1

t0 = if(true,g(a),f7)
→ε g(a)
= t1

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

Tool configuration

csi