REFEREE-2 INDEPENDENT VERIFICATION, OWR-14299911-029
order of Gamma: 6
  OK   Gamma = <sigma, iota> has order 6
element orders in Gamma: [1, 2, 3, 3, 6, 6]
  OK   Gamma is cyclic (has an element of order 6)
  OK   all 19 edge orbits have size 6
  OK   the 19 edge orbits are distinct
  OK   |V|=62, |E|=114 (got 62, 114)
  OK   G62 lies in [0,3]^3
  vertex orbits (min rep, size): [('001', 6), ('002', 6), ('003', 6), ('011', 6), ('012', 6), ('013', 6), ('021', 6), ('022', 6), ('023', 6), ('111', 2), ('112', 6)]
  OK   11 vertex orbits
  OK   table reps lie in 11 distinct orbits
  OK   orbit sizes as in Table 1
========================================================================
G62
  |V|,|E|,#squares,#cubes = (62, 114, 54, 1)  chi = 1
  bounding box lo [0, 0, 0] hi [3, 3, 3]
  OK   X(G) is a complex (closed under faces)
  OK   boundary o boundary = 0
  OK   X(G) connected (1 components)
  lattice-adjacent vertex pairs that are not edges: 24
  OK   corners by definition == corners by Lemma 2.1 criteria
  corners: []
  distribution of #maximal cells per vertex: {2: 30, 3: 6, 4: 18, 6: 6, 7: 2}
  OK   Betti numbers over GF(2) = (1, 0, 0, 0)
  OK   Betti numbers over GF(3) = (1, 0, 0, 0)
  OK   Betti numbers over GF(5) = (1, 0, 0, 0)
  OK   Betti numbers over GF(7) = (1, 0, 0, 0)
  OK   Betti numbers over GF(10007) = (1, 0, 0, 0)
  OK   Betti numbers over GF(1000003) = (1, 0, 0, 0)
  OK   integer homology = point: [(1, []), (0, []), (0, []), (0, [])]
  OK   X(G) collapses to a vertex (greedy, 115 elementary collapses, 0 restarts)
  OK   collapse sequence replayed from scratch; final vertex 332
  OK   section x0=0/2 is a planar complex
  OK   section x0=1/2 is a planar complex
  OK   section x0=2/2 is a planar complex
  OK   section x0=3/2 is a planar complex
  OK   section x0=4/2 is a planar complex
  OK   section x0=5/2 is a planar complex
  OK   section x0=6/2 is a planar complex
  OK   section x1=0/2 is a planar complex
  OK   section x1=1/2 is a planar complex
  OK   section x1=2/2 is a planar complex
  OK   section x1=3/2 is a planar complex
  OK   section x1=4/2 is a planar complex
  OK   section x1=5/2 is a planar complex
  OK   section x1=6/2 is a planar complex
  OK   section x2=0/2 is a planar complex
  OK   section x2=1/2 is a planar complex
  OK   section x2=2/2 is a planar complex
  OK   section x2=3/2 is a planar complex
  OK   section x2=4/2 is a planar complex
  OK   section x2=5/2 is a planar complex
  OK   section x2=6/2 is a planar complex
  OK   every piece in every direction (alpha in Z/2) has chi=1, H_1=0 (GF2,GF10007) and greedy-collapses to a point (21 pieces)
  number of pieces: 21  number of sections: 21
   dir x 0:(15,17,3) 1/2:(14,13,0) 1:(16,21,6) 3/2:(10,10,1) 2:(16,21,6) 5/2:(14,13,0) 3:(15,17,3)
   dir y 0:(15,17,3) 1/2:(14,13,0) 1:(16,21,6) 3/2:(10,10,1) 2:(16,21,6) 5/2:(14,13,0) 3:(15,17,3)
   dir z 0:(15,17,3) 1/2:(14,13,0) 1:(16,21,6) 3/2:(10,10,1) 2:(16,21,6) 5/2:(14,13,0) 3:(15,17,3)
  OK   graph invariant under the generators
  order of the stabiliser of G in the 48 symmetries of [0,3]^3: 6
  OK   cell counts (62,114,54,1)
  OK   the unique cube is [1,2]^3
  OK   the 9 listed square orbits have size 6 and give exactly the 54 squares
  OK   exactly 24 lattice-adjacent pairs are non-edges (got 24)
  OK   non-edges = the Gamma-orbits of 002-102, 011-021, 012-022, 013-023
  non-edges: 002-102 011-021 012-022 013-023 020-021 031-032 101-102 103-203 110-210 113-213 120-220 123-133 123-223 130-230 131-132 200-210 201-202 231-232 231-331 301-302 310-320 311-321 312-313 312-322
  OK   induced subgraph on V(G62) has 12 corners = orbits of 001 and 003 (got 12)
  induced graph on V(G62): counts (62, 138, 102, 25)
  OK   table row 001: edges +x +y +z, spanned cube lacks ['002-102', '101-102']
  OK   table row 002: edges +y +z -z, opposite neighbours in z
  OK   table row 003: edges +x +y -z, spanned cube lacks ['002-102']
  OK   table row 011: edges +x -y +z -z, opposite neighbours in z
  OK   table row 012: edges +x -y +z -z, opposite neighbours in z
  OK   table row 013: edges +x -y -z, spanned cube lacks ['002-102']
  OK   table row 021: edges +x +y +z, spanned cube lacks ['031-032', '131-132']
  OK   table row 022: edges +x +y +z -z, opposite neighbours in z
  OK   table row 023: edges +x +y -z, spanned cube lacks ['123-133']
  OK   table row 111: edges +x -x +y -y +z -z, opposite neighbours in xyz
  OK   table row 112: edges +x -x +y -y +z -z, opposite neighbours in xyz
  OK   Figure 1: x=0 section has (V,E,F)=(15, 17, 3), 1 piece(s)
  OK   Figure 1: x=1/2 section has (V,E,F)=(14, 13, 0), 1 piece(s)
  OK   Figure 1: x=1 section has (V,E,F)=(16, 21, 6), 1 piece(s)
  OK   Figure 1: x=3/2 section has (V,E,F)=(10, 10, 1), 1 piece(s)
  OK   every section of X(G62) is a single piece
  OK   all seven x-sections alpha=0..3 nonempty
  OK   bottom face of the cube [1,2]^3 is a free face (only coface: the cube)
  condition (3) for G62:
   dir x alpha=1/2: piece|V|=14 N-NOT N+NOT  -> violates (3)
   dir x alpha=3/2: piece|V|=10 N-iso N+iso  -> satisfies (3)
   dir x alpha=5/2: piece|V|=14 N-NOT N+NOT  -> violates (3)
   dir y alpha=1/2: piece|V|=14 N-NOT N+NOT  -> violates (3)
   dir y alpha=3/2: piece|V|=10 N-iso N+iso  -> satisfies (3)
   dir y alpha=5/2: piece|V|=14 N-NOT N+NOT  -> violates (3)
   dir z alpha=1/2: piece|V|=14 N-NOT N+NOT  -> violates (3)
   dir z alpha=3/2: piece|V|=10 N-iso N+iso  -> satisfies (3)
   dir z alpha=5/2: piece|V|=14 N-NOT N+NOT  -> violates (3)
  distance 001..003 in piece x=0: 2; in half-carrier N^-(H), H at x=1/2: 4
  OK   the (3)-violation example 001/003 (2 vs 4)
  OK   002 has no edge in direction x
  OK   Gamma' has order 6
  OK   Gamma' cyclic
  OK   orbit sizes: 12 orbits of 6 and 222 fixed
  OK   13 point orbits distinct
  OK   |V73| = 73
  OK   H73 has 132 edges (got 132)
  OK   132 edges in 22 orbits of size 6
  OK   H73 lies in [0,4]^3
