Complexity of the Satisfiability Problem for a Class of Propositional Schemata