Saturation properties for compositional truth with propositional correctness

It is an open question whether compositional truth with the principle of propositional soundness ,all arithmetical sentences which are propositional tautologies are true’’ is conservative over its arithmetical base theory. In this article, we show that the principle of propositional soundness imposes some saturation-like properties on the underlying model, thus showing significant limitations to the possible conservativity proof.