Theory of complexity – Is the legislation np-complete?

I would like to know if there has been any work related to the legal code with complexity. In particular, suppose we have the problem of the decision "Given this law book and this particular set of circumstances, is the defendant guilty?" What kind of complexity does it belong to?

There are results that have shown that the Magic: the Gathering card game is NP and Turing-complete, so there should not be similar results for the legal code.