Singular

Hi,

I'm trying to compute the Jordan structure of monodromy for a moderately complicated function. After one-night-work Singular was still in the process. Is there some way to speed up?

here's my code:

LIB "sing.lib";
LIB "gmssing.lib";
ring r=0,(x,y,z),ds;
int t=3;
poly g=y^2*(x+z-y)^2*z^2+(x+y)*(y+3x-z)*(x+z-t*y)*(x-t*y-7z)*(11x+y-z)*(x+3y);
poly f=g+x^7+y^7+z^7;
milnor(f);
monodromy(f);

Unfortunately gmssing.lib enforces zero characteristic. Any other tricks?