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