Bounded coverage-certificate computation facts

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_0_23 : branchClaimRootValidB 0 23 (BranchClaim.patternTwo 0) = true

Root audit for fixed branch (0, 23).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_5_21 : branchClaimRootValidB 5 21 (BranchClaim.patternThree 1) = true

Root audit for fixed branch (5, 21).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_27 : branchClaimRootValidB 2 27 (BranchClaim.search branchClaims2Row27) = true

Root audit for fixed branch (2, 27).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_28 : branchClaimRootValidB 2 28 (BranchClaim.search branchClaims2Row28) = true

Root audit for fixed branch (2, 28).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_26_00064 : nodeClaimChunkValidB branchClaims2Row26 64 34 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_27_00000 : nodeClaimChunkValidB branchClaims2Row27 0 64 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_27_00064 : nodeClaimChunkValidB branchClaims2Row27 64 26 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_28_00000 : nodeClaimChunkValidB branchClaims2Row28 0 64 = true

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