This short note shows that the conventional (2-subset) bit-based division property trail search problem is NP-complete.