(( Leiden University (c) 2002
 ---- Problem ---- 
<	i1	i2	i3	i4	i5	i6	i7	i8	i9	i10><><	C><	j1	j2	BigPar>
 ---- Context ---- 
<	j1	j2	BigPar><	C>
)
10 3 24 4 13 1
(
 ---- lexicoGraphicalOrdering ---- 

 ---- Rest ---- 

#[	0	1	2	4	8	16	32	64	128	256	574	0	3	-511]
#[	0	-1	-2	-4	-8	-16	-32	-64	-128	-256	-574	0	-3	511]
#[	1	0	0	0	0	0	0	0	0	0	0	1	0	-1]
#[	-1	0	0	0	0	0	0	0	0	0	0	-1	0	1]
#[	1	0	0	0	0	0	0	0	0	0	8	0	0	-1]
#[	-1	0	0	0	0	0	0	0	0	0	-1	0	0	1]
#[	0	1	0	0	0	0	0	0	0	0	2	0	0	-1]
#[	0	-1	0	0	0	0	0	0	0	0	-1	0	0	1]
#[	0	0	1	0	0	0	0	0	0	0	2	0	0	-1]
#[	0	0	-1	0	0	0	0	0	0	0	-1	0	0	1]
#[	0	0	0	1	0	0	0	0	0	0	2	0	0	-1]
#[	0	0	0	-1	0	0	0	0	0	0	-1	0	0	1]
#[	0	0	0	0	1	0	0	0	0	0	2	0	0	-1]
#[	0	0	0	0	-1	0	0	0	0	0	-1	0	0	1]
#[	0	0	0	0	0	1	0	0	0	0	2	0	0	-1]
#[	0	0	0	0	0	-1	0	0	0	0	-1	0	0	1]
#[	0	0	0	0	0	0	1	0	0	0	2	0	0	-1]
#[	0	0	0	0	0	0	-1	0	0	0	-1	0	0	1]
#[	0	0	0	0	0	0	0	1	0	0	2	0	0	-1]
#[	0	0	0	0	0	0	0	-1	0	0	-1	0	0	1]
#[	0	0	0	0	0	0	0	0	1	0	2	0	0	-1]
#[	0	0	0	0	0	0	0	0	-1	0	-1	0	0	1]
#[	0	0	0	0	0	0	0	0	0	1	2	0	0	-1]
#[	0	0	0	0	0	0	0	0	0	-1	-1	0	0	1]
)(

#[	-1	0	0	8]
#[	1	0	0	-1]
#[	0	-1	0	128]
#[	0	1	0	-1]
)
)
