[GAP Forum] free nilpotent p-groups?

[Laurent Bartholdi]

dear forum,
i'm a bit surprised by the performance of calculations in free
nilpotent p-groups:
in the following code, computation takes forever. if i replace p by a
smaller prime, like 601, it's sluggish, while for really small primes
it's blindingly fast.
i was under the impression that computational time should scale
logarithmically in p. can anybody help me out?

LoadPackage("anupq");
p := 1201;
r := 3;
n := 4;
F := FreeGroup(r);
F := F / List(GeneratorsOfGroup(F),g->g^p);
F := Pq(F : Prime := p, ClassBound := n+1);
Print("alive\n");
Print("F1^-1*F3=",F.1^-1*F.3,"\n");
Print("F3^-1*F1=",F.3^-1*F.1,"\n (never reached!)");

-- 
Laurent Bartholdi          \  laurent.bartholdi<at>gmail<dot>com
EPFL SB SMA IMB MAD         \    Téléphone: +41 21-6935458
Station 8                    \ Secrétaire: +41 21-6935501
CH-1015 Lausanne, Switzerland \      Fax: +41 21-6930339