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=9-P0=211-P1=331-P2=199-P3=307-P4=457-P5=293-B.opb

Jump to solvers results

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=9-P0=211-P1=331-P2=199-P3=307-P4=457-P5=293-B.opb
MD5SUM55e3096e9013fd2f39f8572a635bf07d
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.179971
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 variables135
Total number of constraints11
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 constraints11
Minimum length of a constraint9
Maximum length of a constraint99
Number of terms in the objective function 9
Biggest coefficient in the objective function 256
Number of bits for the biggest coefficient in the objective function 9
Sum of the numbers in the objective function 511
Number of bits of the sum of numbers in the objective function 9
Biggest number in a constraint 131072
Number of bits of the biggest number in a constraint 18
Biggest sum of numbers in a constraint 523264
Number of bits of the biggest sum of numbers19
Number of products (including duplicates)405
Sum of products size (including duplicates)810
Number of different products405
Sum of products size810

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
SCIP spx E_2 2011-06-10 (fixed) (complete)3488441OPT3 0.179971 0.179995
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450521OPT3 0.179972 0.180548
SCIP spx 2 2011-06-10 (fixed) (complete)3484999OPT3 0.182972 0.184247
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452181OPT3 0.18497 0.184834
borg pb-opt-11.04.03 (complete)3481378OPT3 0.691893 0.824372
clasp 2.0-R4191 [DEPRECATED] (complete)3469263OPT3 103.589 103.588
clasp 2.0-R4191-patched (fixed) (complete)3491754OPT3 113.923 113.922
Sat4j Resolution 2.3.0 (complete)3458225OPT3 248.628 246.106
Sat4j Res//CP 2.3.0 (complete)3453841OPT3 422.35 224.512
bsolo 3.2 (complete)3462629SAT3 1798 1798.01
MinisatID 2.4.8 [DEPRECATED] (complete)3464289? (TO)3 1800.06 1800.02
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465949? (TO)87 1800.1 1800.12
MinisatID 2.5.2-gmp (fixed) (complete)3496262? (exit code) 0.000999 0.00595111
MinisatID 2.5.2 (fixed) (complete)3490162? (exit code) 0.000999 0.00574293
Sat4j CuttingPlanes 2.3.0 (complete)3456033? (TO) 1800.25 1792.78

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