When computing the inferences for a given set of inequalities, throttle
the number of inferences that are stored for each leading term as soon as
INEQ_INFS_THRESHOLD
has been reached, which is then restricted
to THROTTLED_INF_NUM
.
When computing the inferences for a given set of inequalities, throttle
the number of inferences that are stored for each leading term as soon as
INEQ_INFS_THRESHOLD
has been reached, which is then restricted
to THROTTLED_INF_NUM
. Once the hard limit
INF_STOP_THRESHOLD
is reached for a particular leading term,
generation of inferences for that term is stopped altogether.
Create an inequality conjunction from an arbitrary set of geq-zero-inequalities (left-hand sides).
Create an inequality conjunction from an arbitrary set of geq-zero-inequalities (left-hand sides).
Compute the conjunction of a number of inequality conjunctions.
Compute the conjunction of a number of inequality conjunctions.
Perform Fourier-Motzkin elimination on one particular symbol
t
.
Perform Fourier-Motzkin elimination on one particular symbol
t
. The result is the collection of eliminated inequalities,
and the collection of remaining inequalities (including inferences from
the removed inequalities).
If an unsatisfiable inequality is derived, the exception
UNSATISFIABLE_INEQ_EXCEPTION
is thrown.
(Since version ) see corresponding Javadoc for more information.