NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

s(p(x)) x
p(s(x)) x
+(x,0) x
+(x,s(y)) s(+(x,y))
+(x,p(y)) p(+(x,y))
-(x,0) x
-(x,s(y)) p(-(x,y))
-(x,p(y)) s(-(x,y))
*(x,0) 0
*(x,s(y)) +(*(x,y),x)
*(x,p(y)) -(*(x,y),x)

Proof

1 Non-Joinable Fork

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

t0 = *(x,s(p(x379)))
2 *(x,x379)
= t1

t0 = *(x,s(p(x379)))
ε +(*(x,p(x379)),x)
= t1

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

Tool configuration

csi