normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/

factor-mod-B/factor-mod-size=8-P0=71-P1=107-P2=197-P3=67-B.opb

Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=8-P0=71-P1=107-P2=197-P3=67-B.opb |

MD5SUM | ece282cf8dbd0acc24f1883b841333ea |

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.3378 |

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 | 72 |

Total number of constraints | 7 |

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 | 7 |

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) | 192 |

Sum of products size (including duplicates) | 384 |

Number of different products | 192 |

Sum of products size | 384 |

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) | 1870194 | OPT | 3 | 1.3378 | 1.33813 |

SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1870195 | OPT | 3 | 2.55061 | 2.55209 |

pbclasp 2009-04-24 (complete) | 1859285 | OPT | 3 | 12.0582 | 12.0604 |

bsolo 3.1 (complete) | 1876686 | OPT | 3 | 17.1054 | 17.1104 |

wbo 1.0 (complete) | 1875256 | OPT | 3 | 24.4903 | 24.5012 |

SAT4J Pseudo Resolution 2.1.1 (complete) | 1857597 | OPT | 3 | 107.476 | 106.245 |

bsolo 3.1 cl (complete) | 1878116 | OPT | 3 | 142.14 | 142.202 |

bsolo 3.1 pb (complete) | 1879546 | OPT | 3 | 1222.77 | 1223.11 |

SAT4J Pseudo CP 2.1.1 (complete) | 1857596 | SAT (TO) | 3 | 1800.3 | 1770.45 |

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

obj: 3Solution found:

-x72 -x71 -x70 -x69 -x68 -x67 x66 x65 -x64 -x63 -x62 -x61 x60 -x59 -x58 -x57 -x48 -x47 -x46 x45 -x44 -x43 x42 x41 -x56 -x55 -x54 -x53 -x52 -x51 x50 -x49 -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