Name | /PARTIAL-BIGINT-LIN/wcsp/warehouse/ normalized-capmo4_wcsp.wbo |
MD5SUM | 4acc3a5419b938688cb78ca12bf017b9 |
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 | 1137948 |
Best CPU time to get the best result obtained on this benchmark | 1800.28 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 10200 |
Total number of constraints | 20300 |
Number of soft constraints | 20100 |
Number of constraints which are clauses | 20100 |
Number of constraints which are cardinality constraints (but not clauses) | 200 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 100 |
Top cost | 19552592 |
Min constraint cost | 1 |
Max constraint cost | 19552592 |
Sum of constraints costs | 195667093770 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 101 |
Number of bits of the biggest sum of numbers | 7 |
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) | 2700987 | MSAT (TO) | 1800.09 | 1800.02 |
SAT4J PB Resolution 2.2.1 (complete) | 2700986 | MSAT (TO) | 1800.28 | 1798.5 |
PB/CT 0.1 (complete) | 2700985 | Wrong UNSAT | 0.805876 | 0.806381 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2700983 | Wrong UNSAT | 1.54576 | 0.724014 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2700982 | Wrong UNSAT | 1.9777 | 1.06032 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2700984 | Wrong UNSAT | 2.66059 | 2.03286 |
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: 1370528--too large--