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

Result page for benchmark
/PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/wnqueen/
normalized-t2001.13queen13.1111219799--soft-66-100-0.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/wnqueen/
normalized-t2001.13queen13.1111219799--soft-66-100-0.wbo
MD5SUM37c9692c41d7d7588ca490820e101eb5
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.854869
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables169
Total number of constraints101
Number of soft constraints29
Number of constraints which are clauses30
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint169
Top cost 1556
Min constraint cost 1
Max constraint cost 100
Sum of constraints costs 1555
Biggest number in a constraint 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1258
Number of bits of the biggest sum of numbers11
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
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete)3447535OPTIMUM 0.854869 0.855099
clasp 2.0-RC2 (complete)3448402OPTIMUM 2.05669 2.0574
wbo 1.6 (complete)3446798OPTIMUM 5.01624 5.01817
Sat4j Resolution 2011-06-08 (complete)3492338OPTIMUM 28.4217 27.5455

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:
x4 -x3 -x2 -x1