The not all equal (NAE) 3-SAT problem is known to be NP-complete even in the absence of negated variables (see [11]), a variant known as positive (or monotone) NAE 3-SAT. In this article, we investigate a related category, dubbed positive NAE LE3SAT (PNAE LE3-SAT), in which each clause has at most three variables, none of which is negated, and an assignment is sought that will satisfy such an e...