Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/tsp/ normalized-t3002.11tsp11.1900564824--soft-33-100-0.wbo |
MD5SUM | 901bd5d9c00fc087d540e6ebf4e7f98d |
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 | 4 |
Best CPU time to get the best result obtained on this benchmark | 9.26059 |
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 | 1837 |
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 | 93832 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 93831 |
Biggest number in a constraint | 25 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 813 |
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) | 4109858 | OPTIMUM | 9.26059 | 9.26201 |
NaPS 1.02 (complete) | 4109859 | OPTIMUM | 22.2866 | 22.291 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4109856 | OPTIMUM | 23.4704 | 22.2527 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4109857 | OPTIMUM | 78.2811 | 75.4317 |
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: 4-x231