NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

not(true) false
not(false) true
or(true,y) true
or(x,true) true
or(false,false) false
implies(true,y) y
implies(false,y) true
implies(x,y) or(not(x),y)

Proof

1 Non-Joinable Fork

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

t0 = implies(true,f5)
ε f5
= t1

t0 = implies(true,f5)
ε or(not(true),f5)
= t1

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

Tool configuration

csi