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=7-P0=59-P1=103-P2=101-P3=43-P4=37-P5=37-P6=17-P7=23-B.opb

Jump to solvers results

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=7-P0=59-P1=103-P2=101-P3=43-P4=37-P5=37-P6=17-P7=23-B.opb
MD5SUMa9881f8d96a669a457a765316e0eed8c
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 benchmark0.035994
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 variables147
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 constraint7
Maximum length of a constraint63
Number of terms in the objective function 7
Biggest coefficient in the objective function 64
Number of bits for the biggest coefficient in the objective function 7
Sum of the numbers in the objective function 127
Number of bits of the sum of numbers in the objective function 7
Biggest number in a constraint 8192
Number of bits of the biggest number in a constraint 14
Biggest sum of numbers in a constraint 32512
Number of bits of the biggest sum of numbers15
Number of products (including duplicates)343
Sum of products size (including duplicates)686
Number of different products343
Sum of products size686

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
SCIP spx 2 2011-06-10 (fixed) (complete)3484988OPT3 0.035994 0.0365231
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452170OPT3 0.037993 0.0375629
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450510OPT3 0.039993 0.0409519
SCIP spx E_2 2011-06-10 (fixed) (complete)3488430OPT3 0.039993 0.0417671
borg pb-opt-11.04.03 (complete)3481367OPT3 0.538917 0.614168
clasp 2.0-R4191 [DEPRECATED] (complete)3469252OPT3 5.49216 5.49671
clasp 2.0-R4191-patched (fixed) (complete)3491743OPT3 5.70913 5.71065
Sat4j Resolution 2.3.0 (complete)3458214OPT3 14.7948 13.7337
Sat4j Res//CP 2.3.0 (complete)3453830OPT3 31.2013 16.4284
bsolo 3.2 (complete)3462618OPT3 68.6756 68.6741
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465938? (TO)3 1800.05 1800.02
MinisatID 2.4.8 [DEPRECATED] (complete)3464278? (TO)3 1800.06 1800.02
MinisatID 2.5.2 (fixed) (complete)3490151? (exit code) 0 0.00591598
MinisatID 2.5.2-gmp (fixed) (complete)3496251? (exit code) 0.000999 0.00599102
Sat4j CuttingPlanes 2.3.0 (complete)3456022? (TO) 1800.28 1792.08

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:
-x147 -x146 -x145 x144 -x143 x142 -x141 -x140 -x139 -x138 -x137 -x136 x135 -x134 -x98 -x97 -x96 x95 -x94 x93 x92 -x133 -x132 -x131 -x130
-x129 x128 -x127 x91 -x90 x89 x88 -x87 -x86 x85 -x126 -x125 -x124 -x123 -x122 -x121 x120 x84 x83 x82 -x81 -x80 x79 x78 -x119 -x118 -x117
-x116 -x115 -x114 -x113 x77 -x76 x75 -x74 -x73 -x72 x71 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x70 -x69 x68 x67 -x66 x65 x64 -x105 -x104
-x103 -x102 -x101 -x100 -x99 -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