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

Result page for benchmark
/PARTIAL-SMALLINT-LIN/wcsp/coloring/
normalized-geom30a-6_wcsp.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/wcsp/coloring/
normalized-geom30a-6_wcsp.wbo
MD5SUMf90a27dc84ea26cc1e1bd524595c9b49
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.002998
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables180
Total number of constraints516
Number of soft constraints486
Number of constraints which are clauses486
Number of constraints which are cardinality constraints (but not clauses)30
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint6
Top cost 82
Min constraint cost 1
Max constraint cost 1
Sum of constraints costs 486
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 7
Number of bits of the biggest sum of numbers3
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)3728302OPTIMUM 0.002998 0.00616395
pwbo 2.01 (complete)3712627OPTIMUM 0.002998 0.00617202
wbo 1.71 (complete)3713036OPTIMUM 0.002998 0.00649695
pwbo 2.02 (complete)3728711OPTIMUM 0.002998 0.00664896
clasp 2.0.6-R5325 (complete)3711525OPTIMUM 0.003999 0.00645606
wbo2sat 2012-05-19 (complete)3716455OPTIMUM 0.019996 0.0222481
wbo2satCp2 2012-05-19 (complete)3717148OPTIMUM 0.019996 0.0222439
npSolver inc (fixed) (complete)3754450OPTIMUM 0.039993 0.041687
toysat 2012-05-17 (complete)3712172OPTIMUM 0.041992 0.0440819
npSolver inc-topdown-quickBound (fixed) (complete)3753064OPTIMUM 0.042992 0.045877
npSolver inc-topDown (fixed) (complete)3753757OPTIMUM 0.042993 0.0439329
npSolver inc-topDown (complete)3715069OPTIMUM 0.044992 0.0458471
npSolver 1.0 (fixed) (complete)3755143OPTIMUM 0.044993 0.0452501
npSolver 1.0 (complete)3713683OPTIMUM 0.046991 0.0491961
npSolver inc-topdown-quickBound (complete)3715762OPTIMUM 0.046992 0.0494321
npSolver inc (complete)3714376OPTIMUM 0.047992 0.048202
Sat4j PB 2012-05-28 (complete)3718250OPTIMUM 0.253961 0.20773
SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed (complete)3717603OPTIMUM 0.405938 0.407067

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