Name | normalized-PB07/OPT-SMALLINT-LIN/submittedPB07/ aksoy/decomp/normalized-matrix_5x3_9.opb |
MD5SUM | d90f6236f870e45ceb3cd4a6e4593f30 |
Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 24 |
Best CPU time to get the best result obtained on this benchmark | 1800.45 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 24 |
Optimality of the best value was proved | NO |
Number of variables | 14352 |
Total number of constraints | 53247 |
Number of constraints which are clauses | 53237 |
Number of constraints which are cardinality constraints (but not clauses) | 1 |
Number of constraints which are nor clauses,nor cardinality constraints | 9 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 1036 |
Number of terms in the objective function | 1036 |
Biggest coefficient in the objective function | 1 |
Number of bits for the biggest coefficient in the objective function | 1 |
Sum of the numbers in the objective function | 1036 |
Number of bits of the sum of numbers in the objective function | 11 |
Biggest number in a constraint | 32 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 1068 |
Number of bits of the biggest sum of numbers | 11 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 24--too large--