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

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategorySOFT-SMALLINT-LIN (only soft 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 benchmark2.66659
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 constraints101
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 4944
Min constraint cost 1
Max constraint cost 98
Sum of constraints costs 4943
Biggest number in a constraint 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1154
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 with SoPlex (complete)3447820OPTIMUM 2.66659 2.66646
clasp 2.0-RC2 (complete)3448154OPTIMUM 4.13037 4.13021
wbo 1.6 (complete)3447083OPTIMUM 11.2233 11.2253
Sat4j Resolution 2011-06-08 (complete)3492669OPTIMUM 83.6393 82.1582

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