Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=8-P0=149-P1=79-P2=59-P3=73-P4=211-B.opb |
MD5SUM | 74c00e33b4232d137ad873ae982593f6 |
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 | 5.18821 |
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 | 96 |
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 | 8 |
Maximum length of a constraint | 80 |
Number of terms in the objective function | 8 |
Biggest coefficient in the objective function | 128 |
Number of bits for the biggest coefficient in the objective function | 8 |
Sum of the numbers in the objective function | 255 |
Number of bits of the sum of numbers in the objective function | 8 |
Biggest number in a constraint | 32768 |
Number of bits of the biggest number in a constraint | 16 |
Biggest sum of numbers in a constraint | 130560 |
Number of bits of the biggest sum of numbers | 17 |
Number of products (including duplicates) | 256 |
Sum of products size (including duplicates) | 512 |
Number of different products | 256 |
Sum of products size | 512 |
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) | 1870110 | OPT | 3 | 5.18821 | 5.19003 |
SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1870111 | OPT | 3 | 13.104 | 13.1075 |
pbclasp 2009-04-24 (complete) | 1859243 | OPT | 3 | 45.898 | 45.9095 |
wbo 1.0 (complete) | 1875214 | OPT | 3 | 50.1554 | 50.1789 |
SAT4J Pseudo Resolution 2.1.1 (complete) | 1857513 | OPT | 3 | 149.565 | 148.467 |
bsolo 3.1 cl (complete) | 1878074 | OPT | 3 | 264.022 | 264.125 |
bsolo 3.1 pb (complete) | 1879504 | SAT | 3 | 1798.01 | 1798.53 |
SAT4J Pseudo CP 2.1.1 (complete) | 1857512 | SAT (TO) | 59 | 1800.28 | 1771.37 |
bsolo 3.1 (complete) | 1876644 | Wrong Opt. | 41 | 7.69383 | 7.79767 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3-x96 -x95 -x94 -x93 -x92 -x91 x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x64 -x63 x62 x61 x60 -x59 -x58 x57 x80 -x79 -x78 -x77 -x76 -x75 -x74 x73 -x56 -x55 -x54 x53 -x52 -x51 x50 x49 -x72 -x71 -x70 -x69 -x68 -x67 -x66 x65 x48 -x47 x46 -x45 x44 x43 -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