Certificate for #1065 ⟨a, b | aabaab=baa⟩

Completion settings:

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

Axiom: aabaab=baa.

Referenced by [3].

Axiom: baa=c.

Defines rule #4.

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

Simplify [1] aabaab=baa.

Reduce RHS:

Referenced by [4].

Overlap of [3] aabaab=c with [2] baa=c:

Critical pair: aacb=c.

Defines rule #3.

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

Overlap of [2] baa=c with [4] aacb=c:

Critical pair: bc=ccb.

Flip LHS and RHS.

Defines rule #1.

Overlap of [2] baa=c with [4] aacb=c:

Critical pair: bac=cacb.

Flip LHS and RHS.

Defines rule #2.

Overlap of [4] aacb=c with [2] baa=c:

Critical pair: aacc=caa.

Flip LHS and RHS.

Defines rule #5.