The conditions $c_1<c_2<a$ and $2c_2>a+c_1$ are equivalent to
$$ \begin{cases} \begin{align*} 2c_2&>a+c_1\\ c_2&>c_1\\ a&>c_2. \end{align*} \end{cases} $$
Subtracting the second inequality from the first and then subtracting 2 times the third one from the first one I get
$$ \begin{cases} \begin{align*} 0&>0\\ c_2&>c_1\\ a&>c_2, \end{align*} \end{cases} $$
which is a contradiction, right? Or do inequalities not work this way? In my teacher's suggested solution to the problem that this relates to, he seems to think the inequalities do not contradict each other.
You cannot subtract inequalities like that. For example, $1>0$ is a true inequality, and $2>0$ is also a true inequality, but if I subtract the two, I get $-1>0$, which is clearly false.
What you can do wit inequalities is you can add them, i.e. if $a>b$ and $c>d$ then $a+c>b+d$. You can multiply the inequalities by a positive number, for so if $a>b$ and $x>0$, then $ax>bx$. Multiplying by a negative number inverts the inequality sign.
You also have transitivity in inequalities, i.e. if $a>b$ and $b>c$, then $a>c$.
If you have a particular set of inequalities, in general, it is not trivial to see whether the inequalities have any solution, however, if the expressions in the inequalities are all linear, then you could get some help from linear programming