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

Result page for benchmark
/PARTIAL-SMALLINT-LIN/wcsp/academics/
normalized-donald_wcsp.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/wcsp/academics/
normalized-donald_wcsp.wbo
MD5SUM877b81089f5b4ced79a7d6c9f3245147
Bench CategoryPARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints)
Best result obtained on this benchmarkMOPT
Best cost obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.041993
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables107
Total number of constraints6557
Number of soft constraints6542
Number of constraints which are clauses6542
Number of constraints which are cardinality constraints (but not clauses)15
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint10
Top cost 1
Min constraint cost 1
Max constraint cost 1
Sum of constraints costs 6542
Biggest number in a constraint 4
Number of bits of the biggest number in a constraint 3
Biggest sum of numbers in a constraint 11
Number of bits of the biggest sum of numbers4
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)3713023OPTIMUM 0.041993 0.0434371
wbo 1.72 (complete)3728289OPTIMUM 0.044992 0.0460699
clasp 2.0.6-R5325 (complete)3711512OPTIMUM 0.055991 0.056686
pwbo 2.02 (complete)3728698OPTIMUM 0.064989 0.046481
pwbo 2.01 (complete)3712614OPTIMUM 0.065989 0.045928
wbo2satCp2 2012-05-19 (complete)3717135OPTIMUM 0.665898 0.667695
wbo2sat 2012-05-19 (complete)3716442OPTIMUM 0.668898 0.673168
Sat4j PB 2012-05-28 (complete)3718237OPTIMUM 1.05484 0.538522
npSolver inc (complete)3714363OPTIMUM 2.96955 3.00638
npSolver 1.0 (complete)3713670OPTIMUM 3.00954 3.07845
npSolver inc-topdown-quickBound (complete)3715749OPTIMUM 3.23251 3.23786
npSolver inc-topDown (complete)3715056OPTIMUM 3.2895 3.29185
SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed (complete)3717590OPTIMUM 3.66144 3.66403
toysat 2012-05-17 (complete)3712159OPTIMUM 4.96724 4.96911
npSolver 1.0 (fixed) (complete)3755130OPTIMUM 7.33688 7.33839
npSolver inc (fixed) (complete)3754437OPTIMUM 7.46286 7.46899
npSolver inc-topDown (fixed) (complete)3753744OPTIMUM 8.10377 8.10562
npSolver inc-topdown-quickBound (fixed) (complete)3753051OPTIMUM 8.15776 8.15777

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