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

Generated exact replay of the fixed AR row-04 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.GenusFiveRow04FixedCover.cells : List (GenusFiveClosedCover.CoordinateCell GenusFiveCoreAtlas.row04Core)

The 195 row-04 closed-cover cells in global index order, obtained by concatenating the two certificate blocks.

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.cells = AtanasovRanganathan.GenusFiveRow04CoverCells0.chunk ++ AtanasovRanganathan.GenusFiveRow04CoverCells1.chunk

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.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.GenusFiveRow04FixedCover.splitForms : List (Utilities.Certificate.ExplicitPotential.AffineForm 12)

The 32 homogeneous affine forms whose signs determine branches of the row-04 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.GenusFiveRow04FixedCover.splitForm0 : splitForms.getD 0 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm1 : splitForms.getD 1 0 = GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1]

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

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

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

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm5 : splitForms.getD 5 0 = GenusFiveRow04CoverBase.aff [0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm6 : splitForms.getD 6 0 = GenusFiveRow04CoverBase.aff [0, -1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm7 : splitForms.getD 7 0 = GenusFiveRow04CoverBase.aff [0, 1, 0, -1, -1, 0, -1, 0, 0, 0, 0, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm8 : splitForms.getD 8 0 = GenusFiveRow04CoverBase.aff [0, 1, 0, 0, -1, 0, -1, 0, 0, 0, 0, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm9 : splitForms.getD 9 0 = GenusFiveRow04CoverBase.aff [0, 1, 0, 1, -1, 0, -1, 0, 0, 0, 0, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm10 : splitForms.getD 10 0 = GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm11 : splitForms.getD 11 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm12 : splitForms.getD 12 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, -1, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm13 : splitForms.getD 13 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 1, 0, 1, -1, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm14 : splitForms.getD 14 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, -1, 1, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm15 : splitForms.getD 15 0 = GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 1, 1, 0, 0, 0, 0, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm16 : splitForms.getD 16 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 1, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm17 : splitForms.getD 17 0 = GenusFiveRow04CoverBase.aff [0, 0, -1, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1]

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

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm19 : splitForms.getD 19 0 = GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm20 : splitForms.getD 20 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, 0, -1, -1]

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

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm22 : splitForms.getD 22 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 1, 0, 0, -1, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm23 : splitForms.getD 23 0 = GenusFiveRow04CoverBase.aff [0, 0, 1, 0, -1, 0, -1, 0, 0, 0, 0, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm24 : splitForms.getD 24 0 = GenusFiveRow04CoverBase.aff [0, 0, 1, -1, -1, 0, -1, 0, 0, 0, 0, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm25 : splitForms.getD 25 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, -1, 0, 1, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm26 : splitForms.getD 26 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 0, 1, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm27 : splitForms.getD 27 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, 1, 1, 0, 1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm28 : splitForms.getD 28 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 1, 0, -1, 0, -1]

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm29 : splitForms.getD 29 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 1, -1, -1, 0, -1]

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

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.splitForm31 : splitForms.getD 31 0 = GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, 2, 1, 0, 1]

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart0 : GenusFiveClosedCover.CompactCellTree

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

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart1 : GenusFiveClosedCover.CompactCellTree

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

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart2 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[0] - length[3] - length[5] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 7, 8, 9, 10, 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.GenusFiveRow04FixedCover.treePart2_check : treePart2.check splitForms farkasReceipts cells (base ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, -1])]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart3 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart3 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 215

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart4 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[1] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 0, 16, 17, 18, 19, 20, 21, 22 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart5 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 0, 16, 19, 23, 24 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart6 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart6 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 215

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart7 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[1] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 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.GenusFiveRow04FixedCover.treePart7_check : treePart7.check splitForms farkasReceipts cells (base ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, 0, -1, -1, 0, -1, 0, 0, 0, 0, 0, 1]] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, -1]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart8 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 31, 32, 33 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart9 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[1] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 34, 35, 36, 37, 38, 39 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart10 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[5] - length[6] + length[9] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 40, 41, 42 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart11 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[1] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 43, 44, 45, 46, 47, 48 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart12 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 17, 34, 35, 36 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart13 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[2] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 18, 23, 31, 32, 33, 37, 38, 39 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart14 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 19, 49, 50, 51, 52 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart15 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 19, 22, 44, 46, 48 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart16 : GenusFiveClosedCover.CompactCellTree

