PB'12 competition: WBO track: solvers results per benchmarks

Result page for benchmark
/PARTIAL-SMALLINT-LIN/wcsp/dimacs/
normalized-pret60_75_ext.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/wcsp/dimacs/
normalized-pret60_75_ext.wbo
MD5SUMc20bb26c743060b7127589d532576637
Bench CategoryPARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints)
Best result obtained on this benchmarkMOPT
Best cost obtained on this benchmark1
Best CPU time to get the best result obtained on this benchmark0.000999
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables120
Total number of constraints220
Number of soft constraints160
Number of constraints which are clauses160
Number of constraints which are cardinality constraints (but not clauses)60
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint3
Top cost 161
Min constraint cost 1
Max constraint cost 1
Sum of constraints costs 160
Biggest number in a constraint 2
Number of bits of the biggest number in a constraint 2
Biggest sum of numbers in a constraint 5
Number of bits of the biggest sum of numbers3
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
wbo 1.71 (complete)3713075OPTIMUM 0.000999 0.00814302
pwbo 2.02 (complete)3728750OPTIMUM 0.001998 0.00630498
wbo 1.72 (complete)3728341OPTIMUM 0.001998 0.00930802
pwbo 2.01 (complete)3712666OPTIMUM 0.002998 0.00670394
clasp 2.0.6-R5325 (complete)3711564OPTIMUM 0.003998 0.00615388
wbo2satCp2 2012-05-19 (complete)3717187OPTIMUM 0.017996 0.0192679
wbo2sat 2012-05-19 (complete)3716494OPTIMUM 0.021995 0.0217949
toysat 2012-05-17 (complete)3712211OPTIMUM 0.022995 0.025754
npSolver 1.0 (complete)3713722OPTIMUM 0.031994 0.0368249
npSolver inc-topdown-quickBound (complete)3715801OPTIMUM 0.032994 0.033723
npSolver inc-topDown (complete)3715108OPTIMUM 0.032994 0.0341469
npSolver inc (complete)3714415OPTIMUM 0.034994 0.0354991
npSolver 1.0 (fixed) (complete)3755182OPTIMUM 0.039993 0.0435509
npSolver inc-topDown (fixed) (complete)3753796OPTIMUM 0.042993 0.0446671
npSolver inc-topdown-quickBound (fixed) (complete)3753103OPTIMUM 0.045992 0.0469461
npSolver inc (fixed) (complete)3754489OPTIMUM 0.047992 0.04685
Sat4j PB 2012-05-28 (complete)3718289OPTIMUM 0.435932 0.256837
SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed (complete)3717642OPTIMUM 2.01869 2.0206

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

cost of falsified constraints: 1
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