Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j9039_3-unsat--soft-66-100-0.wbo |
MD5SUM | 6b812e3bd45da6d63d6d9a24d1cd16b1 |
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 | 42 |
Best CPU time to get the best result obtained on this benchmark | 0.089985 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 15106 |
Total number of constraints | 51849 |
Number of soft constraints | 17749 |
Number of constraints which are clauses | 51521 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 328 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 50 |
Top cost | 895680 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 895679 |
Biggest number in a constraint | 42 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 335 |
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 |
---|---|---|---|---|
clasp 2.0-RC2 (complete) | 3448345 | OPTIMUM | 0.089985 | 0.0913101 |
wbo 1.6 (complete) | 3446741 | OPTIMUM | 0.130979 | 0.130663 |
Sat4j Resolution 2011-06-08 (complete) | 3492281 | OPTIMUM | 2.76558 | 1.43409 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447478 | MSAT (TO) | 1800.32 | 1800.28 |
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: 42-x15101 -x15102 -x15103 -x15104 -x15105 x15106