PB'12 competition: WBO track: solvers results per benchmarks

Result page for benchmark
/PARTIAL-SMALLINT-LIN/wcsp/jnh/
normalized-jnh220_wcsp.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/wcsp/jnh/
normalized-jnh220_wcsp.wbo
MD5SUM862c57b9a103de4e976a73e17aca1258
Bench CategoryPARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints)
Best result obtained on this benchmarkMOPT
Best cost obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.004998
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables200
Total number of constraints900
Number of soft constraints800
Number of constraints which are clauses800
Number of constraints which are cardinality constraints (but not clauses)100
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint11
Top cost 394239
Min constraint cost 1
Max constraint cost 1000
Sum of constraints costs 394238
Biggest number in a constraint 10
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 21
Number of bits of the biggest sum of numbers5
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
wbo 1.72 (complete)3728367OPTIMUM 0.004998 0.017896
clasp 2.0.6-R5325 (complete)3711590OPTIMUM 0.004998 0.0061639
wbo 1.71 (complete)3713101OPTIMUM 0.004998 0.0124109
pwbo 2.02 (complete)3728776OPTIMUM 0.004998 0.0139599
pwbo 2.01 (complete)3712692OPTIMUM 0.006998 0.015449
wbo2sat 2012-05-19 (complete)3716520OPTIMUM 0.028994 0.0320471
wbo2satCp2 2012-05-19 (complete)3717213OPTIMUM 0.029994 0.0334079
npSolver inc-topDown (fixed) (complete)3753822OPTIMUM 0.050991 0.0528349
npSolver 1.0 (fixed) (complete)3755208OPTIMUM 0.052991 0.0593221
npSolver inc-topDown (complete)3715134OPTIMUM 0.05499 0.059397
npSolver inc (fixed) (complete)3754515OPTIMUM 0.05499 0.0554151
npSolver inc (complete)3714441OPTIMUM 0.054991 0.0590231
npSolver 1.0 (complete)3713748OPTIMUM 0.055991 0.059424
npSolver inc-topdown-quickBound (fixed) (complete)3753129OPTIMUM 0.05699 0.0591149
npSolver inc-topdown-quickBound (complete)3715827OPTIMUM 0.080987 0.0568
Sat4j PB 2012-05-28 (complete)3718315OPTIMUM 0.572912 0.368135
toysat 2012-05-17 (complete)3712237OPTIMUM 0.692894 0.694167
SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed (complete)3717668OPTIMUM 7.1989 7.20146

Additionnal information

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

cost of falsified constraints: 0
Solution found:
-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 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 -x55 x56 x57 -x58 x59 -x60 -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 -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 -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 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 x161 -x162 x163 -x164 -x165 x166 -x167 x168 -x169 x170 x171
-x172 -x173 x174 -x175 x176 -x177 x178 x179 -x180 x181 -x182 x183 -x184 -x185 x186 x187 -x188 -x189 x190 -x191 x192 x193 -x194 -x195 x196
-x197 x198 x199 -x200