Independent generated check. This module provides an additional generated proof of row 06 and is not imported by the main LowGenus root.

Generated exact replay of the fixed AR row-06 divisor on a fundamental domain for the core's slot-level symmetry group.

The external discovery data are untrusted: cells_check and tree_check replay every arithmetic obligation in the kernel, and the chamber is discharged by the generated coverage theorem, so the conclusion is the row on the whole closed orthant.

def AtanasovRanganathan.GenusFiveRow06FixedCover.cells : List (GenusFiveClosedCover.CoordinateCell GenusFiveCoreAtlas.row06Core)

The 483 row-06 closed-cover cells in global index order, obtained by concatenating the five certificate blocks.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.cells_check : (cells.all fun (cell : GenusFiveClosedCover.CoordinateCell GenusFiveCoreAtlas.row06Core) => cell.certificate.checkClosed 4) = true

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.cells_valid (cell : GenusFiveClosedCover.CoordinateCell GenusFiveCoreAtlas.row06Core) : cell ∈ cells → cell.certificate.ValidClosed 4

def AtanasovRanganathan.GenusFiveRow06FixedCover.base : List (Utilities.Certificate.ExplicitPotential.AffineForm 12)

The twelve root rows of the closed orthant followed by the six chamber inequalities cutting the fundamental domain.

Equations

• One or more equations did not get rendered due to their size.

def AtanasovRanganathan.GenusFiveRow06FixedCover.splitForms : List (Utilities.Certificate.ExplicitPotential.AffineForm 12)

