Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=6-P0=59-P1=29-B.opb |
MD5SUM | 2136726fbb803f220f38b254700007d3 |
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 | 0.008997 |
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 | 18 |
Total number of constraints | 3 |
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 | 3 |
Minimum length of a constraint | 6 |
Maximum length of a constraint | 42 |
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 | 8048 |
Number of bits of the biggest sum of numbers | 13 |
Number of products (including duplicates) | 36 |
Sum of products size (including duplicates) | 72 |
Number of different products | 36 |
Sum of products size | 72 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4114300 | OPT | 3 | 0.008997 | 0.00879508 |
toysat 2016-05-02 (complete) | 4106409 | OPT | 3 | 0.079987 | 0.083133 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4106411 | OPT | 3 | 0.173972 | 0.14054 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4106410 | OPT | 3 | 0.19297 | 1.14132 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 3x1 x2 -x3 -x4 -x5 -x6 x7 -x8 x9 -x10 -x11 x12 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 x13 -x14 -x15 -x16 -x17 -x18