Leaf selecting row-04 cell 0, with 22 Farkas receipts deriving its cone inequalities from the active branch constraints.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart17 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart17 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 517

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart18 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[10] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 0, 53, 54, 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.GenusFiveRow04FixedCover.treePart18_check : treePart18.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1]] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1]] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, -1, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 1, 0, 1, -1, 0, -1]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart19 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 0, 53, 57, 60 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart20 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] + length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 0, 57, 60, 61 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart21 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[5] - length[6] + length[9] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 0, 54, 55, 59, 62 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart22 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart22 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 573

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart23 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart23 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 574

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart24 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[10] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 4, 63, 64, 65, 66, 67, 68, 69, 70, 71 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart25 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart25 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 607

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart26 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] + length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 5, 72, 73, 74, 75, 76, 77, 78, 79 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart27 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart27 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 628

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart28 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] + length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 6, 80, 81, 82, 83, 84, 85, 86, 87 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart29 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart29 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 675

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart30 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart30 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 676

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart31 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 66, 70, 73, 74, 81, 82 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart32 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[5] - length[6] + length[8] + length[9] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 69, 78, 86, 88, 89, 90 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart33 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 71, 79, 87 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart34 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart34 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 36

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart35 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart35 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 705

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart36 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart36 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 706

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart37 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart37 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 707

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart38 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart38 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 708

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart39 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[10] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 17, 91, 92, 93, 94, 95, 96, 97, 98, 99 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart40 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart40 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 800

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart41 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[10] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 20, 100, 101, 102, 103, 104, 105, 106, 107, 108 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart42 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart42 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 897

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart43 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart43 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 898

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart44 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart44 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 899

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart45 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 109, 110, 111, 112 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart46 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[5] - length[6] + length[9] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 113, 114, 115, 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.GenusFiveRow04FixedCover.treePart46_check : treePart46.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, -1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, -1, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, -2, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, -1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 1, 0, 0, -1, 0, -1, 0, 0, 0, 0, 0, 1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 1, 0, -1, -1, 0, -1, 0, 0, 0, 0, 0, 1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 1, 0, 1, -1, 0, -1, 0, 0, 0, 0, 0, 1])] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, -1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, -1, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, 0, -1, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -2, -1, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 1, 0, 1, -1, 0, -1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, -1, 1, 0, 1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 1, 0, 0, -1, 0, -1]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart47 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[5] - length[6] + length[10] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 121, 122 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart48 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 123, 124 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart49 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart49 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 322

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart50 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[1] - length[3] - length[5] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 18, 125, 126, 127, 128, 129, 130, 131, 132, 133 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart51 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart51 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 217

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart52 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart52 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1080

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart53 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart53 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1081

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart54 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart54 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1082

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart55 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] + length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 23, 134, 135, 136, 137, 138, 139, 140, 141 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart56 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart56 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1130

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart57 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart57 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1131

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart58 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart58 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 82

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart59 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart59 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1132

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart60 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart60 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 337

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart61 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart61 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1133

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart62 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart62 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1134

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart63 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 142, 143, 144, 145 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart64 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 93, 127, 146, 147 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart65 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[0] + length[2] - length[3] - length[5] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 101, 109, 110, 111, 112, 148 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart66 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 137, 149 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart67 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart67 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 82

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart68 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart68 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1132

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart69 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart69 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1200

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart70 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart70 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1201

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart71 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[1] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 60, 98, 107, 123, 124, 132, 150, 151 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart72 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 60, 141, 150, 151, 152 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart73 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart73 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1239

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart74 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart74 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 82

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart75 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart75 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1240

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart76 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart76 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 386

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart77 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[1] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 54, 92, 102, 113, 114, 126, 153, 154 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart78 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 54, 135, 153, 154, 155 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart79 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart79 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1201

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart80 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[2] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 55, 136, 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.GenusFiveRow04FixedCover.treePart80_check : treePart80.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, -1, 1, 0, 1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 1, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 1, 0, 0, -1, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 0, 1, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, 0, -1, -1, 0, -1, 0, 0, 0, 0, 0, 1]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart81 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[0] - length[3] - length[5] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 55, 97, 106, 121, 122, 131, 156 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart82 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart82 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1279

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart83 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart83 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 82

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart84 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart84 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1132

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart85 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart85 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1201

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart86 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] + length[2] + length[3] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 62, 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.GenusFiveRow04FixedCover.treePart86_check : treePart86.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, -1, 1, 0, 1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 1, 0, 1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, 1, 1, 0, 1]] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 1, 0, -1, 0, -1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, 0, -1, -1, 0, -1, 0, 0, 0, 0, 0, 1]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart87 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[0] - length[3] - length[5] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 62, 160, 165, 166, 167, 168, 169 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart88 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart88 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1282

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart89 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart89 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1283

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart90 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[1] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 59, 140, 170, 171, 172, 173 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart91 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[1] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 59, 96, 105, 118, 120, 130, 170 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart92 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart92 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1299

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart93 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart93 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1282

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart94 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart94 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 82

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart95 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart95 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1132

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart96 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart96 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1300

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart97 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[10] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 19, 142, 143, 151, 154, 157, 171, 174, 175, 176 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart98 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart98 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1321

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart99 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[10] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 144, 145, 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.GenusFiveRow04FixedCover.treePart99_check : treePart99.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [GenusFiveRow04CoverBase.aff [0, 1, 0, -1, -1, 0, -1, 0, 0, 0, 0, 0, 1]] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, -1]] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 1, 0, -1, 0, -1, 0, 0, 0, 0, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, -1, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, -1, -1, 0, -1, 1, 0, 1]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart100 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[5] - length[6] + length[9] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 158, 172, 177, 178, 180, 181, 182 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart101 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart101 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1345

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart102 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart102 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1346

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart103 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart103 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1347

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart104 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 154, 157, 158, 180 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart105 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[5] - length[6] + length[8] + length[9] + length[11] in the row-04 symmetry chamber, with leaves selecting cells 161, 162, 171, 172 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart106 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 151, 179 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart107 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart107 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 82

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart108 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart108 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 509

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart109 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart109 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1347

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart110 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart110 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1364

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart111 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] + length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 23, 134, 135, 136, 137, 138, 139, 140, 141 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart112 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart112 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1387

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart113 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart113 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1388

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart114 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] + length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 137, 141, 149 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart115 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 135, 136 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart116 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 140, 163 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart117 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart117 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1406

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart118 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 17, 91, 92, 93, 94, 95, 96, 97, 98, 99 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart119 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart119 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1416

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart120 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart120 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1321

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart121 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] + length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 18, 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.GenusFiveRow04FixedCover.treePart121_check : treePart121.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 1, 0, -1, -1, 0, -1, 0, 0, 0, 0, 0, 1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, 0, 0, -1, 0, -1, 0, 0, 0, 0, 0, 1]] ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, -1, -1, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 0, 1, 0, -1, 0, -1, 0, 0, 0, 0, 0, 1]] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, -1, -1])]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart122 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart122 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1430

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart123 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 93, 127, 146, 147 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart124 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 17, 93, 98, 132 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart125 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 17, 92, 97, 126, 131 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart126 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 17, 96, 130, 165, 166 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart127 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart127 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 82

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart128 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 49, 183, 184, 185, 186, 187, 188, 189, 190, 191 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart129 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart129 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1347

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart130 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart130 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1364

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart131 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] + length[6] + length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 22, 110, 114, 116, 119, 120, 122, 124, 192 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart132 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart132 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1486

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart133 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart133 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1467

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart134 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 110, 112, 185, 193 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart135 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 124, 190 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart136 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on - length[0] - length[2] + length[5] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 114, 122, 184, 189 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart137 : GenusFiveClosedCover.CompactCellTree

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

