Name | /PARTIAL-BIGINT-LIN/wcsp/warehouse/ normalized-capmp5_wcsp.wbo |
MD5SUM | a553af307837830e83a31a30c6d8ba3b |
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 | 2240403 |
Best CPU time to get the best result obtained on this benchmark | 1800.3 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 40400 |
Total number of constraints | 80600 |
Number of soft constraints | 80200 |
Number of constraints which are clauses | 80200 |
Number of constraints which are cardinality constraints (but not clauses) | 400 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 200 |
Top cost | 73551998 |
Min constraint cost | 1 |
Max constraint cost | 73551998 |
Sum of constraints costs | 2942636678406 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 201 |
Number of bits of the biggest sum of numbers | 8 |
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) | 2701221 | MSAT (TO) | 1800.09 | 1800.05 |
SAT4J PB Resolution 2.2.1 (complete) | 2701220 | MSAT (TO) | 1800.3 | 1797.71 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701217 | Wrong UNSAT | 2.6086 | 1.35914 |
PB/CT 0.1 (complete) | 2701219 | Wrong UNSAT | 8.18375 | 8.18313 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701216 | Wrong UNSAT | 9.54355 | 7.14444 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701218 | Wrong UNSAT | 11.4253 | 8.73637 |
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: 2746745--too large--