PB'10 competition: satisfaction and optimization track: solvers results per benchmarks

Result page for benchmark
normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=8-P0=233-P1=223-P2=251-P3=181-P4=197-P5=127-P6=89-P7=149-B.opb

Jump to solvers results

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=8-P0=233-P1=223-P2=251-P3=181-P4=197-P5=127-P6=89-P7=149-B.opb
MD5SUM8a882d07e0fbb307eb9e9c234ecc464c
Bench CategoryOPT-SMALLINT-NLC (optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark3
Best CPU time to get the best result obtained on this benchmark5.05523
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 3
Optimality of the best value was proved YES
Number of variables168
Total number of constraints15
Number of constraints which are clauses0
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints15
Minimum length of a constraint8
Maximum length of a constraint80
Number of terms in the objective function 8
Biggest coefficient in the objective function 128
Number of bits for the biggest coefficient in the objective function 8
Sum of the numbers in the objective function 255
Number of bits of the sum of numbers in the objective function 8
Biggest number in a constraint 32768
Number of bits of the biggest number in a constraint 16
Biggest sum of numbers in a constraint 130560
Number of bits of the biggest sum of numbers17
Number of products (including duplicates)448
Sum of products size (including duplicates)896
Number of different products448
Sum of products size896

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver (complete)2703066OPT3 5.05523 5.05648
SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver (complete)2666497OPT3 5.38818 5.39001
SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver (complete)2665067OPT3 125.798 125.848
SAT4J PB Resolution 2.2.0 2010-05-26 (complete)2658396OPT3 177.922 175.687
wbo 1.4b (fixed) (complete)2702151OPT3 303.639 303.721
wbo 1.4b (complete)2702150OPT3 337.806 337.909
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete)2661755OPT3 367.924 196.649
SCIPnone SCIP 1.2.1.2 without any LP solver (complete)2663637OPT3 420.289 420.412
bsolo 3.2 Cl (complete)2670588OPT3 957.255 957.536
bsolo 3.2 Card (complete)2670587OPT3 1471.58 1472.05
PB/CT 0.1 (complete)2667927SAT (TO)3 1800.03 1800.51
PB/CT 0.1 fixed (complete)2681521SAT (TO)3 1800.03 1800.51
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete)2670051SAT (TO)119 1800.23 1775.61
PBPASSolver 2010-06-13 (complete)2673343? (TO) 1800.06 1800.62
pb_cplex 2010-06-29 (complete)2696976? (TO) 1800.14 1039.82

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function: 3
Solution found:
-x168 -x167 -x166 x165 x164 -x163 x162 -x161 -x160 -x159 x158 -x157 -x156 -x155 -x154 x153 x112 x111 -x110 -x109 -x108 x107 -x106 x105 -x152
x151 x150 -x149 -x148 x147 -x146 x145 -x104 x103 -x102 -x101 -x100 -x99 -x98 x97 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 x96 -x95 x94
-x93 -x92 -x91 -x90 x89 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 x88 -x87 -x86 -x85 x84 -x83 x82 x81 -x128 -x127 -x126 -x125 -x124
-x123 x122 -x121 -x80 -x79 -x78 -x77 -x76 -x75 -x74 x73 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x72 -x71 -x70 -x69 x68 -x67 -x66
x65 -x64 -x63 x62 -x61 -x60 -x59 x58 x57 x56 -x55 -x54 -x53 -x52 x51 -x50 x49 x48 -x47 x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36
-x35 x34 x33 x32 -x31 -x30 -x29 x28 -x27 x26 x25 -x24 -x23 x22 x21 x20 -x19 -x18 x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 x9 -x8 -x7 -x6 -x5
-x4 -x3 x2 x1