Name | /PARTIAL-BIGINT-LIN/wcsp/scens/ normalized-scen07reduc_wcsp.wbo |
MD5SUM | 6effabdb5f06e7cb39e8e89923338a20 |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
Best result obtained on this benchmark | |
Best cost obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 4824 |
Total number of constraints | 564001 |
Number of soft constraints | 563839 |
Number of constraints which are clauses | 563839 |
Number of constraints which are cardinality constraints (but not clauses) | 162 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 44 |
Top cost | 343592 |
Min constraint cost | 1 |
Max constraint cost | 343592 |
Sum of constraints costs | 24999659190 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 45 |
Number of bits of the biggest sum of numbers | 6 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701403 | UNSAT | 14.8917 | 7.44847 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701402 | UNSAT | 448.756 | 333.29 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701404 | UNSAT | 530.393 | 331.916 |
PB/CT 0.1 (complete) | 2701405 | ? (TO) | 1800.07 | 1800.04 |
SAT4J PB Resolution 2.2.1 (complete) | 2701406 | ? (TO) | 1800.13 | 1792.87 |
PB/CT 0.1 fixed (complete) | 2701407 | ? (TO) | 1800.19 | 1800.42 |
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: