Bounded coverage-certificate computation facts

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_0_25 : branchClaimRootValidB 0 25 (BranchClaim.patternTwo 0) = true

Root audit for fixed branch (0, 25).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_5_23 : branchClaimRootValidB 5 23 (BranchClaim.patternThree 3) = true

Root audit for fixed branch (5, 23).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_31 : branchClaimRootValidB 2 31 (BranchClaim.search branchClaims2Row31) = true

Root audit for fixed branch (2, 31).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_30_00064 : nodeClaimChunkValidB branchClaims2Row30 64 64 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_30_00128 : nodeClaimChunkValidB branchClaims2Row30 128 64 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_30_00192 : nodeClaimChunkValidB branchClaims2Row30 192 14 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_31_00000 : nodeClaimChunkValidB branchClaims2Row31 0 64 = true

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