Name | /PARTIAL-BIGINT-LIN/wcsp/warehouse/ normalized-capmq5_wcsp.wbo |
MD5SUM | 84cd85c95cced1b7045b580cb3e3a3b7 |
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 | 3662214 |
Best CPU time to get the best result obtained on this benchmark | 1800.27 |
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 | 163170779 |
Min constraint cost | 1 |
Max constraint cost | 163170779 |
Sum of constraints costs | 14686737483247 |
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) | 2700921 | MSAT (TO) | 1800.16 | 1800.1 |
SAT4J PB Resolution 2.2.1 (complete) | 2700920 | MSAT (TO) | 1800.27 | 1796.79 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2700917 | Wrong UNSAT | 4.29535 | 2.15981 |
PB/CT 0.1 (complete) | 2700919 | Wrong UNSAT | 36.6294 | 36.7048 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2700916 | Wrong UNSAT | 39.248 | 32.3239 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2700918 | Wrong UNSAT | 43.4854 | 32.6435 |
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: 4565406--too large--