% 5braid_0
r1.r2.r3.r4
x0.x0.x1.x1.x0.x0.x0.x1.x1.x0.x2.x1.x1.x3.x3.x2.x0.x0.
x1.x1.x0.x0.x0.x1.x1.x1.x0.x0.x2.x1.x1.x3.x3.x3.x2.x2.
u4.u3.u2.u1
,1
% the intermediate complex for this presentation reaches more than 27000 generators in step 32/43. That step took 2h43min13s in the optimized version -O3. The program took up more than 1 GB in memory at that point. So we need to optimize by precomputing the algebra.
% Simplifies with options '' to r0.y1.r2.x1.x1.r3.x4.x0.x0.x0.x1.x1.x0.x2.x1.x1.r3.y4.x6.x7.x5.x5.x3.y4.u5.x5.x4.y3.u2.x0.x0.x1.x1.x0.x0.x0.x1.x1.x1.x0.u2.y1.u0
% Simplifies with options '' to r0.y1.r1.y2.x1.x0.x0.x0.x1.x1.r3.x2.x4.x4.r3.y4.x5.x5.x5.x0.x1.x3.u4.x1.x2.y3.x0.x0.x1.x1.x0.x5.x5.u4.x0.x0.x1.x1.y2.u1.x0.y1.u0