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 benchmark6.79097
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables9071
Total number of constraints25914
Number of soft constraints17208
Number of constraints which are clauses25190
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints724
Minimum length of a constraint1
Maximum length of a constraint11
Top cost 857979
Min constraint cost 1
Max constraint cost 100
Sum of constraints costs 857978
Biggest number in a constraint 39
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 132
Number of bits of the biggest sum of numbers8
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)3448218OPTIMUM 6.79097 6.79242
wbo 1.6 (complete)3446565OPTIMUM 9.1826 9.1846
Sat4j Resolution 2011-06-08 (complete)3492082OPTIMUM 22.9755 21.5256
SCIP spx SCIP with SoPlex (complete)3447302MSAT (TO) 1800.39 1800.34

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:
x9064 x9065 x9066 x9067 x9068 -x9069 -x9070 x9071