More generally, if the optimal subbases of K are small (say twice smaller that K), it can be rightfully argued that dropping so many statements for the sake of linguistic evidence is not a viable debugging strategy.
a more plausible application scenario is one in which the search space has been previously circumscribed, either by setting a maximal (small) number of statements to discard, or by identifying a set of potentially erroneous statements, through axiom pinpointing, as explained in section 6.