We add a bit to Tiling the plane with pair-wise non-congruent and mutually similar triangles and Cutting polygons into mutually similar and non-congruent pieces
A (non square) rectangle can obviously be cut into 3 mutually similar and pairwise non-congruent right triangles. And it is trivial to construct quadrilaterals formed by two similar but non-congruent and non-right triangles.
Can a square be cut into some finite number of triangles that are (1) mutually similar and (2) non-right? No other constraints.
If the answer to the above is "yes", can a square be cut into some finite number of triangles that are (1) mutually similar, (2) non-right and (3) pairwise non-congruent?