Omega: a solver for quantifierfree problems in Presburger Arithmetic¶
Author:  Pierre Crégut 

Description of omega
¶

omega
omega
is a tactic for solving goals in Presburger arithmetic, i.e. for proving formulas made of equations and inequalities over the typenat
of natural numbers or the typeZ
of binaryencoded integers. Formulas onnat
are automatically injected intoZ
. The procedure may use any hypothesis of the current proof session to solve the goal.Multiplication is handled by
omega
but only goals where at least one of the two multiplicands of products is a constant are solvable. This is the restriction meant by "Presburger arithmetic".If the tactic cannot solve the goal, it fails with an error message. In any case, the computation eventually stops.

Variant
romega
¶ To be documented.
Arithmetical goals recognized by omega
¶
omega
applies only to quantifierfree formulas built from the connectives:
/\ \/ ~ >
on atomic formulas. Atomic formulas are built from the predicates:
= < <= > >=
on nat
or Z
. In expressions of type nat
, omega
recognizes:
+  * S O pred
and in expressions of type Z
, omega
recognizes numeral constants and:
+  * Z.succ Z.pred
All expressions of type nat
or Z
not built on these
operators are considered abstractly as if they
were arbitrary variables of type nat
or Z
.
Messages from omega
¶
When omega
does not solve the goal, one of the following errors
is generated:

Error
omega can't solve this system.
¶ This may happen if your goal is not quantifierfree (if it is universally quantified, try
intros
first; if it contains existentials quantifiers too,omega
is not strong enough to solve your goal). This may happen also if your goal contains arithmetical operators not recognized byomega
. Finally, your goal may be simply not true!

Error
omega: Not a quantifierfree goal.
¶ If your goal is universally quantified, you should first apply
intro
as many times as needed.

Error
omega: Unrecognized atomic proposition: ...
¶

Error
omega: Can't solve a goal with proposition variables.
¶

Error
omega: Unrecognized proposition.
¶

Error
omega: Can't solve a goal with nonlinear products.
¶

Error
omega: Can't solve a goal with equality on type ...
¶
Using omega
¶
The omega
tactic does not belong to the core system. It should be
loaded by
 Require Import Omega.
 [Loading ML file z_syntax_plugin.cmxs ... done] [Loading ML file quote_plugin.cmxs ... done] [Loading ML file newring_plugin.cmxs ... done] [Loading ML file omega_plugin.cmxs ... done]
Example
 Require Import Omega.
 Open Scope Z_scope.
 Goal forall m n:Z, 1 + 2 * m <> 2 * n.
 1 subgoal ============================ forall m n : Z, 1 + 2 * m <> 2 * n
 intros; omega.
 No more subgoals.
 Abort.
 Goal forall z:Z, z > 0 > 2 * z + 1 > z.
 1 subgoal ============================ forall z : Z, z > 0 > 2 * z + 1 > z
 intro; omega.
 No more subgoals.
 Abort.
Options¶

Flag
Stable Omega
¶ Deprecated since version 8.5.
This deprecated option (on by default) is for compatibility with Coq pre 8.5. It resets internal name counters to make executions of
omega
independent.

Flag
Omega UseLocalDefs
¶ This option (on by default) allows
omega
to use the bodies of local variables.

Flag
Omega System
¶ This option (off by default) activate the printing of debug information

Flag
Omega Action
¶ This option (off by default) activate the printing of debug information
Technical data¶
Overview of the tactic¶
 The goal is negated twice and the first negation is introduced as a hypothesis.
 Hypotheses are decomposed in simple equations or inequalities. Multiple goals may result from this phase.
 Equations and inequalities over
nat
are translated overZ
, multiple goals may result from the translation of subtraction. Equations and inequalities are normalized.
 Goals are solved by the OMEGA decision procedure.
 The script of the solution is replayed.
Overview of the OMEGA decision procedure¶
The OMEGA decision procedure involved in the omega
tactic uses
a small subset of the decision procedure presented in [Pug92]
Here is an overview, refer to the original paper for more information.
 Equations and inequalities are normalized by division by the GCD of their coefficients.
 Equations are eliminated, using the Banerjee test to get a coefficient equal to one.
 Note that each inequality cuts the Euclidean space in half.
 Inequalities are solved by projecting on the hyperspace defined by cancelling one of the variables. They are partitioned according to the sign of the coefficient of the eliminated variable. Pairs of inequalities from different classes define a new edge in the projection.
 Redundant inequalities are eliminated or merged in new equations that can be eliminated by the Banerjee test.
 The last two steps are iterated until a contradiction is reached (success) or there is no more variable to eliminate (failure).
It may happen that there is a real solution and no integer one. The last steps of the Omega procedure are not implemented, so the decision procedure is only partial.
Bugs¶
 The simplification procedure is very dumb and this results in many redundant cases to explore.
 Much too slow.
 Certainly other bugs! You can report them to https://coq.inria.fr/bugs/.