Certificate for #899 ⟨a, b | aaabaaa=ab⟩

Completion settings:

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

Axiom: aaabaaa=ab.

Referenced by [3].

Axiom: ab=c.

Defines rule #4.

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

Simplify [1] aaabaaa=ab.

Reduce RHS:

Referenced by [4].

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

Critical pair: aacaaa=c.

Defines rule #2.

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

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

Critical pair: aacaac=cb.

Flip LHS and RHS.

Defines rule #5.

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

Critical pair: aacac=ccaaa.

Flip LHS and RHS.

Defines rule #1.

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

Critical pair: aacaac=cacaaa.

Flip LHS and RHS.

Defines rule #3.