YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

Ap(Ap(Ap(S,x),y),z) Ap(Ap(x,z),Ap(y,z))
Ap(Ap(K,x),y) x
Ap(I,x) x

Proof

1 Critical Pair Closing System

Confluence is proven using the following terminating critical-pair-closing-system R:

There are no rules.

1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.

Tool configuration

csi