Bounded coverage-certificate computation facts

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_0_24 : branchClaimRootValidB 0 24 (BranchClaim.patternTwo 0) = true

Root audit for fixed branch (0, 24).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_5_22 : branchClaimRootValidB 5 22 (BranchClaim.patternThree 1) = true

Root audit for fixed branch (5, 22).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_29 : branchClaimRootValidB 2 29 (BranchClaim.search branchClaims2Row29) = true

Root audit for fixed branch (2, 29).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_30 : branchClaimRootValidB 2 30 (BranchClaim.search branchClaims2Row30) = true

Root audit for fixed branch (2, 30).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_28_00064 : nodeClaimChunkValidB branchClaims2Row28 64 32 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_29_00000 : nodeClaimChunkValidB branchClaims2Row29 0 64 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_29_00064 : nodeClaimChunkValidB branchClaims2Row29 64 39 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_30_00000 : nodeClaimChunkValidB branchClaims2Row30 0 64 = true

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