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

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

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/wcsp/jnh/
normalized-jnh07_wcsp.wbo
MD5SUM124b6775b7bb4e390bc62510a681a702
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 constraints950
Number of soft constraints850
Number of constraints which are clauses850
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 constraint10
Top cost 420926
Min constraint cost 1
Max constraint cost 1000
Sum of constraints costs 420925
Biggest number in a constraint 9
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 19
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)3728347OPTIMUM 0.004998 0.010623
wbo 1.71 (complete)3713081OPTIMUM 0.004998 0.0101801
pwbo 2.01 (complete)3712672OPTIMUM 0.005998 0.0149549
pwbo 2.02 (complete)3728756OPTIMUM 0.005998 0.0128279
clasp 2.0.6-R5325 (complete)3711570OPTIMUM 0.005998 0.00620097
toysat 2012-05-17 (complete)3712217OPTIMUM 0.117981 0.118854
Sat4j PB 2012-05-28 (complete)3718295OPTIMUM 0.484925 0.298224
SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed (complete)3717648OPTIMUM 3.39048 3.39244
npSolver inc (complete)3714421OPTIMUM 4.09038 4.09521
npSolver 1.0 (complete)3713728OPTIMUM 4.13137 4.1308
wbo2satCp2 2012-05-19 (complete)3717193OPTIMUM 4.66729 4.74765
wbo2sat 2012-05-19 (complete)3716500OPTIMUM 4.69629 4.76047
npSolver 1.0 (fixed) (complete)3755188OPTIMUM 5.71813 5.72172
npSolver inc (fixed) (complete)3754495OPTIMUM 5.78112 5.94841
npSolver inc-topDown (fixed) (complete)3753802OPTIMUM 408.66 410.506
npSolver inc-topDown (complete)3715114OPTIMUM 546.544 546.844
npSolver inc-topdown-quickBound (complete)3715807? (TO) 1800.28 1842.12
npSolver inc-topdown-quickBound (fixed) (complete)3753109? (TO) 1800.28 1805.02

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