| Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/tsp/ normalized-t3002.11tsp11.1900548667--soft-33-100-0.wbo |
| MD5SUM | b80542b6ea011406c368e0a53be4d6f1 |
| 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 | 130.374 |
| 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 | 1804 |
| 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 | 90822 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 90821 |
| Biggest number in a constraint | 25 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 625 |
| 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) | 3448536 | OPTIMUM | 130.374 | 130.371 |
| wbo 1.6 (complete) | 3446979 | OPTIMUM | 372.235 | 372.26 |
| Sat4j Resolution 2011-06-08 (complete) | 3492565 | OPTIMUM | 1200.94 | 1197.21 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447716 | OPTIMUM | 1436.72 | 1436.7 |
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-x230 -x231