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