0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2705187-1278572921.wbo>
0.00/0.00 c original problem has 160 variables (155 bin, 0 int, 5 impl, 0 cont) and 31 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 8 clqs
0.00/0.00 c (round 2) 0 del vars, 1 del conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 8 clqs
0.00/0.00 c (round 3) 0 del vars, 1 del conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 8 impls, 8 clqs
0.00/0.00 c (round 4) 0 del vars, 1 del conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 20 upgd conss, 8 impls, 8 clqs
0.00/0.01 c (0.0s) probing: 101/155 (65.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.01 c presolving (5 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 5 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 8 cliques
0.00/0.01 c presolved problem has 160 variables (155 bin, 0 int, 5 impl, 0 cont) and 30 constraints
0.00/0.01 c 8 constraints of type <setppc>
0.00/0.01 c 5 constraints of type <linear>
0.00/0.01 c 5 constraints of type <indicator>
0.00/0.01 c 12 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 1.2.1.3
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1790
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 3420
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 0.0s| 1 | 0 | 23 | - | 514k| 0 | 0 | 160 | 30 | 160 | 20 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 85 | - | 517k| 0 | 0 | 160 | 30 | 160 | 24 | 4 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 99 | - | 518k| 0 | 0 | 160 | 30 | 160 | 25 | 5 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 2 | 99 | - | 519k| 0 | 0 | 160 | 30 | 160 | 25 | 5 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 o 35
0.00/0.02 c * 0.0s| 6 | 0 | 106 | 1.4 | 526k| 4 | - | 160 | 31 | 160 | 25 | 5 | 1 | 0 | 3.500000e+01 | 3.500000e+01 | 0.00%
0.00/0.02 c
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time (sec) : 0.02
0.00/0.02 c Solving Nodes : 6
0.00/0.02 c Primal Bound : +3.50000000000000e+01 (1 solutions)
0.00/0.02 c Dual Bound : +3.50000000000000e+01
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129
0.00/0.02 v -x128 -x127 -x126 -x125 -x124 -x123 x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108
0.00/0.02 v -x107 -x106 -x105 x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 x86 -x85 -x84
0.00/0.02 v -x83 -x82 -x81 -x80 -x79 -x78 x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59
0.00/0.02 v -x58 -x57 -x56 -x55 -x54 -x53 x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 -x34 -x33
0.00/0.02 v -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 -x7
0.00/0.02 v -x6 -x5 -x4 -x3 x2 -x1
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time : 0.02
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-2705187-1278572921.wbo
0.00/0.02 c Variables : 160 (155 binary, 0 integer, 5 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 31 initial, 31 maximal
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-2705187-1278572921.wbo
0.00/0.02 c Variables : 160 (155 binary, 0 integer, 5 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 30 initial, 31 maximal
0.00/0.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.02 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c setppc : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c linear : 0.00 0 0 0 5 0 1 0 0
0.00/0.02 c indicator : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c root node : - 0 - - 0 - - - -
0.00/0.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.02 c integral : 0 0 0 5 0 0 0 0 0 0
0.00/0.02 c setppc : 8 3 212 5 0 0 0 0 0 0
0.00/0.02 c linear : 5 3 212 5 0 0 0 5 0 0
0.00/0.02 c indicator : 5 0 212 5 0 0 3 0 0 0
0.00/0.02 c logicor : 12 3 75 5 0 0 0 0 0 0
0.00/0.02 c bounddisjunction : 0+ 0 1 0 0 0 1 0 0 0
0.00/0.02 c countsols : 0 0 0 5 0 0 0 0 0 0
0.00/0.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.02 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c setppc : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c linear : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c indicator : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Propagators : Time Calls Cutoffs DomReds
0.00/0.02 c vbounds : 0.00 6 0 2
0.00/0.02 c rootredcost : 0.00 0 0 0
0.00/0.02 c pseudoobj : 0.00 13 0 0
0.00/0.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c infeasible LP : 0.00 1 1 1 2.0 0 0.0 0
0.00/0.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c applied globally : - - - 1 2.0 - - -
0.00/0.02 c applied locally : - - - 0 0.0 - - -
0.00/0.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.02 c redcost : 0.00 7 0 0 0 0
0.00/0.02 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.02 c intobj : 0.00 0 0 0 0 0
0.00/0.02 c cgmip : 0.00 0 0 0 0 0
0.00/0.02 c gomory : 0.00 0 0 0 0 0
0.00/0.02 c strongcg : 0.00 0 0 0 0 0
0.00/0.02 c cmir : 0.00 0 0 0 0 0
0.00/0.02 c flowcover : 0.00 0 0 0 0 0
0.00/0.02 c clique : 0.00 0 0 0 0 0
0.00/0.02 c zerohalf : 0.00 0 0 0 0 0
0.00/0.02 c mcf : 0.00 0 0 0 0 0
0.00/0.02 c rapidlearning : 0.01 1 0 0 0 0
0.00/0.02 c Pricers : Time Calls Vars
0.00/0.02 c problem variables: 0.00 0 0
0.00/0.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.02 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.02 c pscost : 0.00 0 0 0 0 0 0
0.00/0.02 c inference : 0.00 4 0 0 0 0 8
0.00/0.02 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.02 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.02 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.02 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.02 c random : 0.00 0 0 0 0 0 0
0.00/0.02 c Primal Heuristics : Time Calls Found
0.00/0.02 c LP solutions : 0.00 - 1
0.00/0.02 c pseudo solutions : 0.00 - 0
0.00/0.02 c oneopt : 0.00 0 0
0.00/0.02 c crossover : 0.00 0 0
0.00/0.02 c coefdiving : 0.00 0 0
0.00/0.02 c pscostdiving : 0.00 0 0
0.00/0.02 c fracdiving : 0.00 0 0
0.00/0.02 c trivial : 0.00 2 0
0.00/0.02 c simplerounding : 0.00 0 0
0.00/0.02 c zirounding : 0.00 0 0
0.00/0.02 c rounding : 0.00 0 0
0.00/0.02 c shifting : 0.00 0 0
0.00/0.02 c intshifting : 0.00 0 0
0.00/0.02 c twoopt : 0.00 0 0
0.00/0.02 c fixandinfer : 0.00 0 0
0.00/0.02 c feaspump : 0.00 0 0
0.00/0.02 c veclendiving : 0.00 0 0
0.00/0.02 c intdiving : 0.00 0 0
0.00/0.02 c actconsdiving : 0.00 0 0
0.00/0.02 c objpscostdiving : 0.00 0 0
0.00/0.02 c rootsoldiving : 0.00 0 0
0.00/0.02 c linesearchdiving : 0.00 0 0
0.00/0.02 c guideddiving : 0.00 0 0
0.00/0.02 c octane : 0.00 0 0
0.00/0.02 c rens : 0.00 0 0
0.00/0.02 c rins : 0.00 0 0
0.00/0.02 c localbranching : 0.00 0 0
0.00/0.02 c mutation : 0.00 0 0
0.00/0.02 c dins : 0.00 0 0
0.00/0.02 c undercover : 0.00 0 0
0.00/0.02 c nlp : 0.00 0 0
0.00/0.02 c trysol : 0.00 0 0
0.00/0.02 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.02 c primal LP : 0.00 0 0 0.00 -
0.00/0.02 c dual LP : 0.00 6 106 17.67 -
0.00/0.02 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.02 c barrier LP : 0.00 0 0 0.00 -
0.00/0.02 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.02 c strong branching : 0.00 0 0 0.00 -
0.00/0.02 c (at root node) : - 0 0 0.00 -
0.00/0.02 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.02 c B&B Tree :
0.00/0.02 c number of runs : 1
0.00/0.02 c nodes : 6
0.00/0.02 c nodes (total) : 6
0.00/0.02 c nodes left : 0
0.00/0.02 c max depth : 4
0.00/0.02 c max depth (total): 4
0.00/0.02 c backtracks : 0 (0.0%)
0.00/0.02 c delayed cutoffs : 0
0.00/0.02 c repropagations : 2 (2 domain reductions, 0 cutoffs)
0.00/0.02 c avg switch length: 2.33
0.00/0.02 c switching time : 0.00
0.00/0.02 c Solution :
0.00/0.02 c Solutions found : 1 (1 improvements)
0.00/0.02 c First Solution : +3.50000000000000e+01 (in run 1, after 6 nodes, 0.02 seconds, depth 4, found by <relaxation>)
0.00/0.02 c Primal Bound : +3.50000000000000e+01 (in run 1, after 6 nodes, 0.02 seconds, depth 4, found by <relaxation>)
0.00/0.02 c Dual Bound : +3.50000000000000e+01
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Root Dual Bound : +0.00000000000000e+00
0.00/0.02 c Root Iterations : 99
0.00/0.02 c Time complete: 0.02.