Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=5-P0=29-P1=17-P2=2-P3=19-P4=13-B.opb |
MD5SUM | ad91a3f1eebbb2431180c5d6e6033f2b |
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 | 2 |
Best CPU time to get the best result obtained on this benchmark | 0.021996 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 2 |
Optimality of the best value was proved | YES |
Number of variables | 60 |
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 | 5 |
Maximum length of a constraint | 35 |
Number of terms in the objective function | 5 |
Biggest coefficient in the objective function | 16 |
Number of bits for the biggest coefficient in the objective function | 5 |
Sum of the numbers in the objective function | 31 |
Number of bits of the sum of numbers in the objective function | 5 |
Biggest number in a constraint | 512 |
Number of bits of the biggest number in a constraint | 10 |
Biggest sum of numbers in a constraint | 1984 |
Number of bits of the biggest sum of numbers | 11 |
Number of products (including duplicates) | 100 |
Sum of products size (including duplicates) | 200 |
Number of different products | 100 |
Sum of products size | 200 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4114014 | OPT | 2 | 0.021996 | 0.022016 |
toysat 2016-05-02 (complete) | 4106466 | OPT | 2 | 0.056991 | 0.0570639 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4106468 | OPT | 2 | 0.504922 | 0.282519 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4106467 | OPT | 2 | 1.49377 | 1.17651 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 2-x1 x2 -x3 -x4 -x5 x6 x7 x8 -x9 x10 x11 -x12 -x13 x14 x15 x16 -x17 x18 x19 x20 x21 -x22 -x23 x24 x25 -x61 x62 -x63 -x64 -x65 -x66 x67 -x68 -x69 -x70 -x71 x72 -x73 -x74 -x75 -x76 -x77 -x78 -x79 -x80 -x81 x82 -x83 -x84 -x85 -x26 x27 x28 x29 -x30 x41 -x42 -x43 -x44 -x45 -x86 x87 x88 x89 -x90 -x91 -x92 -x93 -x94 -x95 -x96 -x97 -x98 -x99 -x100 -x101 x102 x103 x104 -x105 -x106 x107 x108 x109 -x110 -x31 x32 x33 x34 x35 -x46 x47 -x48 x49 -x50 -x111 x112 x113 x114 x115 -x116 -x117 -x118 -x119 -x120 -x121 x122 x123 x124 x125 -x126 x127 x128 x129 x130 -x131 x132 x133 x134 x135 -x36 x37 x38 -x39 -x40 x51 x52 -x53 x54 x55 -x136 x137 x138 -x139 -x140 -x141 -x142 -x143 -x144 -x145 -x146 -x147 -x148 -x149 -x150 -x151 x152 x153 -x154 -x155 -x156 x157 x158 -x159 -x160 -x56 -x57 x58 -x59 -x60