Certificate for #5269 ⟨a, b, c | aa=b, cbcc=b⟩

Completion settings:

Reduction order:
- Left-to-right recursive path with deg(c) = deg(a) = 0, c < a; deg(b) = 1

Axiom: aa=b.

Flip LHS and RHS.

Defines rule #3.

Referenced by [2].

Axiom: cbcc=b.

Reduce LHS:

[1]	c(b)cc
	⇒ caacc

Reduce RHS:

[1]	(b)
	⇒ aa

Defines rule #1.

Referenced by [3].

caac c caacc

Critical pair: caacaa=aaaacc.

Flip LHS and RHS.

Defines rule #2.