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

Result page for benchmark
/PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/tsp/
normalized-t3002.11tsp11.1900553647--soft-33-100-0.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/tsp/
normalized-t3002.11tsp11.1900553647--soft-33-100-0.wbo
MD5SUM207bc6a3a4e34084510bb36853631f6d
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 benchmark42.5545
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables231
Total number of constraints2707
Number of soft constraints1830
Number of constraints which are clauses2684
Number of constraints which are cardinality constraints (but not clauses)22
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint110
Top cost 92327
Min constraint cost 1
Max constraint cost 100
Sum of constraints costs 92326
Biggest number in a constraint 25
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 715
Number of bits of the biggest sum of numbers10
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
Sat4j PB 2.3.6 Resolution PB16 (complete)4109756OPTIMUM 21.4597 19.8003
NaPS 1.02 (complete)4109759OPTIMUM 42.5545 42.5622
Sat4j PB 2.3.6 Res+CP PB16 (complete)4109757OPTIMUM 43.9973 40.6025
toysat 2016-05-02 (complete)4109758OPTIMUM 50.9533 50.9619

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 -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 -x201 -x202 x203 -x204 -x205
-x206 -x207 -x208 -x209 -x210 -x211 -x212 -x213 -x214 -x215 x216 -x217 -x218 -x219 -x220 -x221 -x222 -x223 -x224 -x225 -x226 -x227 x228
-x229 -x230 -x231