The complexity of class OTHER-NP

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? This question was first mentioned in a letter written by John Nash to the National Security Agency in 1955. A precise statement of the P versus NP problem was introduced independently in 1971 by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. OTHER-L is a problem of deciding given a solution y of an instance x in a language L whether x has another solution different of y. The class OTHER-NP contains those languages OTHER-L where L is in NP. Another major complexity class is NP-complete. To attack the P versus NP question the concept of NP-completeness has been very useful. We show a previous known OTHER-NP language which is NP-complete. If any single NP-complete problem can be solved in polynomial time, then every NP problem has a polynomial time algorithm. Therefore, if every OTHER-NP language is in P, then P = NP. Moreover, we show OTHER-SAT and OTHER-3SAT are complete for OTHER-NP. Furthermore, we prove OTHER-SAT is NP-complete as well. Finally, we demonstrate the existence of a trivial OTHER-L language that is not only in OTHER-NP, but it is also in P where L is NP-complete.