example too hard? - overflow in binomials

[jakobkroeker]

for the normal() result we get an overflow in binomials while the normalC()-result is much nicer:

LIB("normal.lib");
ring rng = (0),(x,y,z,w),dp;
ideal J = -15/22*x^3-2/5*x^3*z^2+47*y*z*w, 53/8*z^2*w^2-6/5*y*w-33/32*x*y^2*z;
def L = primdecGTZ(J);
ASSUME(0, testPrimary(L,J) ); //ok
ideal component   = L[1][2];
component;
idealsEqual( component, radical(component) ); // ok
list  normalResult = normal(component);
list  normalCResult = normalC(component,"withRing");
def R = normalResult[1][1];
def S = normalCResult[1][1];
setring R;
size(std(norid)); // =53
setring S;
size(std(norid)); // =7
setring rng;
intvec testResult = norTest(component, normalCResult); 
intvec testResult = norTest(component, normalResult); //overflow in binomials