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

Result page for benchmark
/PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/
normalized-pigeon-cardinality-31-30--soft-66-100-0.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/
normalized-pigeon-cardinality-31-30--soft-66-100-0.wbo
MD5SUM318c9cc5b16e210b9b0a9873d7c14d4c
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.06499
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables930
Total number of constraints61
Number of soft constraints16
Number of constraints which are clauses31
Number of constraints which are cardinality constraints (but not clauses)30
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint30
Maximum length of a constraint31
Top cost 916
Min constraint cost 1
Max constraint cost 96
Sum of constraints costs 915
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 32
Number of bits of the biggest sum of numbers6
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)3447444OPTIMUM 0.06499 0.065903
clasp 2.0-RC2 (complete)3448318MSAT (TO) 1800.08 1800.01
Sat4j Resolution 2011-06-08 (complete)3492247MSAT (TO) 1800.09 1797.83
wbo 1.6 (complete)3446707? (TO) 1800.07 1800.03

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:
-x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 -x1