Name | /PARTIAL-BIGINT-LIN/wcsp/warehouse/ normalized-capb_wcsp.wbo |
MD5SUM | b88bd1871aa01efcb3899341ac23775f |
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 | 23081200 |
Best CPU time to get the best result obtained on this benchmark | 1800.34 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 100200 |
Total number of constraints | 201200 |
Number of soft constraints | 200100 |
Number of constraints which are clauses | 200100 |
Number of constraints which are cardinality constraints (but not clauses) | 1100 |
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 | 132622180 |
Min constraint cost | 1 |
Max constraint cost | 132622180 |
Sum of constraints costs | 13265314501093 |
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) | 2701065 | MSAT (TO) | 1800.14 | 1800.09 |
SAT4J PB Resolution 2.2.1 (complete) | 2701064 | MSAT (TO) | 1800.34 | 1796.53 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701061 | Wrong UNSAT | 3.90441 | 2.13777 |
PB/CT 0.1 (complete) | 2701063 | Wrong UNSAT | 44.8682 | 44.8854 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701060 | Wrong UNSAT | 48.5366 | 39.1204 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701062 | Wrong UNSAT | 55.9385 | 40.3853 |
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: 25561580--too large--