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

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

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/wcsp/dimacs/
normalized-dubois23_ext.wbo
MD5SUM1e4741c2419080a5586a4c8ec56b7447
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.002998
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables138
Total number of constraints253
Number of soft constraints184
Number of constraints which are clauses184
Number of constraints which are cardinality constraints (but not clauses)69
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint3
Top cost 185
Min constraint cost 1
Max constraint cost 1
Sum of constraints costs 184
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
clasp 2.0-RC2 (complete)3448655OPTIMUM 0.002998 0.0057491
wbo 1.6 (complete)3447181OPTIMUM 0.005999 0.00593697
Sat4j Resolution 2011-06-08 (complete)3492767OPTIMUM 0.365943 0.245909
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete)3447918OPTIMUM 0.467928 0.468737

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