Certificate for #4759 ⟨
a
,
b
|
abaaaaab
=
bba
⟩
Back:
⟨
a
,
b
|
abaaaaab
=
bba
⟩
Completion settings:
Reduction order:
Right-to-left recursive path with deg(
a
) = 0; deg(
b
) = 1
[1]
bba
=
abaaaaab
Axiom:
abaaaaab
=
bba
.
Flip LHS and RHS.
Defines rule
#1
.