Certificate for #1581 ⟨a, b, c | aaa=bc, aac=1⟩

Completion settings:

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

Axiom: aaa=bc.

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

Axiom: aac=1.

Referenced by [4], [7].

Overlap of [1] aaa=bc with [1] aaa=bc:

Critical pair: abc=bca.

Flip LHS and RHS.

Referenced by [5].

Overlap of [1] aaa=bc with [2] aac=1:

Critical pair: a=bcc.

Defines rule #4.

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

Simplify [3] bca=abc.

Reduce LHS:

Reduce RHS:

Defines rule #1.

Overlap of [1] aaa=bc with [4] a=bcc:

Critical pair: bccaa=bc.

Reduce LHS:

Defines rule #3.

Overlap of [2] aac=1 with [4] a=bcc:

Critical pair: bccac=1.

Reduce LHS:

Defines rule #2.