The satisfiability problem of propositional logic is a universal combinatorial problem, where any algorithm can be expressed as a sequence of moves of the Turing machine. This means that any non-deterministic polynomial time algorithm can be translated into the language of the satisfiability problem.