Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/tsp/ normalized-t3002.11tsp11.1900583053--soft-66-100-0.wbo |
MD5SUM | 56cc5d1f816d97170bd91f7584a55091 |
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 | 1 |
Best CPU time to get the best result obtained on this benchmark | 87.2637 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 231 |
Total number of constraints | 2707 |
Number of soft constraints | 911 |
Number of constraints which are clauses | 2684 |
Number of constraints which are cardinality constraints (but not clauses) | 22 |
Number of constraints which are nor clauses,nor cardinality constraints | 1 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 110 |
Top cost | 45526 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 45525 |
Biggest number in a constraint | 25 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 651 |
Number of bits of the biggest sum of numbers | 10 |
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) | 3448607 | OPTIMUM | 87.2637 | 87.2625 |
wbo 1.6 (complete) | 3447112 | OPTIMUM | 334.693 | 334.686 |
Sat4j Resolution 2011-06-08 (complete) | 3492698 | OPTIMUM | 844.742 | 841.676 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447849 | OPTIMUM | 1069.59 | 1069.57 |
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: 1-x228 -x229 -x230 -x231