Bounded coverage-certificate computation facts

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_0_22 : branchClaimRootValidB 0 22 (BranchClaim.patternTwo 0) = true

Root audit for fixed branch (0, 22).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_5_20 : branchClaimRootValidB 5 20 (BranchClaim.patternThree 1) = true

Root audit for fixed branch (5, 20).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_25 : branchClaimRootValidB 2 25 (BranchClaim.search branchClaims2Row25) = true

Root audit for fixed branch (2, 25).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_2_26 : branchClaimRootValidB 2 26 (BranchClaim.search branchClaims2Row26) = true

Root audit for fixed branch (2, 26).

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_24_00064 : nodeClaimChunkValidB branchClaims2Row24 64 46 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_25_00000 : nodeClaimChunkValidB branchClaims2Row25 0 64 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_25_00064 : nodeClaimChunkValidB branchClaims2Row25 64 41 = true

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

theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_2_26_00000 : nodeClaimChunkValidB branchClaims2Row26 0 64 = true

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