For some reason, I'm having trouble doing even relatively basic (at least, it seems relatively basic) simplification in QEPCAD. For instance, when I try to run the following line of code:
sage: qepcad(-k2 + 6km - 9*m2 + 1 > 0)
(with k,m already set as variables), the computation goes on for much longer than I want it to, and in fact I have yet to see it finish. I'm not really sure why this is the case, or if problems like this just take a long time for QEPCAD (I know that Wolfram Alpha does these very quickly). Really what I want is just to find one integer solution to the above inequality (i.e. k = m = 0) and more generally, I want to be able to take n of these kind of inequalities (I would prefer being able to do higher degrees as well, but I think just quadratic would be fine) and find integers k,m which satisfy all of them, or have the program tell me no such k,m exist. So if there's a different approach I should be taking then please let me know, or if I need to give more information on anything just say so. I have absolutely no experience programming, I'm just trying to write up a calculator for something I'm working on for my math PhD.
