(eng): A subset of a semigraphoid over n elements is constructed in such a way that starting from the subset it is necessary to apply the semigraphoid axioms recursively 2^{n-2}-1 times to arrive at the semigraphoid. This is first known example of exponentially long semigraphoid inference. A comparison is made between local and global inferences. Graphoids and their duals are discussed as well.