PB'11 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=89-P1=127-P2=191-P3=17-P4=97-P5=227-P6=191-P7=41-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=89-P1=127-P2=191-P3=17-P4=97-P5=227-P6=191-P7=41-B.opb
MD5SUM3f50fdda997abfe5e5c5cddf7b7c1313
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 benchmark2.66659
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
borg pb-opt-11.04.03 (complete)3481241OPT3 0.640902 0.740046
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452044OPT3 2.66659 2.66698
SCIP spx 2 2011-06-10 (fixed) (complete)3484862OPT3 2.71659 2.71781
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450384OPT3 5.63514 5.63649
SCIP spx E_2 2011-06-10 (fixed) (complete)3488304OPT3 5.74313 5.74244
clasp 2.0-R4191-patched (fixed) (complete)3491617OPT3 44.1053 44.104
clasp 2.0-R4191 [DEPRECATED] (complete)3469126OPT3 44.1553 44.1539
Sat4j Resolution 2.3.0 (complete)3458088OPT3 58.4711 57.2568
Sat4j Res//CP 2.3.0 (complete)3453704OPT3 122.773 64.4457
bsolo 3.2 (complete)3462492OPT3 393.683 393.679
Sat4j CuttingPlanes 2.3.0 (complete)3455896SAT (TO)9 1800.26 1794.4
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465812? (TO)3 1800.06 1800.02
MinisatID 2.4.8 [DEPRECATED] (complete)3464152? (TO)3 1800.09 1800.02
MinisatID 2.5.2-gmp (fixed) (complete)3496125? (exit code) 0.000999 0.00603499
MinisatID 2.5.2 (fixed) (complete)3490025? (exit code) 0.000999 0.0057569

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