Name | /PARTIAL-SMALLINT-LIN/wcsp/academics/ normalized-zebre-ext_wcsp.wbo |
MD5SUM | dfefad7e9fca834da79a456032de5db6 |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 0 |
Best CPU time to get the best result obtained on this benchmark | 0.001999 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 115 |
Total number of constraints | 460 |
Number of soft constraints | 437 |
Number of constraints which are clauses | 437 |
Number of constraints which are cardinality constraints (but not clauses) | 23 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 5 |
Top cost | 1 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 437 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 6 |
Number of bits of the biggest sum of numbers | 3 |
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 |
---|---|---|---|---|
clasp 2.0-RC2 (complete) | 3448637 | OPTIMUM | 0.001999 | 0.00575191 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447900 | OPTIMUM | 0.034994 | 0.0362241 |
Sat4j Resolution 2011-06-08 (complete) | 3492749 | OPTIMUM | 0.245962 | 0.194213 |
wbo 1.6 (complete) | 3447163 | MSAT | 0.000999 | 0.0057501 |
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: 0-x107 -x108 -x109 x110 x111 -x112 -x113 -x114 -x115