@Unstupid, and Orathaic
We need a formal definition of consistent, and completeness in logical systems before proceeding. (They are different but related concepts).
Let us consider only logic system has statements, which can either be true or false.
(So we are doing the 2-valued/binary logic systems only.)
Some statements are axioms[we generally want as little axioms as possible], which are statement that are the "foundation" and need not be proven.
Other true statements are theorem that follow from the axioms using a logical process(aka proofs)
A logic system is consistent if using the axiom(s), for all statement P which is true, then ~P(the negation of P) is false. Now, we generally want consistent systems since proof by contradiction is so fundamental to so many proofs. Note here that formulation of "good" axioms that don't contradict each other somewhere along the way is the key to a "consistent" system.
A logic system is complete, if using the axiom(s), all possible "well formed" statements are decidable. Decidable means that we can, even if we don't know the actual proof, know that the proof actually exist within the logic system.
Now, you will need to specific which system are you talking about? ZFC? Or Peano Arithmetic?
The reality is that for we don't know if ZFC(the conventional set theory) is consistent or not. However, no one has found any inconsistent yet, and mathematician generally think ZFC is consistent, and all proof in ZFC have an implied "assuming ZFC is consistent, then...." However, if ZFC is consistent, then it is definitely not complete(incompleteness theorem, hence the reference to Godel).