
1
c5xc5
5
1
1
{a, b}
{}
0

7        #compute 5-covering group

9

1
2
 2 0  
 0 1  

 4 1  
 4 0  

0         #number of soluble automorphisms

5         #iteration 
2         #class bound
0         #construct all descendants?
2         #step size  
0         #PAG-generating sequence 

0         #default algorithm?
4         #rank of subgroup
0         #completely process terminal descendants?
0         #exponent law
0         #metabelian law 

1         #default output 

0         
0
