In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploration model recently proposed by Bruno Buchberger. The proofs of these properties use definitions and propositions invented using knowledge schemes in the exploration process and proved using the Theorema system. The proofs in this paper are close to what the Theorema system will produce.