Certificate for #5 ⟨
a
,
b
,
c
|
aa
=
b
,
ac
=1⟩
Back:
⟨
a
,
b
,
c
|
aa
=
b
,
ac
=1⟩
Completion settings:
Reduction order:
Left-to-right recursive path with deg(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
[1]
b
=
aa
Axiom:
aa
=
b
.
Flip LHS and RHS.
Defines rule
#2
.
[2]
ac
=1
Axiom:
ac
=1.
Defines rule
#1
.