Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/ manquinho/bsg/normalized-bsg_100_10_5.opb |
MD5SUM | ae2bd1e13f1871c16ad2ebb51fc6f92a |
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 | -29 |
Best CPU time to get the best result obtained on this benchmark | 1800.05 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | -29 |
Optimality of the best value was proved | NO |
Number of variables | 200 |
Total number of constraints | 301 |
Number of constraints which are clauses | 100 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 201 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 200 |
Number of terms in the objective function | 100 |
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 | 100 |
Number of bits of the sum of numbers in the objective function | 7 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 200 |
Number of bits of the biggest sum of numbers | 8 |
Number of products (including duplicates) | 2504 |
Sum of products size (including duplicates) | 5008 |
Number of different products | 1252 |
Sum of products size | 2504 |