Certificate for #4848 ⟨a, b | ababbbba=abb⟩

Completion settings:

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

Axiom: ababbbba=abb.

Referenced by [3].

Axiom: abb=c.

Defines rule #1.

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

Simplify [1] ababbbba=abb.

Reduce RHS:

Referenced by [4].

Overlap of [3] ababbbba=c with [2] abb=c:

Critical pair: abcbba=c.

Defines rule #2.

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

Overlap of [4] abcbba=c with [2] abb=c:

Critical pair: abcbbc=cbb.

Defines rule #4.

Referenced by [6], [9].

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

Critical pair: abcbbc=cbcbba.

Reduce LHS:

Flip LHS and RHS.

Defines rule #3.

Referenced by [7], [8], [9].

Overlap of [6] cbcbba=cbb with [2] abb=c:

Critical pair: cbcbbc=cbbbb.

Flip LHS and RHS.

Defines rule #5.

Overlap of [6] cbcbba=cbb with [4] abcbba=c:

Critical pair: cbcbbc=cbbbcbba.

Flip LHS and RHS.

Defines rule #6.

Overlap of [6] cbcbba=cbb with [5] abcbbc=cbb:

Critical pair: cbcbbcbb=cbbbcbbc.

Flip LHS and RHS.

Defines rule #7.