========================================================================
H73
  |V|,|E|,#squares,#cubes = (73, 132, 60, 0)  chi = 1
  bounding box lo [0, 0, 0] hi [4, 4, 4]
  OK   X(G) is a complex (closed under faces)
  OK   boundary o boundary = 0
  OK   X(G) connected (1 components)
  lattice-adjacent vertex pairs that are not edges: 0
  OK   graph is induced
  OK   corners by definition == corners by Lemma 2.1 criteria
  corners: []
  OK   induced version of Lemma 2.1 agrees
  distribution of #maximal cells per vertex: {2: 18, 3: 30, 4: 18, 6: 7}
  OK   Betti numbers over GF(2) = (1, 0, 0, 0)
  OK   Betti numbers over GF(3) = (1, 0, 0, 0)
  OK   Betti numbers over GF(5) = (1, 0, 0, 0)
  OK   Betti numbers over GF(7) = (1, 0, 0, 0)
  OK   Betti numbers over GF(10007) = (1, 0, 0, 0)
  OK   Betti numbers over GF(1000003) = (1, 0, 0, 0)
  OK   integer homology = point: [(1, []), (0, []), (0, []), (0, [])]
  OK   X(G) collapses to a vertex (greedy, 132 elementary collapses, 0 restarts)
  OK   collapse sequence replayed from scratch; final vertex 441
  OK   section x0=0/2 is a planar complex
  OK   section x0=1/2 is a planar complex
  OK   section x0=2/2 is a planar complex
  OK   section x0=3/2 is a planar complex
  OK   section x0=4/2 is a planar complex
  OK   section x0=5/2 is a planar complex
  OK   section x0=6/2 is a planar complex
  OK   section x0=7/2 is a planar complex
  OK   section x0=8/2 is a planar complex
  OK   section x1=0/2 is a planar complex
  OK   section x1=1/2 is a planar complex
  OK   section x1=2/2 is a planar complex
  OK   section x1=3/2 is a planar complex
  OK   section x1=4/2 is a planar complex
  OK   section x1=5/2 is a planar complex
  OK   section x1=6/2 is a planar complex
  OK   section x1=7/2 is a planar complex
  OK   section x1=8/2 is a planar complex
  OK   section x2=0/2 is a planar complex
  OK   section x2=1/2 is a planar complex
  OK   section x2=2/2 is a planar complex
  OK   section x2=3/2 is a planar complex
  OK   section x2=4/2 is a planar complex
  OK   section x2=5/2 is a planar complex
  OK   section x2=6/2 is a planar complex
  OK   section x2=7/2 is a planar complex
  OK   section x2=8/2 is a planar complex
  OK   every piece in every direction (alpha in Z/2) has chi=1, H_1=0 (GF2,GF10007) and greedy-collapses to a point (27 pieces)
  number of pieces: 27  number of sections: 27
   dir x 0:(15,18,4) 1/2:(13,12,0) 1:(15,18,4) 3/2:(9,8,0) 2:(13,16,4) 5/2:(9,8,0) 3:(15,18,4) 7/2:(13,12,0) 4:(15,18,4)
   dir y 0:(15,18,4) 1/2:(13,12,0) 1:(15,18,4) 3/2:(9,8,0) 2:(13,16,4) 5/2:(9,8,0) 3:(15,18,4) 7/2:(13,12,0) 4:(15,18,4)
   dir z 0:(15,18,4) 1/2:(13,12,0) 1:(15,18,4) 3/2:(9,8,0) 2:(13,16,4) 5/2:(9,8,0) 3:(15,18,4) 7/2:(13,12,0) 4:(15,18,4)
  OK   graph invariant under the generators
  order of the stabiliser of G in the 48 symmetries of [0,4]^3: 12
  OK   cell counts (73,132,60,0)
  OK   the 10 listed square orbits give exactly the 60 squares
  OK   table row 003: edges +x +y +z, spanned cube lacks ['114']
  OK   table row 004: edges +x +y -z, spanned cube lacks ['114']
  OK   table row 013: edges +x +y -y +z, opposite neighbours in y
  OK   table row 014: edges +y -y -z, opposite neighbours in y
  OK   table row 023: edges +x -y +z, spanned cube lacks ['114']
  OK   table row 024: edges +x +y -y -z, opposite neighbours in y
  OK   table row 031: edges +x +y +z -z, opposite neighbours in z
  OK   table row 032: edges +x +y -z, spanned cube lacks ['141']
  OK   table row 034: edges +x +y -y, opposite neighbours in y
  OK   table row 113: edges +x -x +y -y, opposite neighbours in xy
  OK   table row 122: edges +x +y +z, spanned cube lacks ['233']
  OK   table row 123: edges +x -x +y -y +z -z, opposite neighbours in xyz
  OK   table row 222: edges +x -x +y -y +z -z, opposite neighbours in xyz
  OK   Figure 2: x=0 section has (V,E,F)=(15, 18, 4), 1 piece(s)
  OK   Figure 2: x=1/2 section has (V,E,F)=(13, 12, 0), 1 piece(s)
  OK   Figure 2: x=1 section has (V,E,F)=(15, 18, 4), 1 piece(s)
  OK   Figure 2: x=3/2 section has (V,E,F)=(9, 8, 0), 1 piece(s)
  OK   Figure 2: x=2 section has (V,E,F)=(13, 16, 4), 1 piece(s)
  OK   every section of X(H73) is a single piece
  condition (3) for H73:
   dir x alpha=1/2: piece|V|=13 N-NOT N+NOT  -> violates (3)
   dir x alpha=3/2: piece|V|=9 N-iso N+iso  -> satisfies (3)
   dir x alpha=5/2: piece|V|=9 N-iso N+iso  -> satisfies (3)
   dir x alpha=7/2: piece|V|=13 N-NOT N+NOT  -> violates (3)
   dir y alpha=1/2: piece|V|=13 N-NOT N+NOT  -> violates (3)
   dir y alpha=3/2: piece|V|=9 N-iso N+iso  -> satisfies (3)
   dir y alpha=5/2: piece|V|=9 N-iso N+iso  -> satisfies (3)
   dir y alpha=7/2: piece|V|=13 N-NOT N+NOT  -> violates (3)
   dir z alpha=1/2: piece|V|=13 N-NOT N+NOT  -> violates (3)
   dir z alpha=3/2: piece|V|=9 N-iso N+iso  -> satisfies (3)
   dir z alpha=5/2: piece|V|=9 N-iso N+iso  -> satisfies (3)
   dir z alpha=7/2: piece|V|=13 N-NOT N+NOT  -> violates (3)
  G62^(2): counts (231, 450, 228, 8)
  OK   G62^(2): X(G^(2)) equals the subdivision of 2X(G), cell by cell
  OK   G62^(2): each code p(c) lies in 2^d m(c) maximal cells
  OK   G62^(2): corners are exactly 2v, v a corner of X(G)
  OK   G62^(2): sections of X(G^(2)) are the subdivided doubles of those of X(G) (piece counts, Betti numbers)
  OK   G62^(2) has (231, 450, 228, 8) cells
  OK   G62^(2) lies in [0,6]^3
