This paper describes about complexity of PH problems by using "Almost all monotone circuit family" and "Accept input pair that sandwich reject inputs". Explained in Michael Sipser "Introduction to the Theory of COMPUTATION", circuit family that emulate Deterministic Turing machine (DTM) are almost all monotone circuit family except some NOT-gate that connect input variables (like negation normal form (NNF)). Therefore, we can find out DTM limitation by using this "NNF Circuit family". To clarify NNF circuit family limitation, we pay attention to AND-gate and OR-gate relation. If two accept "Neighbor input" pair that sandwich reject "Boundary input" in Hamming distance, NNF circuit have to meet these different variables of neighbor inputs in AND-gate to differentiate boundary inputs. NNF circuit have to use unique AND-gate to identify such neighbor input. The other hand, we can make neighbor input problem "Neighbor Tautology DNF problem (NTD)" in PH. NTD is subset of tautology DNF that do not become tautology if proper subset of one variable permutate positive / negative. NTD include many different variables which number is over polynomial size of input length. Therefore NNF circuit family that compute NTD are over polynomial size of length, and NTD that include PH is not in P.