| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=6-P0=47-P1=17-P2=37-P3=53-P4=13-P5=13-B.opb |
| MD5SUM | 4a54e07caaccf9019e5a54d4dcd3a55b |
| Bench Category | OPT-SMALLINT-NLC (optimisation, small integers, non linear constraints) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 3 |
| Best CPU time to get the best result obtained on this benchmark | 1.40079 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | 3 |
| Optimality of the best value was proved | YES |
| Number of variables | 90 |
| Total number of constraints | 11 |
| Number of constraints which are clauses | 0 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 11 |
| Minimum length of a constraint | 6 |
| Maximum length of a constraint | 48 |
| Number of terms in the objective function | 6 |
| Biggest coefficient in the objective function | 32 |
| Number of bits for the biggest coefficient in the objective function | 6 |
| Sum of the numbers in the objective function | 63 |
| Number of bits of the sum of numbers in the objective function | 6 |
| Biggest number in a constraint | 2048 |
| Number of bits of the biggest number in a constraint | 12 |
| Biggest sum of numbers in a constraint | 8064 |
| Number of bits of the biggest sum of numbers | 13 |
| Number of products (including duplicates) | 180 |
| Sum of products size (including duplicates) | 360 |
| Number of different products | 180 |
| Sum of products size | 360 |
| Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
|---|---|---|---|---|---|
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1869781 | OPT | 3 | 1.40079 | 1.4032 |
| pbclasp 2009-04-24 (complete) | 1859078 | OPT | 3 | 1.45778 | 1.46527 |
| SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) (complete) | 1869780 | OPT | 3 | 1.9957 | 2.00252 |
| bsolo 3.1 cl (complete) | 1877909 | OPT | 3 | 2.28865 | 2.28976 |
| bsolo 3.1 (complete) | 1876479 | OPT | 3 | 2.79157 | 2.79382 |
| wbo 1.0 (complete) | 1875049 | OPT | 3 | 4.10037 | 4.10157 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857183 | OPT | 3 | 5.04723 | 4.23324 |
| bsolo 3.1 pb (complete) | 1879339 | OPT | 3 | 41.6507 | 41.6646 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857182 | SAT (TO) | 3 | 1800.29 | 1770.59 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3-x90 -x89 -x88 -x87 -x86 -x85 x84 -x83 -x82 x81 x80 x79 -x60 -x59 -x58 x57 -x56 x55 x78 -x77 -x76 x75 x74 x73 x54 -x53 x52 -x51 -x50 x49 x72 -x71 -x70 x69 x68 -x67 x48 -x47 x46 -x45 x44 x43 -x66 -x65 -x64 -x63 -x62 -x61 x42 -x41 x40 x39 -x38 x37 -x36 -x35 -x34 -x33 x32 x31 x30 x29 x28 x27 -x26 x25 x24 x23 x22 -x21 x20 x19 x18 x17 -x16 x15 x14 x13 -x12 -x11 x10 x9 x8 x7 -x6 -x5 -x4 -x3 x2 x1