For a simpler problem, consider such a function x^2-log(1+x^2). This function is convex, because t-log(t+1) is convex and increasing when t>0 and x^2 is convex and greater than zero. CVX could not solve this problem either.
I agree that this simpler function is convex. But it does not matter. We do not claim CVX can solve any convex problem; it only solves those that can be proven convex by application of the DCP rules. That is a fundamental aspect of its design, as well as the design of the solvers it uses.