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

Result page for benchmark
/PARTIAL-SMALLINT-LIN/wcsp/dimacs/
normalized-dubois26_ext.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/wcsp/dimacs/
normalized-dubois26_ext.wbo
MD5SUMe578c08d6801e291bb18ac58eed1eac5
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.001998
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables156
Total number of constraints286
Number of soft constraints208
Number of constraints which are clauses208
Number of constraints which are cardinality constraints (but not clauses)78
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint3
Top cost 209
Min constraint cost 1
Max constraint cost 1
Sum of constraints costs 208
Biggest number in a constraint 2
Number of bits of the biggest number in a constraint 2
Biggest sum of numbers in a constraint 5
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.02 (complete)3728737OPTIMUM 0.001998 0.00748998
clasp 2.0.6-R5325 (complete)3711551OPTIMUM 0.003998 0.00655199
pwbo 2.01 (complete)3712653OPTIMUM 0.003998 0.00739411
wbo2sat 2012-05-19 (complete)3716481OPTIMUM 0.020996 0.023583
wbo2satCp2 2012-05-19 (complete)3717174OPTIMUM 0.020996 0.0211539
wbo 1.72 (complete)3728328OPTIMUM 0.021996 0.017452
wbo 1.71 (complete)3713062OPTIMUM 0.021996 0.018596
toysat 2012-05-17 (complete)3712198OPTIMUM 0.027994 0.028773
npSolver inc-topDown (complete)3715095OPTIMUM 0.053991 0.058719
npSolver inc-topdown-quickBound (complete)3715788OPTIMUM 0.05599 0.0541031
npSolver inc (complete)3714402OPTIMUM 0.057991 0.0545619
npSolver 1.0 (complete)3713709OPTIMUM 0.05899 0.0604091
npSolver 1.0 (fixed) (complete)3755169OPTIMUM 0.05999 0.0646929
SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed (complete)3717629OPTIMUM 0.065989 0.0665319
npSolver inc-topDown (fixed) (complete)3753783OPTIMUM 0.065989 0.0630881
npSolver inc (fixed) (complete)3754476OPTIMUM 0.068989 0.068262
npSolver inc-topdown-quickBound (fixed) (complete)3753090OPTIMUM 0.071988 0.072853
Sat4j PB 2012-05-28 (complete)3718276OPTIMUM 0.383941 0.24422

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 -x151 x152 -x153 x154 -x155 x156