Certification Problem

Input (COPS 656)

We consider the TRS containing the following rules:

a → f(c) (1)
c → c (2)

The underlying signature is as follows:

{a/0, f/1, c/0}

Property / Task

Prove or disprove confluence.

Answer / Result

Yes.

Proof (by csi @ CoCo 2020)

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.