| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=7-P0=73-P1=127-P2=41-P3=29-P4=59-B.opb |
| MD5SUM | 6aa9cb9410e02201be60dbd48f3c3ed7 |
| 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.90171 |
| 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 | 84 |
| Total number of constraints | 9 |
| 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 | 9 |
| Minimum length of a constraint | 7 |
| Maximum length of a constraint | 63 |
| Number of terms in the objective function | 7 |
| Biggest coefficient in the objective function | 64 |
| Number of bits for the biggest coefficient in the objective function | 7 |
| Sum of the numbers in the objective function | 127 |
| Number of bits of the sum of numbers in the objective function | 7 |
| Biggest number in a constraint | 8192 |
| Number of bits of the biggest number in a constraint | 14 |
| Biggest sum of numbers in a constraint | 32512 |
| Number of bits of the biggest sum of numbers | 15 |
| Number of products (including duplicates) | 196 |
| Sum of products size (including duplicates) | 392 |
| Number of different products | 196 |
| Sum of products size | 392 |
| Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
|---|---|---|---|---|---|
| SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) (complete) | 1869960 | OPT | 3 | 1.90171 | 1.90152 |
| wbo 1.0 (complete) | 1875139 | OPT | 3 | 5.40918 | 5.41162 |
| pbclasp 2009-04-24 (complete) | 1859168 | OPT | 3 | 7.33788 | 7.34243 |
| bsolo 3.1 (complete) | 1876569 | OPT | 3 | 8.89565 | 8.89879 |
| bsolo 3.1 cl (complete) | 1877999 | OPT | 3 | 13.5489 | 13.5671 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1869961 | OPT | 3 | 15.3567 | 15.3607 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857363 | OPT | 3 | 47.0968 | 46.1853 |
| bsolo 3.1 pb (complete) | 1879429 | OPT | 3 | 135.253 | 135.293 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857362 | SAT (TO) | 3 | 1800.33 | 1768.99 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3x84 -x83 x82 -x81 x80 x79 -x78 -x77 -x76 x75 -x74 x73 x72 x71 x56 x55 -x54 -x53 x52 -x51 x50 -x70 -x69 -x68 -x67 -x66 -x65 -x64 x49 -x48 x47 -x46 x45 x44 x43 -x63 -x62 -x61 -x60 -x59 -x58 x57 -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