The strength of sharply bounded induction requires MSP

We show that the arithmetical theory -IND∣x∣5, formalized in the language of Buss, i.e. with ⌊x/2⌋ but without the MSP function ⌊x/2y⌋, does not prove that every nontrivial divisor of a power of 2 is even. It follows that this theory proves neither NP=coNP nor .