Bounded coverage-certificate computation facts

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_0_28 : branchClaimRootValidB 0 28 (BranchClaim.patternTwo 0) = true

Root audit for fixed branch (0, 28).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_6_00 : branchClaimRootValidB 6 0 (BranchClaim.patternThree 1) = true

Root audit for fixed branch (6, 0).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_34 : branchClaimRootValidB 2 34 (BranchClaim.search branchClaims2Row34) = true

Root audit for fixed branch (2, 34).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_33_00064 : nodeClaimChunkValidB branchClaims2Row33 64 64 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_33_00128 : nodeClaimChunkValidB branchClaims2Row33 128 38 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_34_00000 : nodeClaimChunkValidB branchClaims2Row34 0 64 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_34_00064 : nodeClaimChunkValidB branchClaims2Row34 64 64 = true

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