========================================================================
G62^(2)
  |V|,|E|,#squares,#cubes = (231, 450, 228, 8)  chi = 1
  bounding box lo [0, 0, 0] hi [6, 6, 6]
  OK   X(G) is a complex (closed under faces)
  OK   boundary o boundary = 0
  OK   X(G) connected (1 components)
  lattice-adjacent vertex pairs that are not edges: 0
  OK   graph is induced
  OK   corners by definition == corners by Lemma 2.1 criteria
  corners: []
  OK   induced version of Lemma 2.1 agrees
  distribution of #maximal cells per vertex: {2: 66, 3: 6, 4: 138, 6: 18, 7: 2, 8: 1}
  OK   Betti numbers over GF(2) = (1, 0, 0, 0)
  OK   Betti numbers over GF(3) = (1, 0, 0, 0)
  OK   Betti numbers over GF(5) = (1, 0, 0, 0)
  OK   Betti numbers over GF(7) = (1, 0, 0, 0)
  OK   Betti numbers over GF(10007) = (1, 0, 0, 0)
  OK   Betti numbers over GF(1000003) = (1, 0, 0, 0)
  OK   integer homology = point: [(1, []), (0, []), (0, []), (0, [])]
  OK   X(G) collapses to a vertex (greedy, 458 elementary collapses, 0 restarts)
  OK   collapse sequence replayed from scratch; final vertex 664
  OK   section x0=0/2 is a planar complex
  OK   section x0=1/2 is a planar complex
  OK   section x0=2/2 is a planar complex
  OK   section x0=3/2 is a planar complex
  OK   section x0=4/2 is a planar complex
  OK   section x0=5/2 is a planar complex
  OK   section x0=6/2 is a planar complex
  OK   section x0=7/2 is a planar complex
  OK   section x0=8/2 is a planar complex
  OK   section x0=9/2 is a planar complex
  OK   section x0=10/2 is a planar complex
  OK   section x0=11/2 is a planar complex
  OK   section x0=12/2 is a planar complex
  OK   section x1=0/2 is a planar complex
  OK   section x1=1/2 is a planar complex
  OK   section x1=2/2 is a planar complex
  OK   section x1=3/2 is a planar complex
  OK   section x1=4/2 is a planar complex
  OK   section x1=5/2 is a planar complex
  OK   section x1=6/2 is a planar complex
  OK   section x1=7/2 is a planar complex
  OK   section x1=8/2 is a planar complex
  OK   section x1=9/2 is a planar complex
  OK   section x1=10/2 is a planar complex
  OK   section x1=11/2 is a planar complex
  OK   section x1=12/2 is a planar complex
  OK   section x2=0/2 is a planar complex
  OK   section x2=1/2 is a planar complex
  OK   section x2=2/2 is a planar complex
  OK   section x2=3/2 is a planar complex
  OK   section x2=4/2 is a planar complex
  OK   section x2=5/2 is a planar complex
  OK   section x2=6/2 is a planar complex
  OK   section x2=7/2 is a planar complex
  OK   section x2=8/2 is a planar complex
  OK   section x2=9/2 is a planar complex
  OK   section x2=10/2 is a planar complex
  OK   section x2=11/2 is a planar complex
  OK   section x2=12/2 is a planar complex
  OK   every piece in every direction (alpha in Z/2) has chi=1, H_1=0 (GF2,GF10007) and greedy-collapses to a point (39 pieces)
  number of pieces: 39  number of sections: 39
  order of the stabiliser of G in the 48 symmetries of [0,6]^3: 6
