P != NP is always true.
This is as a reminder for some people to do this topic-related project.
In any condition, P is always not equal to NP, this is determined by the nature of the topic.
if you do not know this, you may end up with a lot of works that can be avoided.

Many people I know are just not very clear about computability theory, complexity theory, theoretical computer science, especially, if you do not have practical experiences in electric and electronic engineering, digital theory, and computer engineering, quickly workong on this type of projects, the results are mostly wrong, or at least not as required or as expected.

Many people say that they are great, great, and great, if this is true, the P and NP problem would have been solved long before. That's why no one can solve it by now. All of the theses claimed to have solved it are all raw.

That's why this is the most difficult problem in computer science, I would like to say this is a topic in popular science as well. But if you really know this topic very well, you are a true computer expert. However, in reality, such persons cannot be found.
There are many issues that are very obvious but if you do not think carefully, you may not notoce them.

Have a good time.

Expected to improve.