Bounded coverage-certificate computation facts

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_0_27 : branchClaimRootValidB 0 27 (BranchClaim.patternTwo 0) = true

Root audit for fixed branch (0, 27).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_5_33 : branchClaimRootValidB 5 33 (BranchClaim.patternThree 3) = true

Root audit for fixed branch (5, 33).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_33 : branchClaimRootValidB 2 33 (BranchClaim.search branchClaims2Row33) = true

Root audit for fixed branch (2, 33).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_32_00064 : nodeClaimChunkValidB branchClaims2Row32 64 64 = true

Node audit for fixed branch (2, 32), starting at 64.

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_32_00128 : nodeClaimChunkValidB branchClaims2Row32 128 64 = true

Node audit for fixed branch (2, 32), starting at 128.

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_32_00192 : nodeClaimChunkValidB branchClaims2Row32 192 27 = true

Node audit for fixed branch (2, 32), starting at 192.

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_33_00000 : nodeClaimChunkValidB branchClaims2Row33 0 64 = true

Node audit for fixed branch (2, 33), starting at 0.