Given a 3SAT problem with the additional constraints that:
No clause or set of clauses is the 3SAT instance is 'redundant'. Thus, this 3SAT cannot eliminate any clauses.
For any/every clause, the triplet of 3 variables in it are guaranteed to occur in at least 1 other clause.
What is the computational complexity of this 3SAT variant?
Redundant Clause - A clause is redundant if its elimination from the problem does not change the set of valid solutions of the problem. For eg: $(a\vee b \vee c) \wedge (a\vee b) \wedge (a\vee c)$. The first clause is redundant here as it does not affect the set of valid solutions of this problem.