Certificate for #1273 ⟨a, b | abbba=babb⟩

Completion settings:

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

Axiom: abbba=babb.

Referenced by [3].

Axiom: babb=c.

Defines rule #4.

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

Simplify [1] abbba=babb.

Reduce RHS:

Defines rule #5.

Referenced by [5], [6].

Overlap of [2] babb=c with [2] babb=c:

Critical pair: babc=cabb.

Flip LHS and RHS.

Defines rule #3.

Overlap of [3] abbba=c with [2] babb=c:

Critical pair: abbc=cbb.

Flip LHS and RHS.

Defines rule #2.

Overlap of [2] babb=c with [3] abbba=c:

Critical pair: bc=cba.

Flip LHS and RHS.

Defines rule #1.