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=5-P1=13-P2=29-P3=13-P4=7-P5=5-P6=37-P7=7-P8=29-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=5-P1=13-P2=29-P3=13-P4=7-P5=5-P6=37-P7=7-P8=29-B.opb
MD5SUM1a5734774d9497f5914e33a08764abe1
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.026995
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 variables120
Total number of constraints17
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 constraints17
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)200
Sum of products size (including duplicates)400
Number of different products200
Sum of products size400

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
SCIP spx 2 2011-06-10 (fixed) (complete)3484861OPT3 0.026995 0.0278731
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452043OPT3 0.027995 0.028455
SCIP spx E_2 2011-06-10 (fixed) (complete)3488303OPT3 0.029994 0.031226
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450383OPT3 0.030994 0.031172
clasp 2.0-R4191-patched (fixed) (complete)3491616OPT3 0.174973 0.175829
clasp 2.0-R4191 [DEPRECATED] (complete)3469125OPT3 0.177972 0.178329
borg pb-opt-11.04.03 (complete)3481240OPT3 0.500923 0.590669
Sat4j Resolution 2.3.0 (complete)3458087OPT3 0.948854 0.672251
bsolo 3.2 (complete)3462491OPT3 1.53577 1.53854
Sat4j Res//CP 2.3.0 (complete)3453703OPT3 3.35149 2.71926
MinisatID 2.4.8 [DEPRECATED] (complete)3464151OPT3 125.955 125.972
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465811OPT3 366.955 366.944
Sat4j CuttingPlanes 2.3.0 (complete)3455895SAT (TO)3 1800.36 1791.91
MinisatID 2.5.2-gmp (fixed) (complete)3496124? (exit code) 0 0.00595197
MinisatID 2.5.2 (fixed) (complete)3490024? (exit code) 0.000999 0.00576204

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:
-x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x80 -x79 -x78 -x77 x76 -x110 -x109 -x108 x107 -x106 -x75 x74 -x73 x72 x71 -x105
-x104 -x103 -x102 x101 x70 x69 -x68 -x67 x66 -x100 -x99 -x98 -x97 x96 x65 -x64 -x63 x62 x61 -x95 -x94 -x93 x92 -x91 x60 -x59 -x58 -x57 x56
-x90 -x89 -x88 -x87 -x86 x55 x54 -x53 x52 x51 -x85 -x84 -x83 -x82 -x81 -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