Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/wnqueen/ normalized-t2001.13queen13.1111218955--soft-66-100-0.wbo |
MD5SUM | 7e7d682b827ac0ee06475f159229fdf7 |
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 | 19 |
Best CPU time to get the best result obtained on this benchmark | 0.555914 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 169 |
Total number of constraints | 101 |
Number of soft constraints | 29 |
Number of constraints which are clauses | 30 |
Number of constraints which are cardinality constraints (but not clauses) | 70 |
Number of constraints which are nor clauses,nor cardinality constraints | 1 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 169 |
Top cost | 1556 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1555 |
Biggest number in a constraint | 38 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 1202 |
Number of bits of the biggest sum of numbers | 11 |
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 |
---|---|---|---|---|
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447587 | OPTIMUM | 0.555914 | 0.555679 |
clasp 2.0-RC2 (complete) | 3448443 | OPTIMUM | 3.69144 | 3.69123 |
Sat4j Resolution 2011-06-08 (complete) | 3492402 | OPTIMUM | 13.6109 | 13.0353 |
wbo 1.6 (complete) | 3446850 | OPTIMUM | 18.5242 | 18.5244 |
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: 19-x4 -x3 -x2 -x1