Certificate for #19699 ⟨a, b | aba=a, bbabb=ab⟩

Completion settings:

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

Axiom: aba=a.

Defines rule #2.

Referenced by [3], [5], [6].

Axiom: bbabb=ab.

Referenced by [3], [4], [6].

Overlap of [2] bbabb=ab with [2] bbabb=ab:

Critical pair: bbabab=abbabb.

Reduce LHS:

Reduce RHS:

Referenced by [4], [5].

Overlap of [2] bbabb=ab with [3] bbab=aab:

Critical pair: aabb=ab.

Referenced by [7].

Overlap of [3] bbab=aab with [1] aba=a:

Critical pair: bba=aaba.

Reduce RHS:

Defines rule #3.

Referenced by [6].

Overlap of [2] bbabb=ab with [5] bba=aa:

Critical pair: bbaaa=aba.

Reduce LHS:

Reduce RHS:

Defines rule #1.

Referenced by [7].

Overlap of [6] aaaa=a with [4] aabb=ab:

Critical pair: aaab=abb.

Flip LHS and RHS.

Defines rule #4.