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

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

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/wcsp/coloring/
normalized-geom30a-5_wcsp.wbo
MD5SUMd1c3accd983cc55f3458e6ff2209f659
Bench CategoryPARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints)
Best result obtained on this benchmarkMOPT
Best cost obtained on this benchmark1
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 variables150
Total number of constraints435
Number of soft constraints405
Number of constraints which are clauses405
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 constraint5
Top cost 82
Min constraint cost 1
Max constraint cost 1
Sum of constraints costs 405
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 6
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
pwbo 2.01 (complete)3712626OPTIMUM 0.002998 0.0083019
wbo 1.71 (complete)3713035OPTIMUM 0.002998 0.00851597
pwbo 2.02 (complete)3728710OPTIMUM 0.002998 0.00823997
wbo 1.72 (complete)3728301OPTIMUM 0.002998 0.00790597
clasp 2.0.6-R5325 (complete)3711524OPTIMUM 0.004998 0.00693496
wbo2satCp2 2012-05-19 (complete)3717147OPTIMUM 0.028994 0.033311
wbo2sat 2012-05-19 (complete)3716454OPTIMUM 0.029995 0.0330249
toysat 2012-05-17 (complete)3712171OPTIMUM 0.038993 0.0405319
npSolver inc-topdown-quickBound (complete)3715761OPTIMUM 0.048991 0.052158
npSolver 1.0 (complete)3713682OPTIMUM 0.048992 0.0487909
npSolver inc (complete)3714375OPTIMUM 0.049991 0.051224
npSolver inc (fixed) (complete)3754449OPTIMUM 0.05299 0.053358
npSolver inc-topDown (complete)3715068OPTIMUM 0.052991 0.0503729
npSolver inc-topdown-quickBound (fixed) (complete)3753063OPTIMUM 0.055991 0.056496
npSolver 1.0 (fixed) (complete)3755142OPTIMUM 0.05699 0.0556479
npSolver inc-topDown (fixed) (complete)3753756OPTIMUM 0.05699 0.0562659
SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed (complete)3717602OPTIMUM 0.487925 0.490115
Sat4j PB 2012-05-28 (complete)3718249OPTIMUM 0.553915 0.306501

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: 1
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