The 37 homogeneous affine forms whose signs determine branches of the row-06 decision tree; coefficients are indexed by the twelve edge lengths.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm0 : splitForms.getD 0 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm1 : splitForms.getD 1 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm2 : splitForms.getD 2 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm3 : splitForms.getD 3 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm4 : splitForms.getD 4 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm5 : splitForms.getD 5 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm6 : splitForms.getD 6 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm7 : splitForms.getD 7 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm8 : splitForms.getD 8 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm9 : splitForms.getD 9 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm10 : splitForms.getD 10 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm11 : splitForms.getD 11 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm12 : splitForms.getD 12 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm13 : splitForms.getD 13 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm14 : splitForms.getD 14 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm15 : splitForms.getD 15 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm16 : splitForms.getD 16 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm17 : splitForms.getD 17 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm18 : splitForms.getD 18 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm19 : splitForms.getD 19 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm20 : splitForms.getD 20 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm21 : splitForms.getD 21 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm22 : splitForms.getD 22 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm23 : splitForms.getD 23 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm24 : splitForms.getD 24 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm25 : splitForms.getD 25 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm26 : splitForms.getD 26 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm27 : splitForms.getD 27 0 = GenusFiveRow06CoverBase.aff [0, -1, 0, -2, 1, 0, 0, 0, 0, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm28 : splitForms.getD 28 0 = GenusFiveRow06CoverBase.aff [0, -1, 0, -2, 2, 0, 0, 0, 0, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm29 : splitForms.getD 29 0 = GenusFiveRow06CoverBase.aff [0, 0, 1, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm30 : splitForms.getD 30 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, -1, 0, -2, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm31 : splitForms.getD 31 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, -1, 0, 0, 1, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm32 : splitForms.getD 32 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 1, 2, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm33 : splitForms.getD 33 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, -1, 1, 0, 0, 0, 0, -1, 1, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm34 : splitForms.getD 34 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm35 : splitForms.getD 35 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 2, 0, 0, 0, 0]

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.splitForm36 : splitForms.getD 36 0 = GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 1, -1, 0, 0, 0, 0]

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart0 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[2] - length[3] in the row-06 symmetry chamber, with leaves selecting cells 0, 1, 2, 3, 4, 5 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart0_check : treePart0.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart1 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] + length[7] in the row-06 symmetry chamber, with leaves selecting cells 0, 6, 7, 8, 9, 10 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart1_check : treePart1.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart2 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 167 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart2 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 167

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart2_check : treePart2.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart3 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 11, 12, 13, 14, 15 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart3_check : treePart3.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart4 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 180 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart4 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 180

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart4_check : treePart4.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart5 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 16, 17, 18, 19, 20 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart5_check : treePart5.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart6 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - length[5] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart6_check : treePart6.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart7 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[8] + length[9] in the row-06 symmetry chamber, with leaves selecting cells 0, 31, 32, 33, 34, 35 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart7_check : treePart7.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart8 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 312 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart8 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 312

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart8_check : treePart8.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart9 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 36, 37, 38, 39, 40 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart9_check : treePart9.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart10 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 313 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart10 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 313

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart10_check : treePart10.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart11 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 41, 42, 43, 44, 45 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart11_check : treePart11.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart12 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[8] - 2 * length[9] - length[10] in the row-06 symmetry chamber, with leaves selecting cells 46, 47, 48, 49, 50, 51, 52, 53, 54 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart12_check : treePart12.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart13 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 339 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart13 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 339

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart13_check : treePart13.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart14 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] + length[7] in the row-06 symmetry chamber, with leaves selecting cells 31, 55, 56, 57, 58, 59 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart14_check : treePart14.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart15 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 347 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart15 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 347

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart15_check : treePart15.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart16 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] + length[7] in the row-06 symmetry chamber, with leaves selecting cells 32, 60, 61, 62, 63, 64 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart16_check : treePart16.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart17 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 359 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart17 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 359

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart17_check : treePart17.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart18 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[8] - 2 * length[9] - length[10] in the row-06 symmetry chamber, with leaves selecting cells 65, 66, 67 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart18_check : treePart18.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart19 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] + 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 68, 69, 70, 71, 72, 73, 74, 75 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart19_check : treePart19.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart20 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 339 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart20 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 339

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart20_check : treePart20.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart21 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 444 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart21 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 444

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart21_check : treePart21.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart22 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 76, 77, 78, 79, 80 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart22_check : treePart22.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart23 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 445 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart23 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 445

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart23_check : treePart23.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart24 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 81, 82, 83, 84, 85 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart24_check : treePart24.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart25 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - length[5] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 86, 87, 88, 89, 90, 91, 92, 93, 94, 95 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart25_check : treePart25.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart26 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 347 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart26 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 347

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart26_check : treePart26.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart27 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 359 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart27 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 359

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart27_check : treePart27.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart28 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 96, 97, 98, 99, 100 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart28_check : treePart28.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart29 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 363 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart29 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 363

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart29_check : treePart29.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart30 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 101, 102, 103, 104, 105 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart30_check : treePart30.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart31 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - length[5] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 106, 107, 108, 109, 110, 111, 112, 113, 114, 115 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart31_check : treePart31.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart32 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 521 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart32 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 521

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart32_check : treePart32.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart33 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 116, 117, 118, 119, 120 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart33_check : treePart33.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart34 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 524 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart34 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 524

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart34_check : treePart34.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart35 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 525 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart35 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 525

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart35_check : treePart35.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart36 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[4] - length[5] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 121, 122, 123 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart36_check : treePart36.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart37 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - 2 * length[2] + length[3] in the row-06 symmetry chamber, with leaves selecting cells 124, 125, 126, 127, 128, 129, 130, 131, 132 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart37_check : treePart37.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart38 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 521 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart38 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 521

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart38_check : treePart38.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart39 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 133, 134, 135, 136, 137 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart39_check : treePart39.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart40 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 574 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart40 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 574

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart40_check : treePart40.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart41 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 575 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart41 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 575

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart41_check : treePart41.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart42 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[4] - length[5] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 138, 139, 140 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart42_check : treePart42.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart43 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - 2 * length[2] + length[3] in the row-06 symmetry chamber, with leaves selecting cells 141, 142, 143, 144, 145, 146, 147, 148, 149 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart43_check : treePart43.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart44 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 614 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart44 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 614

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart44_check : treePart44.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart45 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[8] - 2 * length[9] in the row-06 symmetry chamber, with leaves selecting cells 0, 150, 151, 152, 153, 154 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart45_check : treePart45.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart46 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 629 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart46 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 629

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart46_check : treePart46.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart47 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 155, 156, 157, 158, 159 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart47_check : treePart47.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart48 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 637 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart48 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 637

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart48_check : treePart48.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart49 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 160, 161, 162, 163, 164 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart49_check : treePart49.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart50 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[8] + 2 * length[9] - length[10] in the row-06 symmetry chamber, with leaves selecting cells 165, 166, 167, 168, 169, 170, 171, 172, 173, 174 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart50_check : treePart50.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart51 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 629 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart51 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 629

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart51_check : treePart51.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart52 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] + length[7] in the row-06 symmetry chamber, with leaves selecting cells 150, 175, 176, 177, 178, 179 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart52_check : treePart52.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart53 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 637 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart53 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 637

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart53_check : treePart53.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart54 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] + length[7] in the row-06 symmetry chamber, with leaves selecting cells 151, 180, 181, 182, 183, 184 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart54_check : treePart54.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart55 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] + length[7] in the row-06 symmetry chamber, with leaves selecting cells 152, 185, 186, 187, 188, 189 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart55_check : treePart55.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart56 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] + length[7] in the row-06 symmetry chamber, with leaves selecting cells 190, 191, 192, 193, 194 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart56_check : treePart56.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart57 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 629 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart57 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 629

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart57_check : treePart57.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart58 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 711 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart58 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 711

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart58_check : treePart58.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart59 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 195, 196, 197, 198, 199 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart59_check : treePart59.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart60 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 712 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart60 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 712

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart60_check : treePart60.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart61 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 200, 201, 202, 203, 204 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart61_check : treePart61.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart62 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - length[5] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 205, 206, 207, 208, 209, 210, 211, 212, 213, 214 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart62_check : treePart62.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart63 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 637 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart63 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 637

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart63_check : treePart63.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart64 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 720 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart64 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 720

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart64_check : treePart64.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart65 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 215, 216, 217, 218, 219 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart65_check : treePart65.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart66 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 721 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart66 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 721

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart66_check : treePart66.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart67 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 220, 221, 222, 223, 224 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart67_check : treePart67.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart68 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - length[5] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 225, 226, 227, 228, 229, 230, 231, 232, 233, 234 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart68_check : treePart68.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart69 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 693 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart69 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 693

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart69_check : treePart69.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart70 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 235, 236, 237, 238, 239 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart70_check : treePart70.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart71 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 736 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart71 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 736

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart71_check : treePart71.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart72 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 240, 241, 242, 243, 244 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart72_check : treePart72.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart73 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - length[5] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 245, 246, 247, 248, 249, 250, 251, 252, 253 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart73_check : treePart73.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart74 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 693 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart74 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 693

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart74_check : treePart74.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart75 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[8] - length[9] + length[11] in the row-06 symmetry chamber, with leaves selecting cells 254, 255, 256, 257, 258 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart75_check : treePart75.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart76 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 736 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart76 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 736

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart76_check : treePart76.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart77 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 259, 260, 261, 262, 263 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart77_check : treePart77.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart78 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 264, 265, 266, 267, 268, 269, 270, 271 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart78_check : treePart78.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, -1, 0, -2, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart79 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 762 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart79 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 762

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart79_check : treePart79.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -1, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart80 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[4] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 0, 272, 273, 274, 275 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart80_check : treePart80.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart81 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 774 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart81 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 774

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart81_check : treePart81.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart82 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 276, 277, 278, 279, 280 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart82_check : treePart82.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart83 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 775 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart83 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 775

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart83_check : treePart83.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart84 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 281, 282, 283, 284, 285 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart84_check : treePart84.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart85 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] - length[5] + 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 286, 287, 288, 289, 290, 291, 292, 293, 294, 295 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart85_check : treePart85.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart86 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 801 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart86 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 801

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart86_check : treePart86.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart87 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[4] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 31, 296, 297, 298, 299 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart87_check : treePart87.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart88 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 810 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart88 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 810

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart88_check : treePart88.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart89 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[4] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 32, 300, 301, 302, 303 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart89_check : treePart89.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart90 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[4] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 304, 305, 306, 307, 308, 309, 310, 311 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart90_check : treePart90.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart91 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 801 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart91 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 801

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart91_check : treePart91.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart92 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 837 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart92 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 837

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart92_check : treePart92.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart93 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 312, 313, 314, 315, 316 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart93_check : treePart93.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart94 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 838 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart94 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 838

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart94_check : treePart94.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart95 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 317, 318, 319, 320, 321 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart95_check : treePart95.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart96 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] - length[5] + 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 322, 323, 324, 325, 326, 327, 328, 329, 330, 331 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart96_check : treePart96.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart97 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 810 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart97 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 810

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart97_check : treePart97.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart98 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 819 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart98 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 819

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart98_check : treePart98.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart99 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 332, 333, 334, 335, 336 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart99_check : treePart99.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart100 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 859 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart100 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 859

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart100_check : treePart100.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart101 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 337, 338, 339, 340, 341 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart101_check : treePart101.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart102 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] - length[5] + 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 342, 343, 344, 345, 346, 347, 348, 349, 350 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart102_check : treePart102.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart103 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 884 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart103 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 884

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart103_check : treePart103.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart104 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 351, 352, 353, 354, 355 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart104_check : treePart104.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart105 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 885 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart105 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 885

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart105_check : treePart105.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart106 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 356, 357, 358, 359, 360 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart106_check : treePart106.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart107 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] - length[5] + 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 361, 362, 363, 364, 365, 366, 367, 368, 369, 370 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart107_check : treePart107.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart108 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 884 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart108 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 884

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart108_check : treePart108.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart109 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[8] + 2 * length[9] + length[11] in the row-06 symmetry chamber, with leaves selecting cells 371, 372, 373, 374, 375 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart109_check : treePart109.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart110 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 885 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart110 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 885

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart110_check : treePart110.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart111 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 376, 377, 378, 379, 380 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart111_check : treePart111.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart112 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 381, 382, 383, 384, 385, 386, 387, 388 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart112_check : treePart112.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart113 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 936 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart113 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 936

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart113_check : treePart113.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 2, 0, 1])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart114 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 937 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart114 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 937

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart114_check : treePart114.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart115 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[4] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 150, 389, 390, 391, 392 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart115_check : treePart115.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart116 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 946 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart116 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 946

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart116_check : treePart116.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart117 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[4] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 151, 393, 394, 395, 396 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart117_check : treePart117.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart118 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 961 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart118 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 961

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart118_check : treePart118.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart119 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[8] + 2 * length[9] - length[10] in the row-06 symmetry chamber, with leaves selecting cells 397, 398, 399 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart119_check : treePart119.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart120 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 400, 401, 402, 403, 404, 405, 406, 407 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart120_check : treePart120.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart121 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 937 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart121 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 937

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart121_check : treePart121.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart122 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 996 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart122 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 996

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart122_check : treePart122.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart123 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 408, 409, 410, 411, 412 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart123_check : treePart123.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart124 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 997 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart124 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 997

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart124_check : treePart124.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart125 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 413, 414, 415, 416, 417 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart125_check : treePart125.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart126 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] - length[5] + 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 418, 419, 420, 421, 422, 423, 424, 425, 426, 427 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart126_check : treePart126.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart127 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 946 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart127 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 946

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart127_check : treePart127.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart128 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 961 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart128 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 961

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart128_check : treePart128.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart129 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 428, 429, 430, 431, 432 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart129_check : treePart129.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart130 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 968 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart130 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 968

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart130_check : treePart130.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart131 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 433, 434, 435, 436, 437 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart131_check : treePart131.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart132 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] - length[5] + 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 438, 439, 440, 441, 442, 443, 444, 445, 446, 447 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart132_check : treePart132.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart133 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 819 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart133 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 819

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart133_check : treePart133.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart134 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 448, 449, 450, 451, 452 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart134_check : treePart134.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart135 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 859 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart135 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 859

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart135_check : treePart135.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart136 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[2] - 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 453, 454, 455, 456, 457 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart136_check : treePart136.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart137 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - 2 * length[4] - length[5] + 2 * length[7] in the row-06 symmetry chamber, with leaves selecting cells 458, 459, 460, 461, 462, 463, 464, 465, 466 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart137_check : treePart137.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 2, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, -2, -1, 0, 1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart138 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 819 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart138 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 819

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart138_check : treePart138.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart139 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 721 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart139 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 721

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart139_check : treePart139.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart140 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - length[7] in the row-06 symmetry chamber, with leaves selecting cells 467, 468, 469, 470 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart140_check : treePart140.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart141 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on 2 * length[4] - length[7] in the row-06 symmetry chamber, with leaves selecting cells 471, 472, 473, 474 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart141_check : treePart141.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, -1, 0, -2, 1, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart142 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - 2 * length[2] + 2 * length[3] in the row-06 symmetry chamber, with leaves selecting cells 475, 476, 477, 478, 479, 480, 481, 482 and Farkas receipts excluding inconsistent sign branches.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart142_check : treePart142.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, -1, 0, -2, 1, 0, 0, 0, 0, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treePart143 : GenusFiveClosedCover.CompactCellTree

