Name | /PARTIAL-BIGINT-LIN/wcsp/graphs/ normalized-graph11_wcsp.wbo |
MD5SUM | 6246a3a3522110451ca95f5d2be44880 |
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 | 12820 |
Total number of constraints | 1878918 |
Number of soft constraints | 1878578 |
Number of constraints which are clauses | 1878578 |
Number of constraints which are cardinality constraints (but not clauses) | 340 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 44 |
Top cost | 824749 |
Min constraint cost | 1 |
Max constraint cost | 1000 |
Sum of constraints costs | 470565953 |
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) | 2701805 | UNSAT | 57.7492 | 23.7322 |
PB/CT 0.1 (complete) | 2701807 | ? (MO) | 26.334 | 28.3349 |
PB/CT 0.1 fixed (complete) | 2701809 | ? (MO) | 26.7319 | 26.7327 |
SAT4J PB Resolution 2.2.1 (complete) | 2701808 | ? (TO) | 1800.11 | 1773.38 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701806 | ? (TO) | 1800.17 | 1068.69 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701804 | ? (TO) | 1800.28 | 1193.11 |
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: