Part of Using Clausal Graphs to Determine the Computational Complexity of k-Bounded Positive 1-in-3 SAT