Name | normalized-PB06/OPT-MEDINT/mps-v2-20-10/MIPLIB/ miplib/normalized-mps-v2-20-10-enigma.opb |
MD5SUM | 40c4ca45f28cf4c12979bc2b22100ada |
Bench Category | OPT-MEDINT (optimisation, medium integers) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 0 |
Best CPU time to get the best result obtained on this benchmark | 0.826873 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 0 |
Optimality of the best value was proved | YES |
Number of variables | 100 |
Total number of constraints | 21 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 20 |
Number of constraints which are nor clauses,nor cardinality constraints | 1 |
Minimum length of a constraint | 9 |
Maximum length of a constraint | 90 |
Number of terms in the objective function | 9 |
Biggest coefficient in the objective function | 9 |
Number of bits for the biggest coefficient in the objective function | 4 |
Sum of the numbers in the objective function | 45 |
Number of bits of the sum of numbers in the objective function | 6 |
Biggest number in a constraint | 900207 |
Number of bits of the biggest number in a constraint | 20 |
Biggest sum of numbers in a constraint | 9508275 |
Number of bits of the biggest sum of numbers | 24 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Sat4j Resolution 2.3.0 (complete) | 3459409 | OPT | 0 | 0.826873 | 0.59824 |
MinisatID 2.5.2-gmp (fixed) (complete) | 3497446 | OPT | 0 | 1.82872 | 1.82882 |
MinisatID 2.4.8-gmp [DEPRECATED] (complete) | 3467133 | OPT | 0 | 2.05769 | 2.05729 |
Sat4j Res//CP 2.3.0 (complete) | 3455025 | OPT | 0 | 2.46762 | 1.16568 |
Sat4j CuttingPlanes 2.3.0 (complete) | 3457217 | OPT | 0 | 214.525 | 212.613 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 0x1 -x2 -x3 -x4 -x5 -x6 -x7 -x8 -x9 -x10 -x11 -x12 -x13 -x14 -x15 -x16 -x17 -x18 x19 -x20 -x21 -x22 -x23 -x24 -x25 x26 -x27 -x28 -x29 -x30 -x31 -x32 -x33 -x34 -x35 -x36 x37 -x38 -x39 -x40 -x41 -x42 -x43 -x44 x45 -x46 -x47 -x48 -x49 -x50 -x51 -x52 -x53 -x54 -x55 -x56 -x57 -x58 -x59 x60 -x61 -x62 x63 -x64 -x65 -x66 -x67 -x68 -x69 -x70 -x71 -x72 -x73 -x74 -x75 -x76 -x77 x78 -x79 -x80 -x81 x82 -x83 -x84 -x85 -x86 -x87 -x88 -x89 -x90 -x91 -x92 -x93 x94 -x95 -x96 -x97 -x98 -x99 -x100