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

Result page for benchmark

Jump to solvers results

General information on the benchmark

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.008998
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables152
Total number of constraints127
Number of soft constraints88
Number of constraints which are clauses77
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints50
Minimum length of a constraint1
Maximum length of a constraint19
Top cost 4363
Min constraint cost 1
Max constraint cost 100
Sum of constraints costs 4362
Biggest number in a constraint 772
Number of bits of the biggest number in a constraint 10
Biggest sum of numbers in a constraint 2305
Number of bits of the biggest sum of numbers12
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)3448217OPTIMUM 0.008998 0.010198
wbo 1.6 (complete)3446563OPTIMUM 0.011997 0.0130029
Sat4j Resolution 2011-06-08 (complete)3492079OPTIMUM 0.570912 0.306459
SCIP spx SCIP with SoPlex (complete)3447300OPTIMUM 0.857869 0.858352

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:
x144 -x145 x146 -x147 x148 -x149 x150 -x151 -x152