The first-order sequent calculus is generally considered as containing no computation but only pure deduction. But this is not completely true if we look at it carefully, using a deduction modulo framework. The origins of the computational part are first implicit behaviours of the calculus, then well known consequences that we do not want to prove any more. We end up with a calculus fully in the spirit of deduction modulo.