Name | /PARTIAL-BIGINT-LIN/wcsp/warehouse/ normalized-capmq4_wcsp.wbo |
MD5SUM | 5f4ca6e09dba08c0ec6d7d843609ae14 |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MSAT |
Best cost obtained on this benchmark | 3728234 |
Best CPU time to get the best result obtained on this benchmark | 1800.26 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 90600 |
Total number of constraints | 180900 |
Number of soft constraints | 180300 |
Number of constraints which are clauses | 180300 |
Number of constraints which are cardinality constraints (but not clauses) | 600 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 300 |
Top cost | 157287652 |
Min constraint cost | 1 |
Max constraint cost | 157287652 |
Sum of constraints costs | 14157263284542 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 301 |
Number of bits of the biggest sum of numbers | 9 |
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 |
---|---|---|---|---|
PB/CT 0.1 fixed (complete) | 2701203 | MSAT (TO) | 1800.13 | 1800.08 |
SAT4J PB Resolution 2.2.1 (complete) | 2701202 | MSAT (TO) | 1800.26 | 1796.81 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701199 | Wrong UNSAT | 3.68544 | 1.98415 |
PB/CT 0.1 (complete) | 2701201 | Wrong UNSAT | 36.5904 | 36.5922 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701198 | Wrong UNSAT | 38.2182 | 31.3349 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701200 | Wrong UNSAT | 47.5418 | 36.9713 |
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: 4508540--too large--