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

Result page for benchmark
/PARTIAL-SMALLINT-LIN/PB06/submitted-PB05/aloul/FPGA_SAT05/
normalized-chnl35_40_pb.cnf.cr--soft-33-100-0.wbo

Jump to solvers results

General information on the benchmark

Name/PARTIAL-SMALLINT-LIN/PB06/submitted-PB05/aloul/FPGA_SAT05/
normalized-chnl35_40_pb.cnf.cr--soft-33-100-0.wbo
MD5SUM80545edaffb0e9df5db6b9d8725aa6de
Bench CategoryPARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints)
Best result obtained on this benchmarkMOPT
Best cost obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark0.279956
Max-Satisfiable
Max-(Un)Satisfiability was proved
Best value of the cost
Optimality of the best cost was proved
Number of variables2800
Total number of constraints150
Number of soft constraints106
Number of constraints which are clauses80
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint35
Maximum length of a constraint40
Top cost 5369
Min constraint cost 1
Max constraint cost 100
Sum of constraints costs 5368
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 41
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)3447399OPTIMUM 0.279956 0.280301
clasp 2.0-RC2 (complete)3448279MSAT (TO) 1800.08 1800.11
Sat4j Resolution 2011-06-08 (complete)3492202MSAT (TO) 1800.17 1795.36
wbo 1.6 (complete)3446662? (TO) 1800.06 1800.02

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: 4
Solution found:
-x8 -x7 -x6 -x5 -x4 -x3 x2 -x1