Contradiction leaf using Farkas receipt 1073 to exclude the accumulated affine constraints in this row-06 branch.

Equations

• AtanasovRanganathan.GenusFiveRow06FixedCover.treePart143 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1073

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treePart143_check : treePart143.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -2, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 2, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -2, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, -1, 0, 1])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treeAssemblyBranch0 : GenusFiveClosedCover.CompactCellTree

A branch of the final row-06 cover assembly, starting at split form 2 and combining the previously verified decision subtrees.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treeAssemblyBranch0_check : treeAssemblyBranch0.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treeAssemblyBranch1 : GenusFiveClosedCover.CompactCellTree

A branch of the final row-06 cover assembly, starting at split form 3 and combining the previously verified decision subtrees.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treeAssemblyBranch1_check : treeAssemblyBranch1.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treeAssemblyBranch2 : GenusFiveClosedCover.CompactCellTree

A branch of the final row-06 cover assembly, starting at split form 1 and combining the previously verified decision subtrees.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treeAssemblyBranch2_check : treeAssemblyBranch2.check splitForms farkasReceipts cells (base ++ [GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.treeAssemblyBranch3 : GenusFiveClosedCover.CompactCellTree

A branch of the final row-06 cover assembly, starting at split form 1 and combining the previously verified decision subtrees.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.treeAssemblyBranch3_check : treeAssemblyBranch3.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow06CoverBase.aff [0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0])]) = true

def AtanasovRanganathan.GenusFiveRow06FixedCover.tree : GenusFiveClosedCover.CompactCellTree

The complete compact decision tree for row 06 on the symmetry chamber, assembling 144 subtrees whose cell and Farkas certificates are replayed by the cover checker.

Equations

• One or more equations did not get rendered due to their size.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.tree_check : tree.check splitForms farkasReceipts cells base = true

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.base_holds (length : Fin 12 → ℕ) (hChamber : GenusFiveRow06Symmetry.Chamber length) : Utilities.Certificate.ExplicitPotential.FormsHold base (GenusFiveClosedCover.lengthPoint length)

On the chamber the eighteen active rows all hold: the first twelve because lengths are natural numbers, the last six by definition of the fundamental domain.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.rowConnected : Utilities.Certificate.ExplicitPotential.Core.Connected GenusFiveCoreAtlas.row06Core

Connectivity of the core, checked here so that the generated modules stay self-contained.

theorem AtanasovRanganathan.GenusFiveRow06FixedCover.closedConstruction : Configurations.ClosedSubdivisionDharConstruction GenusFiveCoreAtlas.row06Core closedConstruction._proof_1