Statistical EL is ExpTime-complete

We show that the consistency problem for Statistical ontologies, defined by Pe\~{n}aloza and Potyka in SUM 2017, is ExpTime-hard. Together with recent developments of Baader and Ecke from GCAI 2017, we conclude ExpTime-completeness of the logic. Our proof goes via a reduction from the consistency problem for EL extended with negation of atomic concepts.