Name | /PARTIAL-BIGINT-LIN/wcsp/pedigree/ normalized-sheep4r-4-2_wcsp.wbo |
MD5SUM | 4279ee44886a475273bf158c4a05b4f8 |
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 | 22540 |
Total number of constraints | 1101088 |
Number of soft constraints | 1098834 |
Number of constraints which are clauses | 1098834 |
Number of constraints which are cardinality constraints (but not clauses) | 2254 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 10 |
Top cost | 899 |
Min constraint cost | 1 |
Max constraint cost | 899 |
Sum of constraints costs | 980594130 |
Biggest number in a constraint | 2 |
Number of bits of the biggest number in a constraint | 2 |
Biggest sum of numbers in a constraint | 11 |
Number of bits of the biggest sum of numbers | 4 |
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) | 2701685 | UNSAT | 30.0864 | 12.3058 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701684 | UNSAT | 58.4941 | 32.3351 |
PB/CT 0.1 (complete) | 2701687 | UNSAT | 1759.36 | 1759.4 |
SAT4J PB Resolution 2.2.1 (complete) | 2701688 | ? (TO) | 1800.13 | 1781.28 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701686 | ? (TO) | 1802.13 | 1769.68 |
PB/CT 0.1 fixed (complete) | 2701689 | Signal | 30.9213 | 36.1529 |
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: