This paper provides a comprehensive analysis of the relationship between classical and generalized Steiner Szeged indices in graph theory. We present a complete resolution to Ghorbani's conjecture (2019) regarding the ordering of these indices, demonstrating that while the conjecture holds for ordinary Szeged indices and certain restricted tree classes, it fails in general for higher-order Steiner versions. Through construction of counterexamples and systematic validation in special cases, we reveal fundamental differences in how these indices capture structural properties of graphs. Our work establishes new comparative relationships between different orders of Steiner Szeged indices and characterizes the extremal graphs that achieve boundary cases. These findings advance theoretical understanding of graph invariants and have practical implications for applications in mathematical chemistry, particularly in quantitative structure-activity relationship studies.