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