0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1870191-1245189505.opb>
0.00/0.01 c original problem has 270 variables (270 bin, 0 int, 0 impl, 0 cont) and 191 constraints
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1000 impls, 0 clqs
0.00/0.03 c (round 2) 17 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 34 chg coeffs, 6 upgd conss, 1480 impls, 0 clqs
0.00/0.03 c (round 3) 29 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 6 upgd conss, 1840 impls, 0 clqs
0.00/0.03 c (round 4) 41 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 6 upgd conss, 2080 impls, 0 clqs
0.00/0.03 c (round 5) 53 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 6 upgd conss, 2200 impls, 0 clqs
0.00/0.03 c (round 6) 65 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 6 upgd conss, 2200 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 147/205 (71.7%) - 0 fixings, 0 aggregations, 10 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c presolving (7 rounds):
0.00/0.05 c 65 deleted vars, 50 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 74 changed coefficients
0.00/0.05 c 2220 implications, 0 cliques
0.00/0.05 c presolved problem has 205 variables (205 bin, 0 int, 0 impl, 0 cont) and 136 constraints
0.00/0.05 c 125 constraints of type <and>
0.00/0.05 c 5 constraints of type <linear>
0.00/0.05 c 6 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 2)
0.00/0.05 c Presolving Time: 0.02
0.00/0.05 c OPT-NLC
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = c 1620
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = c 1791
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = c 10000
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving problem
0.00/0.05 c
0.00/0.05 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.05 c 0.0s| 1 | 0 | 14 | 988k| 0 | 8 | 205 | 136 | 136 | 205 | 261 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 238 |1010k| 0 | 13 | 205 | 136 | 136 | 205 | 268 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
0.00/0.09 c 0.1s| 1 | 0 | 258 |1033k| 0 | 28 | 205 | 136 | 136 | 205 | 277 | 16 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 294 |1076k| 0 | 37 | 205 | 136 | 136 | 205 | 288 | 27 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 339 |1111k| 0 | 70 | 205 | 136 | 136 | 205 | 302 | 41 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 370 |1141k| 0 | 62 | 205 | 136 | 136 | 205 | 321 | 60 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 443 |1171k| 0 | 71 | 205 | 136 | 136 | 205 | 335 | 74 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.39 c 0.4s| 1 | 2 | 443 |1171k| 0 | 71 | 205 | 136 | 136 | 205 | 335 | 74 | 0 | 19 | 3.000000e+00 | -- | Inf
0.79/0.83 o 3
0.79/0.83 c * 0.8s| 61 | 0 | 1707 |1262k| 31 | - | 205 | 181 | 34 | 205 | 194 | 336 | 45 | 402 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.79/0.83 c
0.79/0.83 c SCIP Status : problem is solved [optimal solution found]
0.79/0.83 c Solving Time (sec) : 0.79
0.79/0.83 c Solving Nodes : 61
0.79/0.83 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.79/0.83 c Dual Bound : +3.00000000000000e+00
0.79/0.83 c Gap : 0.00 %
0.79/0.83 c NODE 61
0.79/0.83 c DUAL BOUND 3
0.79/0.83 c PRIMAL BOUND 3
0.79/0.83 c GAP 0
0.79/0.83 s OPTIMUM FOUND
0.79/0.83 v -x90 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82 -x81 -x80 x79 -x60 -x59 -x58 -x57 -x56 x55 x78 -x77 -x76 -x75 x74 -x73 x54 -x53 -x52
0.79/0.83 v -x51 -x50 x49 x72 -x71 -x70 -x69 x68 -x67 x48 -x47 x46 x45 x44 x43 -x66 -x65 -x64 -x63 -x62 -x61 x42 x41 x40 -x39 -x38 x37
0.79/0.83 v -x36 x35 x34 x33 -x32 x31 x30 -x29 -x28 -x27 -x26 x25 x24 -x23 x22 x21 x20 x19 x18 -x17 -x16 x15 x14 x13 -x12 x11 -x10 -x9 x8
0.79/0.83 v x7 -x6 -x5 -x4 -x3 x2 x1
0.79/0.83 c SCIP Status : problem is solved [optimal solution found]
0.79/0.83 c Solving Time : 0.79
0.79/0.83 c Original Problem :
0.79/0.83 c Problem name : HOME/instance-1870191-1245189505.opb
0.79/0.83 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.83 c Constraints : 191 initial, 191 maximal
0.79/0.83 c Presolved Problem :
0.79/0.83 c Problem name : t_HOME/instance-1870191-1245189505.opb
0.79/0.83 c Variables : 205 (205 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.83 c Constraints : 136 initial, 181 maximal
0.79/0.83 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.79/0.83 c trivial : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c implics : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c probing : 0.01 0 0 0 0 0 0 0 0
0.79/0.83 c and : 0.00 10 50 0 0 0 50 0 50
0.79/0.83 c linear : 0.00 1 4 0 0 0 0 0 24
0.79/0.83 c logicor : 0.01 0 0 0 0 0 0 0 0
0.79/0.83 c root node : - 0 - - 0 - - - -
0.79/0.83 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.79/0.83 c integral : 0 0 0 64 0 2 29 0 0 94
0.79/0.83 c and : 125 156 487 1 0 5 248 295 0 0
0.79/0.83 c linear : 5 6 482 1 0 10 99 0 0 0
0.79/0.83 c logicor : 6+ 6 121 1 0 6 10 0 0 0
0.79/0.83 c countsols : 0 0 0 1 0 0 0 0 0 0
0.79/0.83 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.79/0.83 c integral : 0.39 0.00 0.00 0.39 0.00
0.79/0.83 c and : 0.00 0.00 0.00 0.00 0.00
0.79/0.83 c linear : 0.00 0.00 0.00 0.00 0.00
0.79/0.83 c logicor : 0.00 0.00 0.00 0.00 0.00
0.79/0.83 c countsols : 0.00 0.00 0.00 0.00 0.00
0.79/0.83 c Propagators : Time Calls Cutoffs DomReds
0.79/0.83 c rootredcost : 0.00 0 0 0
0.79/0.83 c pseudoobj : 0.00 186 0 0
0.79/0.83 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.83 c propagation : 0.00 21 21 104 25.4 17 12.7 -
0.79/0.83 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
0.79/0.83 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.83 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.83 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.83 c applied globally : - - - 45 14.1 - - -
0.79/0.83 c applied locally : - - - 0 0.0 - - -
0.79/0.83 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.83 c cut pool : 0.00 5 - - 27 - (maximal pool size: 151)
0.79/0.83 c redcost : 0.00 156 0 0 0 0
0.79/0.83 c impliedbounds : 0.00 6 0 0 26 0
0.79/0.83 c intobj : 0.00 0 0 0 0 0
0.79/0.83 c gomory : 0.06 6 0 0 31 0
0.79/0.83 c strongcg : 0.03 6 0 0 149 0
0.79/0.83 c cmir : 0.01 6 0 0 67 0
0.79/0.83 c flowcover : 0.05 6 0 0 103 0
0.79/0.83 c clique : 0.00 1 0 0 0 0
0.79/0.83 c zerohalf : 0.00 0 0 0 0 0
0.79/0.83 c mcf : 0.00 1 0 0 0 0
0.79/0.83 c Pricers : Time Calls Vars
0.79/0.83 c problem variables: 0.00 0 0
0.79/0.83 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.83 c relpscost : 0.39 63 2 29 0 0 94
0.79/0.83 c pscost : 0.00 0 0 0 0 0 0
0.79/0.83 c inference : 0.00 0 0 0 0 0 0
0.79/0.83 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.83 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.83 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.83 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.83 c random : 0.00 0 0 0 0 0 0
0.79/0.83 c Primal Heuristics : Time Calls Found
0.79/0.83 c LP solutions : 0.00 - 1
0.79/0.83 c pseudo solutions : 0.00 - 0
0.79/0.83 c oneopt : 0.00 0 0
0.79/0.83 c rootsoldiving : 0.00 0 0
0.79/0.83 c linesearchdiving : 0.00 0 0
0.79/0.83 c guideddiving : 0.00 0 0
0.79/0.83 c crossover : 0.00 0 0
0.79/0.83 c intshifting : 0.00 0 0
0.79/0.83 c coefdiving : 0.00 1 0
0.79/0.83 c pscostdiving : 0.00 1 0
0.79/0.83 c fracdiving : 0.00 1 0
0.79/0.83 c veclendiving : 0.00 1 0
0.79/0.83 c feaspump : 0.01 1 0
0.79/0.83 c objpscostdiving : 0.01 1 0
0.79/0.83 c simplerounding : 0.00 0 0
0.79/0.83 c rounding : 0.00 128 0
0.79/0.83 c shifting : 0.01 28 0
0.79/0.83 c fixandinfer : 0.00 0 0
0.79/0.83 c intdiving : 0.00 0 0
0.79/0.83 c actconsdiving : 0.00 0 0
0.79/0.83 c octane : 0.00 0 0
0.79/0.83 c rens : 0.03 1 0
0.79/0.83 c rins : 0.00 0 0
0.79/0.83 c localbranching : 0.00 0 0
0.79/0.83 c mutation : 0.00 0 0
0.79/0.83 c dins : 0.00 0 0
0.79/0.83 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.83 c primal LP : 0.04 0 0 0.00 0.00
0.79/0.83 c dual LP : 0.11 165 1460 8.85 13272.73
0.79/0.83 c barrier LP : 0.00 0 0 0.00 -
0.79/0.83 c diving/probing LP: 0.02 20 247 12.35 12350.00
0.79/0.83 c strong branching : 0.39 402 5831 14.50 14951.28
0.79/0.83 c (at root node) : - 19 1277 67.21 -
0.79/0.83 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.83 c B&B Tree :
0.79/0.83 c number of runs : 1
0.79/0.83 c nodes : 61
0.79/0.83 c nodes (total) : 61
0.79/0.83 c nodes left : 0
0.79/0.83 c max depth : 31
0.79/0.83 c max depth (total): 31
0.79/0.83 c backtracks : 4 (6.6%)
0.79/0.83 c delayed cutoffs : 1
0.79/0.83 c repropagations : 6 (25 domain reductions, 1 cutoffs)
0.79/0.83 c avg switch length: 2.10
0.79/0.83 c switching time : 0.04
0.79/0.83 c Solution :
0.79/0.83 c Solutions found : 1 (1 improvements)
0.79/0.83 c Primal Bound : +3.00000000000000e+00 (in run 1, after 61 nodes, 0.79 seconds, depth 26, found by <relaxation>)
0.79/0.83 c Dual Bound : +3.00000000000000e+00
0.79/0.83 c Gap : 0.00 %
0.79/0.83 c Root Dual Bound : +3.00000000000000e+00
0.79/0.84 c Time complete: 0.84.