Certificate for #27649 ⟨a, b | aa=1, ababba=bbb⟩

Completion settings:

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

Axiom: aa=1.

Defines rule #1.

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

Axiom: ababba=bbb.

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

Overlap of [1] aa=1 with [2] ababba=bbb:

Critical pair: abbb=babba.

Flip LHS and RHS.

Defines rule #3.

Referenced by [5], [6].

Overlap of [2] ababba=bbb with [1] aa=1:

Critical pair: ababb=bbba.

Flip LHS and RHS.

Defines rule #2.

Referenced by [5], [6].

Overlap of [2] ababba=bbb with [3] babba=abbb:

Critical pair: abababbb=bbbbba.

Reduce RHS:

Flip LHS and RHS.

Defines rule #4.

Overlap of [4] bbba=ababb with [3] babba=abbb:

Critical pair: bbabbb=ababbbba.

Reduce RHS:

Flip LHS and RHS.

Referenced by [7].

Overlap of [1] aa=1 with [6] ababababb=bbabbb:

Critical pair: abbabbb=babababb.

Flip LHS and RHS.

Defines rule #5.