Equations

• AtanasovRanganathan.GenusFiveRow04FixedCover.treePart137 = AtanasovRanganathan.GenusFiveClosedCover.CompactCellTree.absurd 1389

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart138 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 188, 194 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treePart139 : GenusFiveClosedCover.CompactCellTree

Subtree splitting on length[5] - length[8] - length[9] - length[11] in the row-04 symmetry chamber, with leaves selecting cells 120, 169 and Farkas receipts excluding inconsistent sign branches.

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treeAssemblyBranch0 : GenusFiveClosedCover.CompactCellTree

A branch of the final row-04 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.GenusFiveRow04FixedCover.treeAssemblyBranch0_check : treeAssemblyBranch0.check splitForms farkasReceipts cells (base ++ [GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treeAssemblyBranch1 : GenusFiveClosedCover.CompactCellTree

A branch of the final row-04 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.GenusFiveRow04FixedCover.treeAssemblyBranch1_check : treeAssemblyBranch1.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treeAssemblyBranch2 : GenusFiveClosedCover.CompactCellTree

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

Equations

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

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.treeAssemblyBranch2_check : treeAssemblyBranch2.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])] ++ [GenusFiveRow04CoverBase.aff [0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treeAssemblyBranch3 : GenusFiveClosedCover.CompactCellTree

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

Equations

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

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

def AtanasovRanganathan.GenusFiveRow04FixedCover.treeAssemblyBranch4 : GenusFiveClosedCover.CompactCellTree

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

Equations

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

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.treeAssemblyBranch4_check : treeAssemblyBranch4.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])] ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1])]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.treeAssemblyBranch5 : GenusFiveClosedCover.CompactCellTree

A branch of the final row-04 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.GenusFiveRow04FixedCover.treeAssemblyBranch5_check : treeAssemblyBranch5.check splitForms farkasReceipts cells (base ++ [Utilities.Certificate.AffineCover.AffineForm.violation (GenusFiveRow04CoverBase.aff [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, -1])]) = true

def AtanasovRanganathan.GenusFiveRow04FixedCover.tree : GenusFiveClosedCover.CompactCellTree

The complete compact decision tree for row 04 on the symmetry chamber, assembling 140 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.GenusFiveRow04FixedCover.tree_check : tree.check splitForms farkasReceipts cells base = true

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.base_holds (length : Fin 12 → ℕ) (hChamber : GenusFiveRow04Symmetry.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.GenusFiveRow04FixedCover.rowConnected : Utilities.Certificate.ExplicitPotential.Core.Connected GenusFiveCoreAtlas.row04Core

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

theorem AtanasovRanganathan.GenusFiveRow04FixedCover.closedConstruction : Configurations.ClosedSubdivisionDharConstruction GenusFiveCoreAtlas.row04Core closedConstruction._proof_1