| Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/tsp/ normalized-t3002.11tsp11.1900563801--soft-66-100-0.wbo |
| MD5SUM | 8222df718f0c39737e94bfab6b6fa003 |
| 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 | 5 |
| Best CPU time to get the best result obtained on this benchmark | 13.341 |
| 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 | 927 |
| 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 | 45360 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 45359 |
| Biggest number in a constraint | 25 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 719 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4109954 | OPTIMUM | 13.341 | 13.3424 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4109952 | OPTIMUM | 16.9304 | 15.0616 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4109953 | OPTIMUM | 18.6322 | 25.1345 |
| NaPS 1.02 (complete) | 4109955 | OPTIMUM | 31.9891 | 31.9948 |
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: 5-x231