Certificate for #1970 ⟨a, b | aababbaa=ab⟩

Completion settings:

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

Axiom: aababbaa=ab.

Referenced by [3].

Axiom: ab=c.

Defines rule #1.

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

Simplify [1] aababbaa=ab.

Reduce RHS:

Referenced by [4].

Overlap of [3] aababbaa=c with [2] ab=c:

Critical pair: acabbaa=c.

Reduce LHS:

Defines rule #7.

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

Overlap of [4] accbaa=c with [2] ab=c:

Critical pair: accbac=cb.

Defines rule #3.

Referenced by [6], [7], [8], [9], [10], [11].

Overlap of [4] accbaa=c with [4] accbaa=c:

Critical pair: accbac=cccbaa.

Reduce LHS:

Flip LHS and RHS.

Defines rule #4.

Referenced by [10], [11].

Overlap of [4] accbaa=c with [5] accbac=cb:

Critical pair: accbacb=cccbac.

Reduce LHS:

Defines rule #2.

Referenced by [10].

Overlap of [5] accbac=cb with [4] accbaa=c:

Critical pair: accbc=cbcbaa.

Flip LHS and RHS.

Defines rule #8.

Overlap of [5] accbac=cb with [5] accbac=cb:

Critical pair: accbcb=cbcbac.

Flip LHS and RHS.

Defines rule #5.

Overlap of [5] accbac=cb with [6] cccbaa=cb:

Critical pair: accbacb=cbccbaa.

Reduce LHS:

Flip LHS and RHS.

Defines rule #9.

Overlap of [6] cccbaa=cb with [5] accbac=cb:

Critical pair: cccbacb=cbccbac.

Flip LHS and RHS.

Defines rule #6.