Certificate for #25189 ⟨a, b | aa=a, ababa=bbb⟩

Completion settings:

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

Axiom: aa=a.

Defines rule #1.

Referenced by [4].

Axiom: ababa=bbb.

Flip LHS and RHS.

Defines rule #2.

Referenced by [3].

Overlap of [2] bbb=ababa with [2] bbb=ababa:

Critical pair: bababa=ababab.

Flip LHS and RHS.

Defines rule #3.

Referenced by [4].

Overlap of [3] ababab=bababa with [3] ababab=bababa:

Critical pair: abbababa=bababaab.

Reduce RHS:

Defines rule #4.