========================================================================
T12
  |V|,|E|,#squares,#cubes = (12, 19, 8, 0)  chi = 1
  bounding box lo [0, 0, 0] hi [2, 1, 1]
  OK   X(G) is a complex (closed under faces)
  OK   boundary o boundary = 0
  OK   X(G) connected (1 components)
  lattice-adjacent vertex pairs that are not edges: 1
  OK   corners by definition == corners by Lemma 2.1 criteria
  corners: []
  distribution of #maximal cells per vertex: {2: 6, 3: 4, 4: 2}
  OK   Betti numbers over GF(2) = (1, 0, 0, 0)
  OK   Betti numbers over GF(3) = (1, 0, 0, 0)
  OK   Betti numbers over GF(5) = (1, 0, 0, 0)
  OK   Betti numbers over GF(7) = (1, 0, 0, 0)
  OK   Betti numbers over GF(10007) = (1, 0, 0, 0)
  OK   Betti numbers over GF(1000003) = (1, 0, 0, 0)
  OK   integer homology = point: [(1, []), (0, []), (0, []), (0, [])]
  OK   X(G) collapses to a vertex (greedy, 19 elementary collapses, 0 restarts)
  OK   collapse sequence replayed from scratch; final vertex 211
  OK   section x0=0/2 is a planar complex
  OK   section x0=1/2 is a planar complex
  OK   section x0=2/2 is a planar complex
  OK   section x0=3/2 is a planar complex
  OK   section x0=4/2 is a planar complex
  OK   section x1=0/2 is a planar complex
  OK   section x1=1/2 is a planar complex
  OK   section x1=2/2 is a planar complex
  OK   section x2=0/2 is a planar complex
  OK   section x2=1/2 is a planar complex
  OK   section x2=2/2 is a planar complex
  INFO 2 bad pieces (expected): every piece in every direction (alpha in Z/2) has chi=1, H_1=0 (GF2,GF10007) and greedy-collapses to a point (11 pieces)
     bad piece (1, 0, (6, 6, 0), 0, (1, 1, 0, 0), (1, 1, 0, 0), False)
     bad piece (1, 1, (6, 6, 0), 0, (1, 1, 0, 0), (1, 1, 0, 0), False)
  number of pieces: 11  number of sections: 11
   dir x 0:(4,4,1) 1/2:(4,3,0) 1:(4,3,0) 3/2:(4,3,0) 2:(4,4,1)
   dir y 0:(6,6,0) 1/2:(6,6,0) 1:(6,7,2)
   dir z 0:(6,7,2) 1/2:(5,4,0) 1:(6,7,2)
  order of the stabiliser of G in the 48 symmetries of [0,2]^3: 2
  OK   X(T12) = the 8 boundary squares not in the face y=0
  OK   X(T12) has no cube
  OK   T12 cornerless, every vertex in >= 2 maximal cells
  OK   X(T12) is a surface with boundary, chi=1
  OK   boundary of X(T12) is one hexagon (disk)
   T12 dir x alpha=0 piece (V,E,F)=(4,4,1) collapsible=True hexagon=False
  OK   T12 x-piece at 0 collapsible
   T12 dir x alpha=1/2 piece (V,E,F)=(4,3,0) collapsible=True hexagon=False
  OK   T12 x-piece at 1/2 collapsible
   T12 dir x alpha=1 piece (V,E,F)=(4,3,0) collapsible=True hexagon=False
  OK   T12 x-piece at 1 collapsible
   T12 dir x alpha=3/2 piece (V,E,F)=(4,3,0) collapsible=True hexagon=False
  OK   T12 x-piece at 3/2 collapsible
   T12 dir x alpha=2 piece (V,E,F)=(4,4,1) collapsible=True hexagon=False
  OK   T12 x-piece at 2 collapsible
   T12 dir y alpha=0 piece (V,E,F)=(6,6,0) collapsible=False hexagon=True
  OK   T12 y-piece at 0 is a hexagon
   T12 dir y alpha=1/2 piece (V,E,F)=(6,6,0) collapsible=False hexagon=True
  OK   T12 y-piece at 1/2 is a hexagon
   T12 dir y alpha=1 piece (V,E,F)=(6,7,2) collapsible=True hexagon=False
   T12 dir z alpha=0 piece (V,E,F)=(6,7,2) collapsible=True hexagon=False
  OK   T12 z-piece at 0 collapsible
   T12 dir z alpha=1/2 piece (V,E,F)=(5,4,0) collapsible=True hexagon=False
  OK   T12 z-piece at 1/2 collapsible
   T12 dir z alpha=1 piece (V,E,F)=(6,7,2) collapsible=True hexagon=False
  OK   T12 z-piece at 1 collapsible
  condition (3) for T12:
   dir x alpha=1/2: piece|V|=4 N-NOT N+iso  -> violates (3)
   dir x alpha=3/2: piece|V|=4 N-iso N+NOT  -> violates (3)
   dir y alpha=1/2: piece|V|=6 N-iso N+NOT  -> violates (3)
   dir z alpha=1/2: piece|V|=5 N-NOT N+NOT  -> violates (3)
  T12^(2): counts (39, 70, 32, 0)
  OK   T12^(2): X(G^(2)) equals the subdivision of 2X(G), cell by cell
  OK   T12^(2): each code p(c) lies in 2^d m(c) maximal cells
  OK   T12^(2): corners are exactly 2v, v a corner of X(G)
  OK   T12^(2): sections of X(G^(2)) are the subdivided doubles of those of X(G) (piece counts, Betti numbers)
  OK   T12^(2) has 39 vertices, 70 edges, 32 squares (got (39, 70, 32, 0))
