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=5-P0=17-P1=29-P2=13-P3=37-P4=29-P5=29-P6=11-P7=11-P8=31-P9=17-B.opb

Jump to solvers results

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=5-P0=17-P1=29-P2=13-P3=37-P4=29-P5=29-P6=11-P7=11-P8=31-P9=17-B.opb
MD5SUMd53202099779b6367fc4504546ad6296
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.169974
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 constraints19
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 constraints19
Minimum length of a constraint5
Maximum length of a constraint35
Number of terms in the objective function 5
Biggest coefficient in the objective function 16
Number of bits for the biggest coefficient in the objective function 5
Sum of the numbers in the objective function 31
Number of bits of the sum of numbers in the objective function 5
Biggest number in a constraint 512
Number of bits of the biggest number in a constraint 10
Biggest sum of numbers in a constraint 1984
Number of bits of the biggest sum of numbers11
Number of products (including duplicates)225
Sum of products size (including duplicates)450
Number of different products225
Sum of products size450

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
clasp 2.0-R4191-patched (fixed) (complete)3491668OPT3 0.169974 0.171093
clasp 2.0-R4191 [DEPRECATED] (complete)3469177OPT3 0.179971 0.18624
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450435OPT3 0.38894 0.389304
SCIP spx E_2 2011-06-10 (fixed) (complete)3488355OPT3 0.395939 0.395891
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452095OPT3 0.966852 0.970863
SCIP spx 2 2011-06-10 (fixed) (complete)3484913OPT3 0.97885 0.979669
Sat4j Resolution 2.3.0 (complete)3458139OPT3 1.2858 0.919271
bsolo 3.2 (complete)3462543OPT3 1.58576 1.58548
borg pb-opt-11.04.03 (complete)3481292OPT3 1.78373 1.84761
Sat4j Res//CP 2.3.0 (complete)3453755OPT3 3.75243 2.72652
MinisatID 2.4.8 [DEPRECATED] (complete)3464203OPT3 86.9038 86.9022
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465863OPT3 218.573 218.571
Sat4j CuttingPlanes 2.3.0 (complete)3455947SAT (TO)3 1800.32 1791.19
MinisatID 2.5.2 (fixed) (complete)3490076? (exit code) 0 0.00572494
MinisatID 2.5.2-gmp (fixed) (complete)3496176? (exit code) 0.000999 0.00595693

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