Submodular Minimisation Theorem states that there is a polynomial-time algorithm which, given a finite set E and value-oracle access to an integer-valued submodular function f:2 E Z whose values have polynomially bounded encoding length, returns a minimiser of f over 2 E. It is a structural result used to certify optimality and guide algorithms in combinatorial optimisation.