Name | /PARTIAL-BIGINT-LIN/wcsp/pedigree/ normalized-sheep4r-4-3_wcsp.wbo |
MD5SUM | 376764ac4c5c3f094ec1a2d2f7cbae71 |
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 | 26850 |
Total number of constraints | 1527009 |
Number of soft constraints | 1524324 |
Number of constraints which are clauses | 1524324 |
Number of constraints which are cardinality constraints (but not clauses) | 2685 |
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 | 1259 |
Min constraint cost | 1 |
Max constraint cost | 1259 |
Sum of constraints costs | 1904880840 |
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) | 2701733 | UNSAT | 47.8947 | 22.1348 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701732 | UNSAT | 58.984 | 30.5653 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701734 | ? | 401.993 | 375.716 |
PB/CT 0.1 (complete) | 2701735 | ? (TO) | 1800.07 | 1800.01 |
SAT4J PB Resolution 2.2.1 (complete) | 2701736 | ? (TO) | 1800.2 | 1780.09 |
PB/CT 0.1 fixed (complete) | 2701737 | Signal | 31.9241 | 41.3874 |
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: