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=6-P0=41-P1=37-P2=47-P3=2-P4=7-P5=29-P6=53-B.opb

Jump to solvers results

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/
factor-mod-size=6-P0=41-P1=37-P2=47-P3=2-P4=7-P5=29-P6=53-B.opb
MD5SUMdaba014eb092fb7e1b2012524271e492
Bench CategoryOPT-SMALLINT-NLC (optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark2
Best CPU time to get the best result obtained on this benchmark0.627903
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 2
Optimality of the best value was proved YES
Number of variables108
Total number of constraints13
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 constraints13
Minimum length of a constraint6
Maximum length of a constraint48
Number of terms in the objective function 6
Biggest coefficient in the objective function 32
Number of bits for the biggest coefficient in the objective function 6
Sum of the numbers in the objective function 63
Number of bits of the sum of numbers in the objective function 6
Biggest number in a constraint 2048
Number of bits of the biggest number in a constraint 12
Biggest sum of numbers in a constraint 8064
Number of bits of the biggest sum of numbers13
Number of products (including duplicates)216
Sum of products size (including duplicates)432
Number of different products216
Sum of products size432

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
clasp 2.0-R4191-patched (fixed) (complete)3491653OPT2 0.627903 0.629002
clasp 2.0-R4191 [DEPRECATED] (complete)3469162OPT2 0.643901 0.643983
Sat4j Resolution 2.3.0 (complete)3458124OPT2 0.936856 0.651064
SCIP spx E_2 2011-06-10 (fixed) (complete)3488340OPT2 1.24581 1.2459
borg pb-opt-11.04.03 (complete)3481277OPT2 2.26365 2.32514
bsolo 3.2 (complete)3462528OPT2 2.6096 2.60993
Sat4j Res//CP 2.3.0 (complete)3453740OPT2 3.09353 1.70616
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 [DEPRECATED] (complete)3452080OPT2 4.10337 4.1033
SCIP spx 2 2011-06-10 (fixed) (complete)3484898OPT2 4.18236 4.18259
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4 [DEPRECATED] (complete)3450420OPT2 6.39103 6.39101
MinisatID 2.4.8 [DEPRECATED] (complete)3464188OPT2 10.0295 10.0292
MinisatID 2.4.8-gmp [DEPRECATED] (complete)3465848OPT2 29.3905 29.3961
Sat4j CuttingPlanes 2.3.0 (complete)3455932OPT2 246.671 244.417
MinisatID 2.5.2 (fixed) (complete)3490061? (exit code) 0 0.00572999
MinisatID 2.5.2-gmp (fixed) (complete)3496161? (exit code) 0 0.00589604

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