Motivation for predicate logic. I am studying  predicate logic,I came across this para-

Propositional logic, studied in Sections 1.1–1.3, cannot adequately express the meaning of all statements in mathematics and in natural language. 
For example, suppose that we know that
  “Every computer connected to the university network is functioning properly.”
No rules of propositional logic allow us to conclude the truth of the statement “MATH3 is functioning properly",where MATH3 is one of the computers connected to the university network.

This is supposed to illustrate the motivation for predicate logic.
However,we can interpret the given statement as the conjunction of statements of the form "MATHx is connected to the university network and is working properly".
As this statement is true and is a conjunction the individual propositions have to be true;in terms of MATH3 too.
So propositional logic expresses the meaning of the statement adequately and we have also used the rules of propositional logic to conclude the truth about MATH3 contrary to whats been stated. 
What am I missing?I have gone through the notes by Stephen Simpson and Wikipedia but they proved inadequate.    

If nullary relation symbols are allowed, then restricting the signature of a first-order language to nullary relation symbols results in propositional logic.  Thinking of propositional logic as the result of restricting the signature to nullary relation symbols shows how in propositional logic we are constrained in referring to the elements of the domain in the logic.  
Specifically, let $\mathcal{L}_0$ be our restricted signature, and let $D$ be the domain of an $\mathcal{L}_0$-structure.  Since $D^0 = \{\emptyset\}$, each relation symbol may only be interpreted as $\emptyset$ (always false) or $D^0$ (always true) regardless of $D$.  There are no terms in formulae; hence there is no use for quantifiers.
These restrictions prevent us from expressing many interesting statements about integers or humans, and result in large formulae in many other instances.  It should be noted, though, that there are practical cases in which the "propositional approach" is surprisingly efficient: not in terms of the size of the formulae, but in terms of the time needed to decide satisfiability.
