gap> Read("/home/math6/wdj/gap/games/grpdata.g");
gap> RequirePackage("grape");

Loading  GRAPE 2.2  (GRaph Algorithms using PErmutation groups),
by L.H.Soicher@qmw.ac.uk.

gap> CayleyGraph := function(G)
> local adjacent;
> adjacent:= function(x,y) 
> return x*y^-1 in G.generators;
> end;
> return Graph(G,Elements(G),OnRight,adjacent,true);
> end;
function ( G ) ... end
gap> G0:=Group(r1,r2,r3,r4,f1,f2,f3,f4);
Group( (1,2,3,4,5,6,7,8), ( 9,10,11,12,13,14,15,16), (17,18,19,20,21,22,23,24
 ), (25,26,27,28,29,30,31,32), ( 1,28)( 2,27)( 3,26)( 4,25)( 9,20)(10,19)
(11,18)(12,17), ( 2,29)( 3,28)( 4,27)( 5,26)(10,21)(11,22)(12,23)(13,24), 
( 3,30)( 4,29)( 5,28)( 6,27)(11,22)(12,21)(13,20)(14,19), ( 4,31)( 5,30)
( 6,29)( 7,28)(12,23)(13,22)(14,21)(15,20) )
gap> G1:=Group(r1,r2,r3,r4);
Group( (1,2,3,4,5,6,7,8), ( 9,10,11,12,13,14,15,16), (17,18,19,20,21,22,23,24
 ), (25,26,27,28,29,30,31,32) )
gap> G2:=group(f1,f2,f3,f4);
Error, Variable: 'group' must have a value
gap> G2:=Group(f1,f2,f3,f4);
Group( ( 1,28)( 2,27)( 3,26)( 4,25)( 9,20)(10,19)(11,18)(12,17), ( 2,29)
( 3,28)( 4,27)( 5,26)(10,21)(11,22)(12,23)(13,24), ( 3,30)( 4,29)( 5,28)
( 6,27)(11,22)(12,21)(13,20)(14,19), ( 4,31)( 5,30)( 6,29)( 7,28)(12,23)
(13,22)(14,21)(15,20) )
gap> 
gap> Size(G0);
437763136697395052544000000
gap> Size(G1);
4096
gap> Size(G2);
128024064000
gap> gamma1:=CayleyGraph(G1);