Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/ manquinho/bsg/normalized-bsg_1000_60_3.opb |
MD5SUM | e05fbfdce4433b0b2590ec382b530cec |
Bench Category | OPT-SMALLINT-NLC (optimisation, small integers, non linear constraints) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | -67 |
Best CPU time to get the best result obtained on this benchmark | 1798.14 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | -71 |
Optimality of the best value was proved | NO |
Number of variables | 2000 |
Total number of constraints | 3001 |
Number of constraints which are clauses | 1000 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 2001 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 2000 |
Number of terms in the objective function | 1000 |
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 | 1000 |
Number of bits of the sum of numbers in the objective function | 10 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 2000 |
Number of bits of the biggest sum of numbers | 11 |
Number of products (including duplicates) | 150588 |
Sum of products size (including duplicates) | 301176 |
Number of different products | 75294 |
Sum of products size | 150588 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: -67--too large--