| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: minizinc | Distribution: SUSE Linux Enterprise 16 |
| Version: 2.8.7 | Vendor: openSUSE |
| Release: bp160.1.12 | Build date: Sat Jan 18 07:09:16 2025 |
| Group: Productivity/Scientific/Math | Build host: reproducible |
| Size: 6374552 | Source RPM: libminizinc-2.8.7-bp160.1.12.src.rpm |
| Packager: https://bugs.opensuse.org | |
| Url: https://www.minizinc.org/ | |
| Summary: A high-level constraint modelling language | |
You can use MiniZinc to model constraint satisfaction and optimisation problems in a high-level, solver-independent way, taking advantage of a large library of pre-defined constraints. Your model is then compiled into FlatZinc, a solver input language that is understood by a wide range of solvers.
MPL-2.0
* Sat Jan 18 2025 Stefan Brüns <stefan.bruens@rwth-aachen.de>
- update to 2.8.7:
* Bug fixes:
+ Fix bug that caused where clauses to be removed from
comprehensions.
+ Fix optimisation of Boolean constraints that could sometimes
trigger an assertion failure in debug builds.
- update to 2.8.6:
* Changes:
+ Variable in operators on arrays of (nested) records and
tuples containing only enumerable (enum, int, or bool) will
now be rewritten into table global constraints.
+ Values that are par in the left hand side will be checked and
filtered from the resulting table constraint.
+ Variable <, <=, > and >= operators on (nested) records and
tuples containing only enumerable (enum, int, or bool) will
now be rewritten into lex_less or lex_lesseq global
constraints.
+ Automatically detect SCIP 9.0.1 and potential future versions
on Windows.
+ The interface to the HiGHS solver now requires version 1.7.2
or later.
+ Enforce strict enum type correctness for set operations.
+ Add par opt overloads of min / max and return enum values
instead of coercing to integers.
+ Use half-reification only when there isn’t a reification that
is a more specific match.
+ Add multidimensional overloads for the ++ array concatenation
operator.
* Bug fixes:
+ Fix incorrect type error for array literals where the first
element is <> and subsequent elements are sets.
+ Fix missing code block in visualisation feature
documentation.
+ Emit type error when using variable if-then-else/array access
containing tuples or records containing non-varifiable types.
+ Emit type error when using a variable comprehension with a
tuple/record type.
+ Emit type error when using optional array access for arrays
of tuples/records.
+ Emit type error for array literals with <> and var set
elements.
+ Fix missing cross-references for IDE preference dialog
documentation figures.
+ Fix crash when using nested tuples/record types inside var
if-then-else expressions.
+ Fix evaluation error for comprehensions with an initial
assignment generator and a where clause which doesn’t involve
any of the generator identifiers.
+ Fix type checking of if then else expressions with _ in the
else branch.
+ Fix parsing of the most negative integer literal.
+ Fix typo in warning messages for undefined results in
function calls.
+ Fix bug in flattening identifier causing debug assertion to
fail.
+ Fix missing type when flattening indexed var comprehension
leading to error or incorrect value type.
+ Fix crash when generating error message for mismatched index
set where an enum index set is empty.
+ Fix crash due to incorrect handling of negated constraints
matching entry in CSE map.
+ Fix type error due to missing overload of max.
+ Fix handling of contexts and maybe_partial annotations when
flattening par expressions.
+ Fix par evaluation of boolean operators where an operand is
an array access into an empty array literal.
+ Fix crash when concatenating arrays of annotations.
+ Ensure DZN output of enum index sets of multidimensional
arrays is properly quoted.
+ Fix parsing of enumerated values in JSON for integer
parameters.
+ Fix crash during flattening of clauses with opt bool
arguments.
+ Fix the coercions of index set for empty array literals to
allow any of the index sets to be empty.
+ Fix behaviour of overloading for the ++ operator.
+ Avoid outputting objective statistic when value is invalid
for MIP solvers.
+ Fix bug in unification of aliased output variables when using
- O2 and above.
* Sun Sep 08 2024 Dirk Müller <dmueller@suse.com>
- update to 2.8.5:
* Fix specification for constraint items and annotations in
FlatZinc JSON.
* Fix flattening of negated let expressions with constraints.
* Fix crash when equating identifiers to tuples/records in if-
then-else expressions.
* Fix string_length function to return the number of Unicode
code points rather than the number of bytes (i.e., to
interpret the string as UTF-8).
* Emit type error for opt tuples and records created through
type aliases.
* Fix evaluation of par partial functions returning arrays.
* Fix type inference for if-then-else expressions with
different tuple or record types in the branches.
* Fix evaluation error caused by removal of fixed FlatZinc
variables without fixing them in the output model.
* Fix computed type when flattening cv comprehensions
containing tuple or record types.
* Fix unsatisfiability caused by reification in negated boolean
context (:bugref:`813`).
* Fix bug in computation of common type of incompatible record
types.
* Fix crash when type checking nested arrays of tuples or
records.
* Fix incorrect unification of flattened tuple/record fields
with paths enabled.
* Add string_split function that splits a string into an array
of strings based on a separator.
* Add json_section annotation to mark an output item as a JSON
section (:bugref:`816`).
* Add -w and --disable-warnings flags that will suppress all
warnings emitted by the flattening process.
* Add option for solver libraries to set
mzn_opt_annotate_computed_domains such that the compiler will
signal domains that are enforced by separate constraints
using a computed_domain annotation.
* Always output multidimensional arrays as nested arrays when
using showJSON for consistency.
* Add missing implementation for default for sets expressions.
* Add missing optional versions of unary mathematical
functions/operators.
* Improve special-case handling of boolean <-> and xor
operators.
* Fix bundled OpenSSL libraries on Windows.
* Allow MOOC submission window to be scrolled.
* Increase hard process termination timeout to 1s.
* Fix crash when using records inside solution checker modules.
* Fix pretty printing of record literals and types with unicode
field names.
* Fix creation of par versions functions containing var
binary/unary operators (:bugref:`792`).
* Fix potential crash when printing of output model involving
records.
* Fix computation of supertype of tuples/records involving <>
fields.
* Fix a bug where the compiler would incorrectly set variable
domains as computed when processing linear constraints.
* Fix invalid JSON produced by MIP interfaces due to infinite
values for statistics.
* Fix possible crash during type specialisation involving array
[_] of $$T types.
* Fix output of structured types containing arrays of enums
(:bugref:`793`).
* Fix justified formatting to work with arrays of enums.
* Fix incorrect unification of arrays of reverse mapped
variables with paths enabled.
* Fix problem where incorrect type errors would occur when
merging records or tuples types in an array declaration.
* Fix bug where unused reverse-mapped variables were removed
from the output model while still being marked as output in
the FlatZinc.
* Fix decomposition of set variables with empty domains when
using nosets.mzn.
* Fix a problem where the reduced range syntax in combination
with enums would produce an error when the resulting range
was empty.
* Fix incorrect unification of tuple/record fields in array
accesses with paths enabled (:bugref:`802`).
* Fix crash when using tuples/records in par arrays or calls
containing var expressions.
* Fix bug where variables could be removed from the FlatZinc
but not the output model when optimising bool2int
(:bugref:`803`).
* Add missing coercions for comprehension where clauses and
assignment generators (:bugref:`807`).
* Fix bug in handling of domains for structured types during
type specialisation.
* Fix handling of search annotations when reading FlatZinc
files.
* Fix bug during optimisation which could cause the compiler to
hang due to not updating hashes of identifiers
(:bugref:`805`).
* Fix incorrect definition of all_different in the
gecode_presolver library where it was not enforced that fixed
values be all different (:bugref:`798`).
* Fix crash when resolving type aliases for function parameters
with $T array dimensions (:bugref:`806`).
* Fix default operator for par opt set parameters
(:bugref:`809`).
* Fix output of par opt set enumerated types.
* Fix pretty printing of records when using the document
printer.
* Fix internal error when binding numeric literals to
declarations with existing right-hand sides.
* Fix contexts of arguments of double-negated integer
comparisons (:bugref:`810`).
* Fix context of indices in array access expressions
(:bugref:`719`).
* Fix problem where specialised flattening for some forms of
binary operators would not correctly forward the partiality
of its arguments (:bugref:`766`).
* Remove internal duplicate functionality that could sometimes
cause problems when assigning variables in constraints
(:bugref:`769`).
* Do not try to check right hand side of parameter variable
declarations that are par because of singular domains
(:bugref:`771`).
* Fix a problem in the parser where anonymous enumerated types
could not be used in DZN files (:bugref:`776`).
* Fix identifier lookup bug in internal Chuffed interface
(:bugref:`782`).
* Fix some minor inconsistencies in the FlatZinc JSON schema
and generation.
* Fix crash involving var comprehensions with set types by
rejecting unsupported type (:bugref:`779`).
* Fix internal error during evaluation of par opt set
expressions.
* Fix invalid FlatZinc produced when search annotations are
passed non-1-based arrays (:bugref:`768`).
* Fix bug in evaluation of annotations causing invalid FlatZinc
to be produced (:bugref:`768`, :bugref:`788`).
* Fix substitution of fixed objective variable value into solve
item (:bugref:`773`).
* Fix check for presence of set2iter redefinition
(:bugref:`778`).
* Fix incorrect removal of constraint due to use of
redefinition of bool_clause_reif when constraint is not
reified (:bugref:`785`).
* Remove documentation of strictly_increasing (and decreasing)
for bool types, and change definition from a solver redefined
global, to a simple library definition with user warning
(:bugref:`784`).
* Add version of strictly_increasing (and decreasing) for
float, opt float, and set of int types.
* Automatically detect SCIP 8.1.0 and potential future versions
on Windows.
* Fix crash when using type aliases with -O2 (:bugref:`783`).
* Automatically detect Gurobi 11.0 and potential future
versions.
* Allow array literals with all <> members (:bugref:`747`).
* Increase maximum number of threads from default Qt limit
(:idebugref:`196`).
* Sat Dec 30 2023 Stefan Brüns <stefan.bruens@rwth-aachen.de>
- update to 2.8.2:
* Bug fixes:
+ Fix incorrect FlatZinc definition in the gecode_presolver
solver library.
+ Fix type specialisation for function with an polymorphic
array argument and a non-array return type with the same
type-inst identifier.
+ Fix crash during typechecking of overloaded functions
differing only by inst returning structured types.
+ Fix incorrect type checking of polymorphic functions with
type-inst IDs inside structured types.
+ Fix evaluation error when boolean variables are fixed during
flattening.
+ Fix incorrect call names output when generating .ozn files.
+ Fix incorrect output of record access as tuple access in
.ozn files.
+ Fix definition of array_intersect so that it can be used in
non-positive contexts.
+ Fix standards definitions of increasing variants to correct
be ignored when the argument array is empty.
+ Fix a problem where exceptions thrown for undefined
expressions were not caught during the aggregation of linear
expressions, breaking relational semantics.
+ Fix crash when calculating computed domain of a declaration.
+ Fix x-y line/scatter visualisations.
* Changes:
+ Support var set``s of enums for ``array_union and
array_intersect.
+ Support var enums for the .. range operator.
+ Always perform substitution of fixed values before outputting
FlatZinc for consistency.
* Changes in the IDE:
+ Make process handling more robust to failures.
- update to 2.8.1:
* Bug fixes:
+ Fix incorrect message for par array out of bounds indicating
that array is empty
+ Fix incorrect propagation of Boolean variables potentially
causing output not accepted by Gecode and Chuffed.
+ Fix a problem where the usage of lb on a Boolean expression
would return -infinity..
+ Fix omission of error location when there is no stack trace
available.
+ Fix type specialisation to always make par versions of
functions available for output.
+ Fix internal error when checking return value of functions
involving arrays of optional values.
+ Fix incorrect false values for has_output_item when running
with --model-interface-only
+ Fix translation of search annotations with multi-dimensional
arrays as arguments.
+ Fix bug in output generation for some visualisation functions.
+ Fix problem where tuple or record assignments would sometimes
trigger segmentation faults.
+ Fix context when binding the result of flattening a
concatenation operation, resolving a possible segmentation
fault.
+ Fix incorrect possible evaluation error for in operator
involving an array RHS.
* Changes:
+ Add --solution-checker option to allow specifying the
solution checker (allowing use from a parameter configuration
.mpc file).
+ Produce tighter bounds in compute_mod_bounds for the
mod operator.
* Changes in the IDE:
+ Fix command used to run findMUS and Globalizer.
+ Add ability to set the ports used for the visualisation
server.
+ Add option for printing the visualisation server URL for
debugging purposes.
+ Add more information to subprocess error messages.
- update to 2.8.0:
* Changes in interfaces to solvers:
+ OR-Tools is now bundled with the MiniZinc IDE on all
platforms.
+ HiGHS is now loaded as a dynamic plugin instead of statically
linked, and now supports outputting intermediate solutions
for optimisation problems.
+ Add support for producing a JSON-based version of FlatZinc as
the output format of the MiniZinc compiler.
+ Replace supportsMzn, supportsFzn and supportsNL solver
configuration flags with new option inputType. The old flags
are still supported for backwards compatibility.
+ Add experimental support for restart based meta-search
specification for the Gecode and Chuffed solvers, as first
explored in Solver-Independent Large Neighbourhood Search and
A Modern Architecture for Constraint Modelling Languages.
+ Automatically detect current versions of CPLEX.
* Changes in the MiniZinc Library:
+ Add cumulatives scheduling global constraint.
+ Add the opt variants of the global_cardinality functions, and
add enumerated type typesafety between the values of the
decision variables and the cover parameters.
+ Add optional versions of count_* global constraints.
+ (strictly_)decreasing will now always be rewritten into
(strictly_)increasing and has support for option types.
+ Allow libraries to define how to iterate over var set of int
using the function set2iter, useful for different set
representations.
+ Stabilise the IDE visualisation library, allowing all
visualisation functions to be used from output statements,
and removing the need for manual calls to showJSON in custom
visualisations. This is a breaking change for users of the
previous experimental API.
+ Add mzn_half_reify_clause compiler option to allow solvers to
disable the half reification of bool_clause constraints.
+ Update the reflection functions ub, lb, and dom to return
enum values.
+ Use tuples to implement the decomposition of optional
variables, avoiding possible CSE aliasing problems.
* Changes in the compiler:
+ CSE has been adjusted to handle commutative functions when
annotated using the promise_commutative annotation.
+ mzn_reverse_map_var is now only called on output variables
that do not yet have reverse mappers after initial
flattening, but are required by the output model.
+ Improve error messaging for invalid parameter configuration
(.mpc) files.
+ Add a list of messages generated by solution checkers to the
checker message when using --json-stream.
+ Support output of command line argument parsing errors in
- -json-stream mode.
* Bug fixes:
+ Fix restoration of tuple/record domains when flattening let
expressions.
+ Fix type checking error due to creation of incorrect par
versions of functions involving tuples/records.
+ Ensure that when --solver is used, the given solver
configuration file is always selected even when it collides
with a solver in the search paths.
+ Fix error when running satisfaction problems using the Gecode
presolver where an output variable is also an
introduced variable.
+ Resolve a problem where unification in the optimization phase
might remove variables part of the output.
+ Fix possible crash when printing the final solution using the
built-in Chuffed interface.
+ Don’t print the final status line from solution checkers.
+ Fix typechecking of par type-inst identifiers when
instantiated using structured types involving var types.
+ Implement fix and is_fixed for strucutred types.
+ Ensure reverse mappers are created when flattening
tuple/record literals. This resolves certain errors during
output processing in models using these types.
+ Fix problem where certain strings in exceptions might be
garbage collected before they are output.
+ Fix problem where argument names of generated functions could
conflict with model declared names.
+ Fix problem where the common type of complex records or
tuples was not correctly determined in the array literals.
+ Fix a problem in the parser where a nullptr would be used
before a syntax error was thrown.
+ Fix error management when reading preference files.
+ Fix segmentation fault caused by the creation of invalid
domain constraints generated for functions with arrays of
tuples or records parameters.
+ Fix crash when instantiating a type-inst identifier using
only <>.
+ Fix evaluation of comprehensions containing opt string.
+ Fix crash when instantiating polymorphic functions using
tuples/records with many var or opt fields.
+ Do not generate default DZN output when there are only
sectioned output items present.
+ Fix the edge indexing of the edges for the final node in the
neural_net global constraint.
+ Add better error messaging when an index set mismatch is
encountered in the standard library.
+ Fix evaluation error when indexing into an array using <>.
+ Fix incorrect unsatisfiability when equating optional
variables with non-intersecting domains.
+ Fix array access using optional indices for multidimensional
arrays.
+ Fix output of zero length arrays of optional variables.
+ Fix output processing performance degradation when printing
arrays in DZN output mode.
+ Fix card function on set of floats and bools.
+ Make set literals containing strings or annotations a
type error.
* Changes in the IDE:
+ Fix unreadable cheat sheet font colour in dark mode.
+ Add option to output objective value and enable by default.
+ Show manually input parameters in output window.
+ Fix missing checker messages.
+ Fix incorrect OpenSSL version in Linux packages.
- Add minimal checks
- Add patches:
* 0001-Disambiguate-UNKNOWN-EXCEPTION.patch
* 0002-Catch-std-exception-by-const-reference.patch
* 0003-Try-to-get-some-more-information-when-catching.patch
* Thu Nov 09 2023 Dirk Müller <dmueller@suse.com>
- update to 2.7.6:
* Change the library and solver configuration path of builtin
version of Chuffed to prevent file conflicts
* Use the verbose compilation flag to control the verbosity of
the MIP domains stage
* Introduces the ``arg_val`` and ``arg_val_weak`` globals that
return the index of the first occurrence of a value in a given
array.
* Introduces the ``var_perm_sym`` and ``var_sqr_sym`` symmetry
breaking globals.
* Enable parallel search for the built-in Gecode presolver.
* Use native Qt dark mode on Windows where supported.
* Improve behaviour of the custom solver parameter dialog.
* ``ASTString`` constructor that uses ``std::string`` is now
explicit to avoid unexpected or unnecessary GC allocation.
* Circular definitions through the use of annotations will now
be reported as type errors, rather incurring infinite recursion
* Optimize the compilation of identical calls in different
contexts by recursively changing the contexts of the (uncompiled)
dependent calls, instead of flattening multiple times.
* Change domains of set variables when encountering (par)
equalities, or negated ``in`` constraints at the root level.
* Calls to ``min`` and ``max`` with ``par set of int`` type
argument will now be undefined (becoming ``false`` in the
closest Boolean context). This makes them consistent with
the calls with an argument of type ``var set of int``.
* Note that previous behaviour would have returned ``infinity``
or ``-infinity`` respectively (:bugref:`661`).
* Only show MOOC error code when response is actually an error
* Add documentation for ``--input-is-flatzinc`` flag
* Add ``ceil``, ``floor`` and ``round`` functions for ``var
float``, and corresponding FlatZinc builtins ``float_ceil``,
``float_floor`` and ``float_round`` that can be overridden
by solvers in the new ``redefinitions-2.7.1.mzn`` library file
* Fix highlighting of multiline comments starting with ``/*/``
* Fix bundling of incompatible OpenSSL version in linux
packages.
* Support for tuple and record types as well as type-inst
synonyms has been added.
* Extended enumerated types can now be constructed from non-
contiguous sets.
* WebAssembly is now fully supported as a target platform.
* MiniZinc now includes a solver interface for the `HiGHS
linear optimisation suite. HiGHS is included by default in
the MiniZincIDE package, and available using ``--solver highs``.
* The SCIP interface has been updated and is now compatible
with version 7 and 8 only.
* A solver's globals library specified in a configuration file
will now always be passed to the compiler using the ``-G``
flag. This allows users to easily override this library from
command line when required.
* Automatically detect Gurobi 10.0 and potential future
versions.
* Avoid loading all solver plugin DLLs on startup, instead
loading when required.
* The non-FlatZinc interfaces now also accept the ``--free-
search`` flag in addition to the ``-f`` flag.
* Ensure user config directory is created when modifying
solver search paths (:idebugref:`167`).
* Add tooltips to the CP-Profiler status bar legend.
* Add support for mooc submissions which include file editing
history.
* bugfixes
* Sat Jul 16 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de>
- Update to version 2.6.4
https://github.com/MiniZinc/libminizinc/blob/2.6.4/changes.rst
- Drop upstream patches:
* 0001-Fix-missing-return-in-non-void-function.patch
* 0001-Add-memory-include-required-for-unique_ptr.patch
* Sat May 21 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de>
- Update to version 2.6.3
https://github.com/MiniZinc/libminizinc/blob/2.6.3/changes.rst
- Fix build with GCC 12.1.0, add
0001-Add-memory-include-required-for-unique_ptr.patch
* Thu Apr 28 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de>
- Depend on gecode for building the presolver, and recommend the
gecode-minizinc solver plugin.
* Tue Apr 26 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de>
- Initial package version (2.6.2)
/usr/bin/minizinc /usr/bin/mzn2doc /usr/lib64/libmzn.so /usr/share/doc/packages/minizinc /usr/share/doc/packages/minizinc/README.md /usr/share/doc/packages/minizinc/changes.rst /usr/share/licenses/minizinc /usr/share/licenses/minizinc/LICENSE.txt /usr/share/minizinc /usr/share/minizinc/Preferences.json /usr/share/minizinc/geas /usr/share/minizinc/geas/fzn_all_different_int.mzn /usr/share/minizinc/geas/fzn_alldifferent_except_0.mzn /usr/share/minizinc/geas/fzn_cumulative.mzn /usr/share/minizinc/geas/fzn_disjunctive.mzn /usr/share/minizinc/geas/fzn_global_cardinality.mzn /usr/share/minizinc/geas/fzn_inverse.mzn /usr/share/minizinc/geas/fzn_table_int.mzn /usr/share/minizinc/geas/fzn_value_precede_int.mzn /usr/share/minizinc/geas/redefinitions-2.0.mzn /usr/share/minizinc/geas/redefinitions.mzn /usr/share/minizinc/gecode_presolver /usr/share/minizinc/gecode_presolver/fzn_all_different_int.mzn /usr/share/minizinc/gecode_presolver/fzn_all_equal_int.mzn /usr/share/minizinc/gecode_presolver/fzn_among.mzn /usr/share/minizinc/gecode_presolver/fzn_arg_max_int.mzn /usr/share/minizinc/gecode_presolver/fzn_arg_min_int.mzn /usr/share/minizinc/gecode_presolver/fzn_at_least_int.mzn /usr/share/minizinc/gecode_presolver/fzn_at_least_set.mzn /usr/share/minizinc/gecode_presolver/fzn_at_most_int.mzn /usr/share/minizinc/gecode_presolver/fzn_at_most_set.mzn /usr/share/minizinc/gecode_presolver/fzn_bin_packing.mzn /usr/share/minizinc/gecode_presolver/fzn_bin_packing_capa.mzn /usr/share/minizinc/gecode_presolver/fzn_bin_packing_load.mzn /usr/share/minizinc/gecode_presolver/fzn_circuit.mzn /usr/share/minizinc/gecode_presolver/fzn_count_eq.mzn /usr/share/minizinc/gecode_presolver/fzn_count_eq_reif.mzn /usr/share/minizinc/gecode_presolver/fzn_cumulative.mzn /usr/share/minizinc/gecode_presolver/fzn_cumulatives.mzn /usr/share/minizinc/gecode_presolver/fzn_decreasing_bool.mzn /usr/share/minizinc/gecode_presolver/fzn_decreasing_int.mzn /usr/share/minizinc/gecode_presolver/fzn_diffn.mzn /usr/share/minizinc/gecode_presolver/fzn_disjoint.mzn /usr/share/minizinc/gecode_presolver/fzn_distribute.mzn /usr/share/minizinc/gecode_presolver/fzn_exactly_int.mzn /usr/share/minizinc/gecode_presolver/fzn_exactly_set.mzn /usr/share/minizinc/gecode_presolver/fzn_global_cardinality.mzn /usr/share/minizinc/gecode_presolver/fzn_global_cardinality_closed.mzn /usr/share/minizinc/gecode_presolver/fzn_global_cardinality_low_up.mzn /usr/share/minizinc/gecode_presolver/fzn_global_cardinality_low_up_closed.mzn /usr/share/minizinc/gecode_presolver/fzn_increasing_bool.mzn /usr/share/minizinc/gecode_presolver/fzn_increasing_int.mzn /usr/share/minizinc/gecode_presolver/fzn_int_set_channel.mzn /usr/share/minizinc/gecode_presolver/fzn_inverse.mzn /usr/share/minizinc/gecode_presolver/fzn_inverse_set.mzn /usr/share/minizinc/gecode_presolver/fzn_lex_less_bool.mzn /usr/share/minizinc/gecode_presolver/fzn_lex_less_int.mzn /usr/share/minizinc/gecode_presolver/fzn_lex_lesseq_bool.mzn /usr/share/minizinc/gecode_presolver/fzn_lex_lesseq_int.mzn /usr/share/minizinc/gecode_presolver/fzn_link_set_to_booleans.mzn /usr/share/minizinc/gecode_presolver/fzn_member_bool.mzn /usr/share/minizinc/gecode_presolver/fzn_member_bool_reif.mzn /usr/share/minizinc/gecode_presolver/fzn_member_int.mzn /usr/share/minizinc/gecode_presolver/fzn_member_int_reif.mzn /usr/share/minizinc/gecode_presolver/fzn_nvalue.mzn /usr/share/minizinc/gecode_presolver/fzn_partition_set.mzn /usr/share/minizinc/gecode_presolver/fzn_range.mzn /usr/share/minizinc/gecode_presolver/fzn_regular.mzn /usr/share/minizinc/gecode_presolver/fzn_roots.mzn /usr/share/minizinc/gecode_presolver/fzn_sort.mzn /usr/share/minizinc/gecode_presolver/fzn_sum_pred.mzn /usr/share/minizinc/gecode_presolver/fzn_table_bool.mzn /usr/share/minizinc/gecode_presolver/fzn_table_int.mzn /usr/share/minizinc/gecode_presolver/fzn_value_precede_int.mzn /usr/share/minizinc/gecode_presolver/fzn_value_precede_set.mzn /usr/share/minizinc/gecode_presolver/gecode.mzn /usr/share/minizinc/gecode_presolver/precedence.mzn /usr/share/minizinc/gecode_presolver/redefinitions-2.0.mzn /usr/share/minizinc/gecode_presolver/redefinitions.mzn /usr/share/minizinc/linear /usr/share/minizinc/linear/CHANGELOG.txt /usr/share/minizinc/linear/domain_encodings.mzn /usr/share/minizinc/linear/fzn_all_different_int.mzn /usr/share/minizinc/linear/fzn_alldifferent_except_0.mzn /usr/share/minizinc/linear/fzn_circuit.mzn /usr/share/minizinc/linear/fzn_cumulative.mzn /usr/share/minizinc/linear/fzn_if_then_else_float.mzn /usr/share/minizinc/linear/fzn_if_then_else_int.mzn /usr/share/minizinc/linear/fzn_inverse.mzn /usr/share/minizinc/linear/fzn_inverse_in_range.mzn /usr/share/minizinc/linear/fzn_inverse_in_range_reif.mzn /usr/share/minizinc/linear/fzn_inverse_reif.mzn /usr/share/minizinc/linear/fzn_lex_chain_lesseq_bool.mzn /usr/share/minizinc/linear/fzn_lex_chain_lesseq_int.mzn /usr/share/minizinc/linear/fzn_lex_chain_lesseq_orbitope.mzn /usr/share/minizinc/linear/fzn_lex_less_bool.mzn /usr/share/minizinc/linear/fzn_lex_less_float.mzn /usr/share/minizinc/linear/fzn_lex_less_int.mzn /usr/share/minizinc/linear/fzn_lex_lesseq_bool.mzn /usr/share/minizinc/linear/fzn_lex_lesseq_float.mzn /usr/share/minizinc/linear/fzn_lex_lesseq_int.mzn /usr/share/minizinc/linear/fzn_regular.mzn /usr/share/minizinc/linear/fzn_sliding_sum.mzn /usr/share/minizinc/linear/fzn_subcircuit.mzn /usr/share/minizinc/linear/fzn_table_int.mzn /usr/share/minizinc/linear/options.mzn /usr/share/minizinc/linear/redefinitions-2.0.2.mzn /usr/share/minizinc/linear/redefinitions-2.0.mzn /usr/share/minizinc/linear/redefinitions-2.2.1.mzn /usr/share/minizinc/linear/redefinitions.mzn /usr/share/minizinc/linear/redefs_bool_imp.mzn /usr/share/minizinc/linear/redefs_bool_reifs.mzn /usr/share/minizinc/linear/redefs_lin_halfreifs.mzn /usr/share/minizinc/linear/redefs_lin_imp.mzn /usr/share/minizinc/linear/redefs_lin_reifs.mzn /usr/share/minizinc/linear/subcircuit_wDummy.mzn /usr/share/minizinc/std /usr/share/minizinc/std/all_different.mzn /usr/share/minizinc/std/all_different_except.mzn /usr/share/minizinc/std/all_different_except_0.mzn /usr/share/minizinc/std/all_different_int.mzn /usr/share/minizinc/std/all_different_int.mzn.deprecated.mzn /usr/share/minizinc/std/all_different_set.mzn /usr/share/minizinc/std/all_different_set.mzn.deprecated.mzn /usr/share/minizinc/std/all_disjoint.mzn /usr/share/minizinc/std/all_equal.mzn /usr/share/minizinc/std/all_equal_int.mzn /usr/share/minizinc/std/all_equal_int.mzn.deprecated.mzn /usr/share/minizinc/std/all_equal_set.mzn /usr/share/minizinc/std/all_equal_set.mzn.deprecated.mzn /usr/share/minizinc/std/alldifferent.mzn /usr/share/minizinc/std/alldifferent_except.mzn /usr/share/minizinc/std/alldifferent_except_0.mzn /usr/share/minizinc/std/alternative.mzn /usr/share/minizinc/std/among.mzn /usr/share/minizinc/std/among_fn.mzn /usr/share/minizinc/std/analyse_all_different.mzn /usr/share/minizinc/std/arg_max.mzn /usr/share/minizinc/std/arg_max_bool.mzn /usr/share/minizinc/std/arg_max_bool.mzn.deprecated.mzn /usr/share/minizinc/std/arg_max_float.mzn /usr/share/minizinc/std/arg_max_float.mzn.deprecated.mzn /usr/share/minizinc/std/arg_max_int.mzn /usr/share/minizinc/std/arg_max_int.mzn.deprecated.mzn /usr/share/minizinc/std/arg_min.mzn /usr/share/minizinc/std/arg_min_bool.mzn /usr/share/minizinc/std/arg_min_bool.mzn.deprecated.mzn /usr/share/minizinc/std/arg_min_float.mzn /usr/share/minizinc/std/arg_min_float.mzn.deprecated.mzn /usr/share/minizinc/std/arg_min_int.mzn /usr/share/minizinc/std/arg_min_int.mzn.deprecated.mzn /usr/share/minizinc/std/arg_sort.mzn /usr/share/minizinc/std/arg_sort_float.mzn /usr/share/minizinc/std/arg_sort_float.mzn.deprecated.mzn /usr/share/minizinc/std/arg_sort_int.mzn /usr/share/minizinc/std/arg_sort_int.mzn.deprecated.mzn /usr/share/minizinc/std/arg_val.mzn /usr/share/minizinc/std/at_least.mzn /usr/share/minizinc/std/at_least.mzn.deprecated.mzn /usr/share/minizinc/std/at_least_int.mzn /usr/share/minizinc/std/at_least_set.mzn /usr/share/minizinc/std/at_most.mzn /usr/share/minizinc/std/at_most.mzn.deprecated.mzn /usr/share/minizinc/std/at_most1.mzn /usr/share/minizinc/std/at_most_int.mzn /usr/share/minizinc/std/at_most_set.mzn /usr/share/minizinc/std/atleast.mzn /usr/share/minizinc/std/atmost.mzn /usr/share/minizinc/std/atmost1.mzn /usr/share/minizinc/std/bin_packing.mzn /usr/share/minizinc/std/bin_packing_capa.mzn /usr/share/minizinc/std/bin_packing_load.mzn /usr/share/minizinc/std/bin_packing_load_fn.mzn /usr/share/minizinc/std/bounded_path.mzn /usr/share/minizinc/std/circuit.mzn /usr/share/minizinc/std/circuit_opt.mzn /usr/share/minizinc/std/connected.mzn /usr/share/minizinc/std/cost_mdd.mzn /usr/share/minizinc/std/cost_regular.mzn /usr/share/minizinc/std/count.mzn /usr/share/minizinc/std/count_eq.mzn /usr/share/minizinc/std/count_fn.mzn /usr/share/minizinc/std/count_geq.mzn /usr/share/minizinc/std/count_gt.mzn /usr/share/minizinc/std/count_leq.mzn /usr/share/minizinc/std/count_lt.mzn /usr/share/minizinc/std/count_neq.mzn /usr/share/minizinc/std/cumulative.mzn /usr/share/minizinc/std/cumulative_opt.mzn /usr/share/minizinc/std/cumulatives.mzn /usr/share/minizinc/std/dag.mzn /usr/share/minizinc/std/decreasing.mzn /usr/share/minizinc/std/decreasing_bool.mzn /usr/share/minizinc/std/decreasing_bool.mzn.deprecated.mzn /usr/share/minizinc/std/decreasing_float.mzn /usr/share/minizinc/std/decreasing_float.mzn.deprecated.mzn /usr/share/minizinc/std/decreasing_int.mzn /usr/share/minizinc/std/decreasing_int.mzn.deprecated.mzn /usr/share/minizinc/std/decreasing_set.mzn /usr/share/minizinc/std/decreasing_set.mzn.deprecated.mzn /usr/share/minizinc/std/diffn.mzn /usr/share/minizinc/std/diffn_k.mzn /usr/share/minizinc/std/diffn_nonstrict.mzn /usr/share/minizinc/std/diffn_nonstrict_k.mzn /usr/share/minizinc/std/disjoint.mzn /usr/share/minizinc/std/disjunctive.mzn /usr/share/minizinc/std/disjunctive_opt.mzn /usr/share/minizinc/std/disjunctive_strict.mzn /usr/share/minizinc/std/disjunctive_strict_opt.mzn /usr/share/minizinc/std/distribute.mzn /usr/share/minizinc/std/distribute_fn.mzn /usr/share/minizinc/std/element.mzn /usr/share/minizinc/std/element_bool.mzn /usr/share/minizinc/std/element_bool.mzn.deprecated.mzn /usr/share/minizinc/std/element_float.mzn /usr/share/minizinc/std/element_float.mzn.deprecated.mzn /usr/share/minizinc/std/element_int.mzn /usr/share/minizinc/std/element_int.mzn.deprecated.mzn /usr/share/minizinc/std/element_set.mzn /usr/share/minizinc/std/element_set.mzn.deprecated.mzn /usr/share/minizinc/std/exactly.mzn /usr/share/minizinc/std/exactly.mzn.deprecated.mzn /usr/share/minizinc/std/exactly_int.mzn /usr/share/minizinc/std/exactly_set.mzn /usr/share/minizinc/std/experimental /usr/share/minizinc/std/experimental.mzn /usr/share/minizinc/std/experimental/all.mzn /usr/share/minizinc/std/experimental/on_restart /usr/share/minizinc/std/experimental/on_restart.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_complete.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_last_val_bool.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_last_val_float.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_last_val_int.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_last_val_set.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_sol_bool.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_sol_float.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_sol_int.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_sol_set.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_status.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_uniform_float.mzn /usr/share/minizinc/std/experimental/on_restart/fzn_on_restart_uniform_int.mzn /usr/share/minizinc/std/flatzinc_builtins.mzn /usr/share/minizinc/std/fzn_all_different_int.mzn /usr/share/minizinc/std/fzn_all_different_int_opt.mzn /usr/share/minizinc/std/fzn_all_different_int_reif.mzn /usr/share/minizinc/std/fzn_all_different_set.mzn /usr/share/minizinc/std/fzn_all_different_set_reif.mzn /usr/share/minizinc/std/fzn_all_disjoint.mzn /usr/share/minizinc/std/fzn_all_disjoint_reif.mzn /usr/share/minizinc/std/fzn_all_equal_int.mzn /usr/share/minizinc/std/fzn_all_equal_int_reif.mzn /usr/share/minizinc/std/fzn_all_equal_set.mzn /usr/share/minizinc/std/fzn_all_equal_set_reif.mzn /usr/share/minizinc/std/fzn_alldifferent_except.mzn /usr/share/minizinc/std/fzn_alldifferent_except_0.mzn /usr/share/minizinc/std/fzn_alldifferent_except_0_reif.mzn /usr/share/minizinc/std/fzn_alldifferent_except_reif.mzn /usr/share/minizinc/std/fzn_alternative.mzn /usr/share/minizinc/std/fzn_alternative_reif.mzn /usr/share/minizinc/std/fzn_among.mzn /usr/share/minizinc/std/fzn_among_reif.mzn /usr/share/minizinc/std/fzn_arg_max_bool.mzn /usr/share/minizinc/std/fzn_arg_max_bool_opt.mzn /usr/share/minizinc/std/fzn_arg_max_float.mzn /usr/share/minizinc/std/fzn_arg_max_float_opt.mzn /usr/share/minizinc/std/fzn_arg_max_int.mzn /usr/share/minizinc/std/fzn_arg_max_int_opt.mzn /usr/share/minizinc/std/fzn_arg_min_bool.mzn /usr/share/minizinc/std/fzn_arg_min_bool_opt.mzn /usr/share/minizinc/std/fzn_arg_min_float.mzn /usr/share/minizinc/std/fzn_arg_min_float_opt.mzn /usr/share/minizinc/std/fzn_arg_min_int.mzn /usr/share/minizinc/std/fzn_arg_min_int_opt.mzn /usr/share/minizinc/std/fzn_arg_sort_float.mzn /usr/share/minizinc/std/fzn_arg_sort_float_reif.mzn /usr/share/minizinc/std/fzn_arg_sort_int.mzn /usr/share/minizinc/std/fzn_arg_sort_int_reif.mzn /usr/share/minizinc/std/fzn_arg_val_bool.mzn /usr/share/minizinc/std/fzn_arg_val_bool_opt.mzn /usr/share/minizinc/std/fzn_arg_val_float.mzn /usr/share/minizinc/std/fzn_arg_val_float_opt.mzn /usr/share/minizinc/std/fzn_arg_val_int.mzn /usr/share/minizinc/std/fzn_arg_val_int_opt.mzn /usr/share/minizinc/std/fzn_array_int_union.mzn /usr/share/minizinc/std/fzn_array_opt_int_union.mzn /usr/share/minizinc/std/fzn_array_set_intersect.mzn /usr/share/minizinc/std/fzn_array_set_union.mzn /usr/share/minizinc/std/fzn_at_least_int.mzn /usr/share/minizinc/std/fzn_at_least_int_reif.mzn /usr/share/minizinc/std/fzn_at_least_set.mzn /usr/share/minizinc/std/fzn_at_least_set_reif.mzn /usr/share/minizinc/std/fzn_at_most1.mzn /usr/share/minizinc/std/fzn_at_most1_reif.mzn /usr/share/minizinc/std/fzn_at_most_int.mzn /usr/share/minizinc/std/fzn_at_most_int_reif.mzn /usr/share/minizinc/std/fzn_at_most_set.mzn /usr/share/minizinc/std/fzn_at_most_set_reif.mzn /usr/share/minizinc/std/fzn_bin_packing.mzn /usr/share/minizinc/std/fzn_bin_packing_capa.mzn /usr/share/minizinc/std/fzn_bin_packing_capa_reif.mzn /usr/share/minizinc/std/fzn_bin_packing_load.mzn /usr/share/minizinc/std/fzn_bin_packing_load_reif.mzn /usr/share/minizinc/std/fzn_bin_packing_reif.mzn /usr/share/minizinc/std/fzn_bounded_dpath_enum.mzn /usr/share/minizinc/std/fzn_bounded_dpath_enum_reif.mzn /usr/share/minizinc/std/fzn_bounded_dpath_int.mzn /usr/share/minizinc/std/fzn_bounded_dpath_int_reif.mzn /usr/share/minizinc/std/fzn_bounded_path_enum.mzn /usr/share/minizinc/std/fzn_bounded_path_enum_reif.mzn /usr/share/minizinc/std/fzn_bounded_path_int.mzn /usr/share/minizinc/std/fzn_bounded_path_int_reif.mzn /usr/share/minizinc/std/fzn_circuit.mzn /usr/share/minizinc/std/fzn_circuit_opt.mzn /usr/share/minizinc/std/fzn_circuit_opt_reif.mzn /usr/share/minizinc/std/fzn_circuit_reif.mzn /usr/share/minizinc/std/fzn_connected.mzn /usr/share/minizinc/std/fzn_connected_reif.mzn /usr/share/minizinc/std/fzn_cost_mdd.mzn /usr/share/minizinc/std/fzn_cost_mdd_reif.mzn /usr/share/minizinc/std/fzn_cost_regular.mzn /usr/share/minizinc/std/fzn_cost_regular_reif.mzn /usr/share/minizinc/std/fzn_count_eq.mzn /usr/share/minizinc/std/fzn_count_eq_par.mzn /usr/share/minizinc/std/fzn_count_eq_par_reif.mzn /usr/share/minizinc/std/fzn_count_eq_reif.mzn /usr/share/minizinc/std/fzn_count_geq.mzn /usr/share/minizinc/std/fzn_count_geq_par.mzn /usr/share/minizinc/std/fzn_count_geq_par_reif.mzn /usr/share/minizinc/std/fzn_count_geq_reif.mzn /usr/share/minizinc/std/fzn_count_gt.mzn /usr/share/minizinc/std/fzn_count_gt_par.mzn /usr/share/minizinc/std/fzn_count_gt_par_reif.mzn /usr/share/minizinc/std/fzn_count_gt_reif.mzn /usr/share/minizinc/std/fzn_count_leq.mzn /usr/share/minizinc/std/fzn_count_leq_par.mzn /usr/share/minizinc/std/fzn_count_leq_par_reif.mzn /usr/share/minizinc/std/fzn_count_leq_reif.mzn /usr/share/minizinc/std/fzn_count_lt.mzn /usr/share/minizinc/std/fzn_count_lt_par.mzn /usr/share/minizinc/std/fzn_count_lt_par_reif.mzn /usr/share/minizinc/std/fzn_count_lt_reif.mzn /usr/share/minizinc/std/fzn_count_neq.mzn /usr/share/minizinc/std/fzn_count_neq_par.mzn /usr/share/minizinc/std/fzn_count_neq_par_reif.mzn /usr/share/minizinc/std/fzn_count_neq_reif.mzn /usr/share/minizinc/std/fzn_cumulative.mzn /usr/share/minizinc/std/fzn_cumulative_opt.mzn /usr/share/minizinc/std/fzn_cumulative_opt_decomp.mzn /usr/share/minizinc/std/fzn_cumulative_opt_reif.mzn /usr/share/minizinc/std/fzn_cumulative_reif.mzn /usr/share/minizinc/std/fzn_cumulatives.mzn /usr/share/minizinc/std/fzn_cumulatives_decomp.mzn /usr/share/minizinc/std/fzn_dag.mzn /usr/share/minizinc/std/fzn_dag_reif.mzn /usr/share/minizinc/std/fzn_dconnected.mzn /usr/share/minizinc/std/fzn_dconnected_reif.mzn /usr/share/minizinc/std/fzn_diffn.mzn /usr/share/minizinc/std/fzn_diffn_k.mzn /usr/share/minizinc/std/fzn_diffn_k_reif.mzn /usr/share/minizinc/std/fzn_diffn_nonstrict.mzn /usr/share/minizinc/std/fzn_diffn_nonstrict_k.mzn /usr/share/minizinc/std/fzn_diffn_nonstrict_k_reif.mzn /usr/share/minizinc/std/fzn_diffn_nonstrict_reif.mzn /usr/share/minizinc/std/fzn_diffn_reif.mzn /usr/share/minizinc/std/fzn_disjoint.mzn /usr/share/minizinc/std/fzn_disjoint_reif.mzn /usr/share/minizinc/std/fzn_disjunctive.mzn /usr/share/minizinc/std/fzn_disjunctive_opt.mzn /usr/share/minizinc/std/fzn_disjunctive_opt_reif.mzn /usr/share/minizinc/std/fzn_disjunctive_reif.mzn /usr/share/minizinc/std/fzn_disjunctive_strict.mzn /usr/share/minizinc/std/fzn_disjunctive_strict_opt.mzn /usr/share/minizinc/std/fzn_disjunctive_strict_opt_decomp.mzn /usr/share/minizinc/std/fzn_disjunctive_strict_opt_reif.mzn /usr/share/minizinc/std/fzn_disjunctive_strict_reif.mzn /usr/share/minizinc/std/fzn_distribute.mzn /usr/share/minizinc/std/fzn_distribute_reif.mzn /usr/share/minizinc/std/fzn_dpath_enum.mzn /usr/share/minizinc/std/fzn_dpath_enum_reif.mzn /usr/share/minizinc/std/fzn_dpath_int.mzn /usr/share/minizinc/std/fzn_dpath_int_reif.mzn /usr/share/minizinc/std/fzn_dreachable_enum.mzn /usr/share/minizinc/std/fzn_dreachable_enum_reif.mzn /usr/share/minizinc/std/fzn_dreachable_int.mzn /usr/share/minizinc/std/fzn_dreachable_int_reif.mzn /usr/share/minizinc/std/fzn_dsteiner.mzn /usr/share/minizinc/std/fzn_dsteiner_reif.mzn /usr/share/minizinc/std/fzn_dtree_enum.mzn /usr/share/minizinc/std/fzn_dtree_enum_reif.mzn /usr/share/minizinc/std/fzn_dtree_int.mzn /usr/share/minizinc/std/fzn_dtree_int_reif.mzn /usr/share/minizinc/std/fzn_dwst.mzn /usr/share/minizinc/std/fzn_dwst_reif.mzn /usr/share/minizinc/std/fzn_exactly_int.mzn /usr/share/minizinc/std/fzn_exactly_int_reif.mzn /usr/share/minizinc/std/fzn_exactly_set.mzn /usr/share/minizinc/std/fzn_exactly_set_reif.mzn /usr/share/minizinc/std/fzn_geost.mzn /usr/share/minizinc/std/fzn_geost_bb.mzn /usr/share/minizinc/std/fzn_geost_bb_reif.mzn /usr/share/minizinc/std/fzn_geost_nonoverlap_k.mzn /usr/share/minizinc/std/fzn_geost_nonoverlap_k_reif.mzn /usr/share/minizinc/std/fzn_geost_reif.mzn /usr/share/minizinc/std/fzn_geost_smallest_bb.mzn /usr/share/minizinc/std/fzn_geost_smallest_bb_reif.mzn /usr/share/minizinc/std/fzn_global_cardinality.mzn /usr/share/minizinc/std/fzn_global_cardinality_closed.mzn /usr/share/minizinc/std/fzn_global_cardinality_closed_opt.mzn /usr/share/minizinc/std/fzn_global_cardinality_closed_reif.mzn /usr/share/minizinc/std/fzn_global_cardinality_closed_set.mzn /usr/share/minizinc/std/fzn_global_cardinality_low_up.mzn /usr/share/minizinc/std/fzn_global_cardinality_low_up_closed.mzn /usr/share/minizinc/std/fzn_global_cardinality_low_up_closed_opt.mzn /usr/share/minizinc/std/fzn_global_cardinality_low_up_closed_reif.mzn /usr/share/minizinc/std/fzn_global_cardinality_low_up_closed_set.mzn /usr/share/minizinc/std/fzn_global_cardinality_low_up_opt.mzn /usr/share/minizinc/std/fzn_global_cardinality_low_up_reif.mzn /usr/share/minizinc/std/fzn_global_cardinality_low_up_set.mzn /usr/share/minizinc/std/fzn_global_cardinality_opt.mzn /usr/share/minizinc/std/fzn_global_cardinality_reif.mzn /usr/share/minizinc/std/fzn_global_cardinality_set.mzn /usr/share/minizinc/std/fzn_if_then_else_bool.mzn /usr/share/minizinc/std/fzn_if_then_else_float.mzn /usr/share/minizinc/std/fzn_if_then_else_int.mzn /usr/share/minizinc/std/fzn_if_then_else_opt_bool.mzn /usr/share/minizinc/std/fzn_if_then_else_opt_float.mzn /usr/share/minizinc/std/fzn_if_then_else_opt_int.mzn /usr/share/minizinc/std/fzn_if_then_else_partiality.mzn /usr/share/minizinc/std/fzn_if_then_else_set.mzn /usr/share/minizinc/std/fzn_if_then_else_var_bool.mzn /usr/share/minizinc/std/fzn_if_then_else_var_float.mzn /usr/share/minizinc/std/fzn_if_then_else_var_int.mzn /usr/share/minizinc/std/fzn_if_then_else_var_opt_bool.mzn /usr/share/minizinc/std/fzn_if_then_else_var_opt_float.mzn /usr/share/minizinc/std/fzn_if_then_else_var_opt_int.mzn /usr/share/minizinc/std/fzn_if_then_else_var_set.mzn /usr/share/minizinc/std/fzn_increasing_bool.mzn /usr/share/minizinc/std/fzn_increasing_bool_opt.mzn /usr/share/minizinc/std/fzn_increasing_bool_reif.mzn /usr/share/minizinc/std/fzn_increasing_float.mzn /usr/share/minizinc/std/fzn_increasing_float_opt.mzn /usr/share/minizinc/std/fzn_increasing_float_opt_reif.mzn /usr/share/minizinc/std/fzn_increasing_float_reif.mzn /usr/share/minizinc/std/fzn_increasing_int.mzn /usr/share/minizinc/std/fzn_increasing_int_opt.mzn /usr/share/minizinc/std/fzn_increasing_int_opt_reif.mzn /usr/share/minizinc/std/fzn_increasing_int_reif.mzn /usr/share/minizinc/std/fzn_increasing_set.mzn /usr/share/minizinc/std/fzn_increasing_set_reif.mzn /usr/share/minizinc/std/fzn_int_set_channel.mzn /usr/share/minizinc/std/fzn_int_set_channel_reif.mzn /usr/share/minizinc/std/fzn_inverse.mzn /usr/share/minizinc/std/fzn_inverse_in_range.mzn /usr/share/minizinc/std/fzn_inverse_in_range_reif.mzn /usr/share/minizinc/std/fzn_inverse_opt.mzn /usr/share/minizinc/std/fzn_inverse_reif.mzn /usr/share/minizinc/std/fzn_inverse_set.mzn /usr/share/minizinc/std/fzn_inverse_set_reif.mzn /usr/share/minizinc/std/fzn_knapsack.mzn /usr/share/minizinc/std/fzn_knapsack_reif.mzn /usr/share/minizinc/std/fzn_lex2.mzn /usr/share/minizinc/std/fzn_lex2_reif.mzn /usr/share/minizinc/std/fzn_lex_chain_less_bool.mzn /usr/share/minizinc/std/fzn_lex_chain_less_bool_reif.mzn /usr/share/minizinc/std/fzn_lex_chain_less_int.mzn /usr/share/minizinc/std/fzn_lex_chain_less_int_reif.mzn /usr/share/minizinc/std/fzn_lex_chain_lesseq_bool.mzn /usr/share/minizinc/std/fzn_lex_chain_lesseq_bool_reif.mzn /usr/share/minizinc/std/fzn_lex_chain_lesseq_int.mzn /usr/share/minizinc/std/fzn_lex_chain_lesseq_int_reif.mzn /usr/share/minizinc/std/fzn_lex_chain_lesseq_orbitope.mzn /usr/share/minizinc/std/fzn_lex_chain_lesseq_orbitope_reif.mzn /usr/share/minizinc/std/fzn_lex_less_bool.mzn /usr/share/minizinc/std/fzn_lex_less_bool_reif.mzn /usr/share/minizinc/std/fzn_lex_less_float.mzn /usr/share/minizinc/std/fzn_lex_less_float_reif.mzn /usr/share/minizinc/std/fzn_lex_less_int.mzn /usr/share/minizinc/std/fzn_lex_less_int_reif.mzn /usr/share/minizinc/std/fzn_lex_less_set.mzn /usr/share/minizinc/std/fzn_lex_less_set_reif.mzn /usr/share/minizinc/std/fzn_lex_lesseq_bool.mzn /usr/share/minizinc/std/fzn_lex_lesseq_bool_reif.mzn /usr/share/minizinc/std/fzn_lex_lesseq_float.mzn /usr/share/minizinc/std/fzn_lex_lesseq_float_reif.mzn /usr/share/minizinc/std/fzn_lex_lesseq_int.mzn /usr/share/minizinc/std/fzn_lex_lesseq_int_reif.mzn /usr/share/minizinc/std/fzn_lex_lesseq_set.mzn /usr/share/minizinc/std/fzn_lex_lesseq_set_reif.mzn /usr/share/minizinc/std/fzn_link_set_to_booleans.mzn /usr/share/minizinc/std/fzn_link_set_to_booleans_reif.mzn /usr/share/minizinc/std/fzn_mdd.mzn /usr/share/minizinc/std/fzn_mdd_nondet.mzn /usr/share/minizinc/std/fzn_mdd_nondet_reif.mzn /usr/share/minizinc/std/fzn_mdd_reif.mzn /usr/share/minizinc/std/fzn_member_bool.mzn /usr/share/minizinc/std/fzn_member_bool_reif.mzn /usr/share/minizinc/std/fzn_member_float.mzn /usr/share/minizinc/std/fzn_member_float_reif.mzn /usr/share/minizinc/std/fzn_member_int.mzn /usr/share/minizinc/std/fzn_member_int_reif.mzn /usr/share/minizinc/std/fzn_member_set.mzn /usr/share/minizinc/std/fzn_member_set_reif.mzn /usr/share/minizinc/std/fzn_network_flow.mzn /usr/share/minizinc/std/fzn_network_flow_cost.mzn /usr/share/minizinc/std/fzn_network_flow_cost_reif.mzn /usr/share/minizinc/std/fzn_network_flow_reif.mzn /usr/share/minizinc/std/fzn_neural_net.mzn /usr/share/minizinc/std/fzn_neural_net_reif.mzn /usr/share/minizinc/std/fzn_nvalue.mzn /usr/share/minizinc/std/fzn_nvalue_reif.mzn /usr/share/minizinc/std/fzn_partition_set.mzn /usr/share/minizinc/std/fzn_partition_set_reif.mzn /usr/share/minizinc/std/fzn_path_enum.mzn /usr/share/minizinc/std/fzn_path_enum_reif.mzn /usr/share/minizinc/std/fzn_path_int.mzn /usr/share/minizinc/std/fzn_path_int_reif.mzn /usr/share/minizinc/std/fzn_piecewise_linear.mzn /usr/share/minizinc/std/fzn_piecewise_linear_non_continuous.mzn /usr/share/minizinc/std/fzn_piecewise_linear_non_continuous_reif.mzn /usr/share/minizinc/std/fzn_piecewise_linear_reif.mzn /usr/share/minizinc/std/fzn_range.mzn /usr/share/minizinc/std/fzn_range_reif.mzn /usr/share/minizinc/std/fzn_reachable_enum.mzn /usr/share/minizinc/std/fzn_reachable_enum_reif.mzn /usr/share/minizinc/std/fzn_reachable_int.mzn /usr/share/minizinc/std/fzn_reachable_int_reif.mzn /usr/share/minizinc/std/fzn_regular.mzn /usr/share/minizinc/std/fzn_regular_nfa.mzn /usr/share/minizinc/std/fzn_regular_nfa_reif.mzn /usr/share/minizinc/std/fzn_regular_nfa_set.mzn /usr/share/minizinc/std/fzn_regular_nfa_set_reif.mzn /usr/share/minizinc/std/fzn_regular_regexp.mzn /usr/share/minizinc/std/fzn_regular_reif.mzn /usr/share/minizinc/std/fzn_regular_set.mzn /usr/share/minizinc/std/fzn_regular_set.mzn.deprecated.mzn /usr/share/minizinc/std/fzn_regular_set_reif.mzn /usr/share/minizinc/std/fzn_roots.mzn /usr/share/minizinc/std/fzn_roots_reif.mzn /usr/share/minizinc/std/fzn_seq_precede_chain_int.mzn /usr/share/minizinc/std/fzn_seq_precede_chain_int_reif.mzn /usr/share/minizinc/std/fzn_seq_precede_chain_set.mzn /usr/share/minizinc/std/fzn_seq_precede_chain_set_reif.mzn /usr/share/minizinc/std/fzn_set_member.mzn /usr/share/minizinc/std/fzn_set_member_reif.mzn /usr/share/minizinc/std/fzn_sliding_sum.mzn /usr/share/minizinc/std/fzn_sliding_sum_reif.mzn /usr/share/minizinc/std/fzn_sort.mzn /usr/share/minizinc/std/fzn_sort_reif.mzn /usr/share/minizinc/std/fzn_span.mzn /usr/share/minizinc/std/fzn_span_reif.mzn /usr/share/minizinc/std/fzn_steiner.mzn /usr/share/minizinc/std/fzn_steiner_reif.mzn /usr/share/minizinc/std/fzn_strict_lex2.mzn /usr/share/minizinc/std/fzn_strict_lex2_reif.mzn /usr/share/minizinc/std/fzn_strictly_increasing_float.mzn /usr/share/minizinc/std/fzn_strictly_increasing_float_opt.mzn /usr/share/minizinc/std/fzn_strictly_increasing_float_opt_reif.mzn /usr/share/minizinc/std/fzn_strictly_increasing_float_reif.mzn /usr/share/minizinc/std/fzn_strictly_increasing_int.mzn /usr/share/minizinc/std/fzn_strictly_increasing_int_opt.mzn /usr/share/minizinc/std/fzn_strictly_increasing_int_opt_reif.mzn /usr/share/minizinc/std/fzn_strictly_increasing_int_reif.mzn /usr/share/minizinc/std/fzn_strictly_increasing_set.mzn /usr/share/minizinc/std/fzn_strictly_increasing_set_reif.mzn /usr/share/minizinc/std/fzn_subcircuit.mzn /usr/share/minizinc/std/fzn_subcircuit_reif.mzn /usr/share/minizinc/std/fzn_subgraph_enum.mzn /usr/share/minizinc/std/fzn_subgraph_enum_reif.mzn /usr/share/minizinc/std/fzn_subgraph_int.mzn /usr/share/minizinc/std/fzn_subgraph_int_reif.mzn /usr/share/minizinc/std/fzn_sum_pred.mzn /usr/share/minizinc/std/fzn_sum_pred_reif.mzn /usr/share/minizinc/std/fzn_sum_set.mzn /usr/share/minizinc/std/fzn_sum_set_reif.mzn /usr/share/minizinc/std/fzn_symmetric_all_different.mzn /usr/share/minizinc/std/fzn_symmetric_all_different_reif.mzn /usr/share/minizinc/std/fzn_table_bool.mzn /usr/share/minizinc/std/fzn_table_bool_reif.mzn /usr/share/minizinc/std/fzn_table_int.mzn /usr/share/minizinc/std/fzn_table_int_opt.mzn /usr/share/minizinc/std/fzn_table_int_reif.mzn /usr/share/minizinc/std/fzn_tree_enum.mzn /usr/share/minizinc/std/fzn_tree_enum_reif.mzn /usr/share/minizinc/std/fzn_tree_int.mzn /usr/share/minizinc/std/fzn_tree_int_reif.mzn /usr/share/minizinc/std/fzn_value_precede_chain_int.mzn /usr/share/minizinc/std/fzn_value_precede_chain_int_opt.mzn /usr/share/minizinc/std/fzn_value_precede_chain_int_reif.mzn /usr/share/minizinc/std/fzn_value_precede_chain_set.mzn /usr/share/minizinc/std/fzn_value_precede_chain_set_reif.mzn /usr/share/minizinc/std/fzn_value_precede_int.mzn /usr/share/minizinc/std/fzn_value_precede_int_opt.mzn /usr/share/minizinc/std/fzn_value_precede_int_reif.mzn /usr/share/minizinc/std/fzn_value_precede_set.mzn /usr/share/minizinc/std/fzn_value_precede_set_reif.mzn /usr/share/minizinc/std/fzn_var_perm_sym.mzn /usr/share/minizinc/std/fzn_var_sqr_sym.mzn /usr/share/minizinc/std/fzn_write.mzn /usr/share/minizinc/std/fzn_write_reif.mzn /usr/share/minizinc/std/fzn_writes.mzn /usr/share/minizinc/std/fzn_writes_reif.mzn /usr/share/minizinc/std/fzn_writes_seq.mzn /usr/share/minizinc/std/fzn_writes_seq_reif.mzn /usr/share/minizinc/std/fzn_wst.mzn /usr/share/minizinc/std/fzn_wst_reif.mzn /usr/share/minizinc/std/geost.mzn /usr/share/minizinc/std/global_cardinality.mzn /usr/share/minizinc/std/global_cardinality_closed.mzn /usr/share/minizinc/std/global_cardinality_closed_fn.mzn /usr/share/minizinc/std/global_cardinality_fn.mzn /usr/share/minizinc/std/global_cardinality_low_up.deprecated.mzn /usr/share/minizinc/std/global_cardinality_low_up.mzn /usr/share/minizinc/std/global_cardinality_low_up_closed.deprecated.mzn /usr/share/minizinc/std/global_cardinality_low_up_closed.mzn /usr/share/minizinc/std/globals.mzn /usr/share/minizinc/std/ide /usr/share/minizinc/std/ide/vis.mzn /usr/share/minizinc/std/ide/vis_bar.html /usr/share/minizinc/std/ide/vis_gantt.html /usr/share/minizinc/std/ide/vis_geost.html /usr/share/minizinc/std/ide/vis_network.html /usr/share/minizinc/std/ide/vis_scatter.html /usr/share/minizinc/std/increasing.mzn /usr/share/minizinc/std/increasing_bool.mzn /usr/share/minizinc/std/increasing_bool.mzn.deprecated.mzn /usr/share/minizinc/std/increasing_float.mzn /usr/share/minizinc/std/increasing_float.mzn.deprecated.mzn /usr/share/minizinc/std/increasing_int.mzn /usr/share/minizinc/std/increasing_int.mzn.deprecated.mzn /usr/share/minizinc/std/increasing_set.mzn /usr/share/minizinc/std/increasing_set.mzn.deprecated.mzn /usr/share/minizinc/std/int_set_channel.mzn /usr/share/minizinc/std/inverse.mzn /usr/share/minizinc/std/inverse_fn.mzn /usr/share/minizinc/std/inverse_in_range.mzn /usr/share/minizinc/std/inverse_set.mzn /usr/share/minizinc/std/knapsack.mzn /usr/share/minizinc/std/lex2.mzn /usr/share/minizinc/std/lex2_strict.mzn /usr/share/minizinc/std/lex_chain_greater.mzn /usr/share/minizinc/std/lex_chain_greatereq.mzn /usr/share/minizinc/std/lex_chain_greatereq_orbitope.mzn /usr/share/minizinc/std/lex_chain_less.mzn /usr/share/minizinc/std/lex_chain_less_bool.mzn /usr/share/minizinc/std/lex_chain_less_bool.mzn.deprecated.mzn /usr/share/minizinc/std/lex_chain_less_int.mzn /usr/share/minizinc/std/lex_chain_less_int.mzn.deprecated.mzn /usr/share/minizinc/std/lex_chain_lesseq.mzn /usr/share/minizinc/std/lex_chain_lesseq_bool.mzn /usr/share/minizinc/std/lex_chain_lesseq_bool.mzn.deprecated.mzn /usr/share/minizinc/std/lex_chain_lesseq_int.mzn /usr/share/minizinc/std/lex_chain_lesseq_int.mzn.deprecated.mzn /usr/share/minizinc/std/lex_chain_lesseq_orbitope.mzn /usr/share/minizinc/std/lex_greater.mzn /usr/share/minizinc/std/lex_greatereq.mzn /usr/share/minizinc/std/lex_less.mzn /usr/share/minizinc/std/lex_less_bool.mzn /usr/share/minizinc/std/lex_less_bool.mzn.deprecated.mzn /usr/share/minizinc/std/lex_less_float.mzn /usr/share/minizinc/std/lex_less_float.mzn.deprecated.mzn /usr/share/minizinc/std/lex_less_int.mzn /usr/share/minizinc/std/lex_less_int.mzn.deprecated.mzn /usr/share/minizinc/std/lex_less_set.mzn /usr/share/minizinc/std/lex_less_set.mzn.deprecated.mzn /usr/share/minizinc/std/lex_lesseq.mzn /usr/share/minizinc/std/lex_lesseq_bool.mzn /usr/share/minizinc/std/lex_lesseq_bool.mzn.deprecated.mzn /usr/share/minizinc/std/lex_lesseq_float.mzn /usr/share/minizinc/std/lex_lesseq_float.mzn.deprecated.mzn /usr/share/minizinc/std/lex_lesseq_int.mzn /usr/share/minizinc/std/lex_lesseq_int.mzn.deprecated.mzn /usr/share/minizinc/std/lex_lesseq_set.mzn /usr/share/minizinc/std/lex_lesseq_set.mzn.deprecated.mzn /usr/share/minizinc/std/link_set_to_booleans.mzn /usr/share/minizinc/std/maximum.mzn /usr/share/minizinc/std/mdd.mzn /usr/share/minizinc/std/mdd_nondet.mzn /usr/share/minizinc/std/member.mzn /usr/share/minizinc/std/member_bool.mzn /usr/share/minizinc/std/member_bool.mzn.deprecated.mzn /usr/share/minizinc/std/member_float.mzn /usr/share/minizinc/std/member_float.mzn.deprecated.mzn /usr/share/minizinc/std/member_int.mzn /usr/share/minizinc/std/member_int.mzn.deprecated.mzn /usr/share/minizinc/std/member_set.mzn /usr/share/minizinc/std/member_set.mzn.deprecated.mzn /usr/share/minizinc/std/minimum.mzn /usr/share/minizinc/std/network_flow.mzn /usr/share/minizinc/std/neural_net.mzn /usr/share/minizinc/std/nosets.mzn /usr/share/minizinc/std/nvalue.mzn /usr/share/minizinc/std/nvalue_fn.mzn /usr/share/minizinc/std/output /usr/share/minizinc/std/output.mzn /usr/share/minizinc/std/output/array2d_bool.mzn /usr/share/minizinc/std/output/gantt.mzn /usr/share/minizinc/std/partition_set.mzn /usr/share/minizinc/std/path.mzn /usr/share/minizinc/std/piecewise_linear.mzn /usr/share/minizinc/std/piecewise_linear_non_continuous.mzn /usr/share/minizinc/std/range.mzn /usr/share/minizinc/std/range_fn.mzn /usr/share/minizinc/std/reachable.mzn /usr/share/minizinc/std/redefinitions-2.0.2.mzn /usr/share/minizinc/std/redefinitions-2.0.mzn /usr/share/minizinc/std/redefinitions-2.1.1.mzn /usr/share/minizinc/std/redefinitions-2.1.mzn /usr/share/minizinc/std/redefinitions-2.2.1.mzn /usr/share/minizinc/std/redefinitions-2.3.3.mzn /usr/share/minizinc/std/redefinitions-2.5.2.mzn /usr/share/minizinc/std/redefinitions-2.7.1.mzn /usr/share/minizinc/std/redefinitions.mzn /usr/share/minizinc/std/regular.mzn /usr/share/minizinc/std/regular_nfa.mzn /usr/share/minizinc/std/regular_regexp.mzn /usr/share/minizinc/std/regular_set.mzn /usr/share/minizinc/std/roots.mzn /usr/share/minizinc/std/roots_fn.mzn /usr/share/minizinc/std/seq_precede_chain.mzn /usr/share/minizinc/std/set_member.mzn /usr/share/minizinc/std/sliding_sum.mzn /usr/share/minizinc/std/solver_redefinitions.mzn /usr/share/minizinc/std/sort.mzn /usr/share/minizinc/std/sort_fn.mzn /usr/share/minizinc/std/span.mzn /usr/share/minizinc/std/stdlib /usr/share/minizinc/std/stdlib.mzn /usr/share/minizinc/std/stdlib/stdlib_ann.mzn /usr/share/minizinc/std/stdlib/stdlib_array.mzn /usr/share/minizinc/std/stdlib/stdlib_coercion.mzn /usr/share/minizinc/std/stdlib/stdlib_compare.mzn /usr/share/minizinc/std/stdlib/stdlib_debug.mzn /usr/share/minizinc/std/stdlib/stdlib_enum.mzn /usr/share/minizinc/std/stdlib/stdlib_internal.mzn /usr/share/minizinc/std/stdlib/stdlib_ite.mzn /usr/share/minizinc/std/stdlib/stdlib_language.mzn /usr/share/minizinc/std/stdlib/stdlib_logic.mzn /usr/share/minizinc/std/stdlib/stdlib_math.mzn /usr/share/minizinc/std/stdlib/stdlib_opt.mzn /usr/share/minizinc/std/stdlib/stdlib_random.mzn /usr/share/minizinc/std/stdlib/stdlib_reflect.mzn /usr/share/minizinc/std/stdlib/stdlib_set.mzn /usr/share/minizinc/std/stdlib/stdlib_sort.mzn /usr/share/minizinc/std/stdlib/stdlib_string.mzn /usr/share/minizinc/std/steiner.mzn /usr/share/minizinc/std/strict_lex2.mzn /usr/share/minizinc/std/strictly_decreasing.mzn /usr/share/minizinc/std/strictly_increasing.mzn /usr/share/minizinc/std/subcircuit.mzn /usr/share/minizinc/std/subgraph.mzn /usr/share/minizinc/std/sum_pred.mzn /usr/share/minizinc/std/sum_set.mzn /usr/share/minizinc/std/symmetric_all_different.mzn /usr/share/minizinc/std/table.mzn /usr/share/minizinc/std/table_bool.mzn /usr/share/minizinc/std/table_bool.mzn.deprecated.mzn /usr/share/minizinc/std/table_int.mzn /usr/share/minizinc/std/table_int.mzn.deprecated.mzn /usr/share/minizinc/std/tree.mzn /usr/share/minizinc/std/value_precede.mzn /usr/share/minizinc/std/value_precede_chain.mzn /usr/share/minizinc/std/value_precede_chain_int.mzn /usr/share/minizinc/std/value_precede_chain_int.mzn.deprecated.mzn /usr/share/minizinc/std/value_precede_chain_set.mzn /usr/share/minizinc/std/value_precede_chain_set.mzn.deprecated.mzn /usr/share/minizinc/std/value_precede_int.mzn /usr/share/minizinc/std/value_precede_int.mzn.deprecated.mzn /usr/share/minizinc/std/value_precede_set.mzn /usr/share/minizinc/std/value_precede_set.mzn.deprecated.mzn /usr/share/minizinc/std/var_perm_sym.mzn /usr/share/minizinc/std/var_sqr_sym.mzn /usr/share/minizinc/std/weighted_spanning_tree.mzn /usr/share/minizinc/std/write.mzn /usr/share/minizinc/std/writes.mzn /usr/share/minizinc/std/writes_seq.mzn
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Sep 30 22:45:42 2025