========================================================================
T12^(2)
  |V|,|E|,#squares,#cubes = (39, 70, 32, 0)  chi = 1
  bounding box lo [0, 0, 0] hi [4, 2, 2]
  OK   X(G) is a complex (closed under faces)
  OK   boundary o boundary = 0
  OK   X(G) connected (1 components)
  lattice-adjacent vertex pairs that are not edges: 0
  OK   graph is induced
  OK   corners by definition == corners by Lemma 2.1 criteria
  corners: []
  OK   induced version of Lemma 2.1 agrees
  distribution of #maximal cells per vertex: {2: 12, 3: 4, 4: 23}
  OK   Betti numbers over GF(2) = (1, 0, 0, 0)
  OK   Betti numbers over GF(3) = (1, 0, 0, 0)
  OK   Betti numbers over GF(5) = (1, 0, 0, 0)
  OK   Betti numbers over GF(7) = (1, 0, 0, 0)
  OK   Betti numbers over GF(10007) = (1, 0, 0, 0)
  OK   Betti numbers over GF(1000003) = (1, 0, 0, 0)
  OK   integer homology = point: [(1, []), (0, []), (0, []), (0, [])]
  OK   X(G) collapses to a vertex (greedy, 70 elementary collapses, 0 restarts)
  OK   collapse sequence replayed from scratch; final vertex 422
  OK   section x0=0/2 is a planar complex
  OK   section x0=1/2 is a planar complex
  OK   section x0=2/2 is a planar complex
  OK   section x0=3/2 is a planar complex
  OK   section x0=4/2 is a planar complex
  OK   section x0=5/2 is a planar complex
  OK   section x0=6/2 is a planar complex
  OK   section x0=7/2 is a planar complex
  OK   section x0=8/2 is a planar complex
  OK   section x1=0/2 is a planar complex
  OK   section x1=1/2 is a planar complex
  OK   section x1=2/2 is a planar complex
  OK   section x1=3/2 is a planar complex
  OK   section x1=4/2 is a planar complex
  OK   section x2=0/2 is a planar complex
  OK   section x2=1/2 is a planar complex
  OK   section x2=2/2 is a planar complex
  OK   section x2=3/2 is a planar complex
  OK   section x2=4/2 is a planar complex
  INFO 4 bad pieces (expected): every piece in every direction (alpha in Z/2) has chi=1, H_1=0 (GF2,GF10007) and greedy-collapses to a point (19 pieces)
     bad piece (1, 0, (12, 12, 0), 0, (1, 1, 0, 0), (1, 1, 0, 0), False)
     bad piece (1, 1, (12, 12, 0), 0, (1, 1, 0, 0), (1, 1, 0, 0), False)
     bad piece (1, 2, (12, 12, 0), 0, (1, 1, 0, 0), (1, 1, 0, 0), False)
     bad piece (1, 3, (12, 12, 0), 0, (1, 1, 0, 0), (1, 1, 0, 0), False)
  number of pieces: 19  number of sections: 19
  order of the stabiliser of G in the 48 symmetries of [0,4]^3: 2
========================================================================
FAILURES: 0
