0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3488403-1307778369.opb>
0.00/0.00 c original problem has 360 variables (360 bin, 0 int, 0 impl, 0 cont) and 253 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.01 c (round 1) 10 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1776 impls, 0 clqs
0.00/0.01 c (round 2) 21 del vars, 17 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 2 upgd conss, 1844 impls, 0 clqs
0.00/0.01 c (round 3) 40 del vars, 39 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 4 upgd conss, 1938 impls, 0 clqs
0.00/0.01 c (round 4) 55 del vars, 63 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 51 chg coeffs, 8 upgd conss, 1990 impls, 0 clqs
0.00/0.01 c (round 5) 70 del vars, 87 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 10 upgd conss, 2034 impls, 0 clqs
0.00/0.01 c (round 6) 85 del vars, 109 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 65 chg coeffs, 12 upgd conss, 2070 impls, 0 clqs
0.00/0.01 c (round 7) 100 del vars, 131 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 14 upgd conss, 2098 impls, 0 clqs
0.00/0.01 c (round 8) 115 del vars, 153 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 79 chg coeffs, 16 upgd conss, 2118 impls, 0 clqs
0.00/0.01 c (round 9) 130 del vars, 175 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 18 upgd conss, 2130 impls, 0 clqs
0.00/0.01 c (round 10) 144 del vars, 198 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 93 chg coeffs, 20 upgd conss, 2130 impls, 0 clqs
0.00/0.01 c (round 11) 148 del vars, 203 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 93 chg coeffs, 29 upgd conss, 2130 impls, 0 clqs
0.00/0.02 c (0.0s) probing: 160/212 (75.5%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.02 c presolving (12 rounds):
0.00/0.02 c 148 deleted vars, 203 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 93 changed coefficients
0.00/0.02 c 2166 implications, 0 cliques
0.00/0.02 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 133 constraints
0.00/0.02 c 106 constraints of type <and>
0.00/0.02 c 9 constraints of type <linear>
0.00/0.02 c 9 constraints of type <logicor>
0.00/0.02 c 9 constraints of type <pseudoboolean>
0.00/0.02 c transformed objective value is always integral (scale: 4)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.0.1.5
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 36 | - |1271k| 0 | 26 | 212 | 141 | 212 | 230 | 0 | 8 | 0 | 2.000000e+00 | -- | Inf
0.00/0.04 o 2
0.00/0.04 c U 0.0s| 1 | 0 | 247 | - |1288k| 0 | - | 212 | 141 | 212 | 230 | 0 | 8 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.05 c 0.1s| 1 | 0 | 247 | - |1284k| 0 | - | 212 | 141 | 212 | 230 | 0 | 8 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.05 c
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Solving Time (sec) : 0.05
0.00/0.05 c Solving Nodes : 1
0.00/0.05 c Primal Bound : +2.00000000000000e+00 (1 solutions)
0.00/0.05 c Dual Bound : +2.00000000000000e+00
0.00/0.05 c Gap : 0.00 %
0.00/0.05 s OPTIMUM FOUND
0.00/0.05 v -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 x126 -x90 -x89 -x88 x87 -x86 -x125 -x124 -x123 x122 x121 -x85 -x84 -x83 x82
0.00/0.05 v -x81 -x120 x119 -x118 -x117 -x116 -x80 x79 x78 x77 -x76 -x115 -x114 -x113 x112 x111 x75 x74 x73 x72 -x71 -x110 -x109 -x108
0.00/0.05 v x107 x106 -x70 x69 x68 x67 -x66 -x105 -x104 -x103 -x102 -x101 -x65 x64 -x63 x62 -x61 -x100 -x99 -x98 -x97 x96 -x60 -x59 -x58
0.00/0.05 v x57 -x56 -x95 -x94 -x93 -x92 x91 -x55 -x54 -x53 x52 -x51 -x50 -x49 x48 x47 x46 x45 -x44 -x43 -x42 x41 -x40 -x39 x38 x37 x36
0.00/0.05 v -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.00/0.05 v -x7 x6 -x5 -x4 -x3 x2 -x1
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Total Time : 0.05
0.00/0.05 c solving : 0.05
0.00/0.05 c presolving : 0.01 (included in solving)
0.00/0.05 c reading : 0.00 (included in solving)
0.00/0.05 c Original Problem :
0.00/0.05 c Problem name : HOME/instance-3488403-1307778369.opb
0.00/0.05 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 253 initial, 253 maximal
0.00/0.05 c Presolved Problem :
0.00/0.05 c Problem name : t_HOME/instance-3488403-1307778369.opb
0.00/0.05 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 133 initial, 141 maximal
0.00/0.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.05 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c dualfix : 0.00 9 0 0 0 0 0 0 0 0
0.00/0.05 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c setppc : 0.00 9 0 0 0 0 20 0 0 0
0.00/0.05 c and : 0.00 45 63 0 0 0 63 0 0 63
0.00/0.05 c linear : 0.00 3 19 0 0 0 1 0 0 30
0.00/0.05 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c pseudoboolean : 0.00 0 0 0 0 0 119 0 0 0
0.00/0.05 c root node : - 0 - - 0 - - - - -
0.00/0.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.05 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.00/0.05 c and : 106 0 439 0 0 0 96 0 0 0 0 0
0.00/0.05 c linear : 9 0 453 0 0 4 64 0 0 0 0 0
0.00/0.05 c logicor : 9+ 0 112 0 0 2 0 8 0 0 0 0
0.00/0.05 c pseudoboolean : 9 0 0 0 0 1 0 0 0 0 0 0
0.00/0.05 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.05 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c pseudoboolean : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.05 c vbounds : 0 0 0 0
0.00/0.05 c rootredcost : 0 0 0 0
0.00/0.05 c pseudoobj : 118 0 0 0
0.00/0.05 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.05 c vbounds : 0.00 0.00 0.00
0.00/0.05 c rootredcost : 0.00 0.00 0.00
0.00/0.05 c pseudoobj : 0.00 0.00 0.00
0.00/0.05 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.05 c propagation : 0.00 8 8 32 14.8 0 0.0 -
0.00/0.05 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.00/0.05 c applied globally : - - - 8 7.0 - - -
0.00/0.05 c applied locally : - - - 0 0.0 - - -
0.00/0.05 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.05 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.05 c redcost : 0.00 0 0 0 0 0
0.00/0.05 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.05 c intobj : 0.00 0 0 0 0 0
0.00/0.05 c gomory : 0.00 0 0 0 0 0
0.00/0.05 c cgmip : 0.00 0 0 0 0 0
0.00/0.05 c closecuts : 0.00 0 0 0 0 0
0.00/0.05 c strongcg : 0.00 0 0 0 0 0
0.00/0.05 c cmir : 0.00 0 0 0 0 0
0.00/0.05 c flowcover : 0.00 0 0 0 0 0
0.00/0.05 c clique : 0.00 0 0 0 0 0
0.00/0.05 c zerohalf : 0.00 0 0 0 0 0
0.00/0.05 c mcf : 0.00 0 0 0 0 0
0.00/0.05 c oddcycle : 0.00 0 0 0 0 0
0.00/0.05 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.05 c Pricers : Time Calls Vars
0.00/0.05 c problem variables: 0.00 0 0
0.00/0.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.05 c pscost : 0.00 0 0 0 0 0 0
0.00/0.05 c inference : 0.00 0 0 0 0 0 0
0.00/0.05 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.05 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.05 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c random : 0.00 0 0 0 0 0 0
0.00/0.05 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.05 c Primal Heuristics : Time Calls Found
0.00/0.05 c LP solutions : 0.00 - 0
0.00/0.05 c pseudo solutions : 0.00 - 0
0.00/0.05 c oneopt : 0.00 0 0
0.00/0.05 c trivial : 0.00 2 0
0.00/0.05 c shiftandpropagate: 0.00 1 0
0.00/0.05 c simplerounding : 0.00 0 0
0.00/0.05 c zirounding : 0.00 0 0
0.00/0.05 c rounding : 0.00 1 0
0.00/0.05 c shifting : 0.00 1 0
0.00/0.05 c intshifting : 0.00 0 0
0.00/0.05 c twoopt : 0.00 0 0
0.00/0.05 c fixandinfer : 0.00 0 0
0.00/0.05 c feaspump : 0.00 1 0
0.00/0.05 c clique : 0.00 0 0
0.00/0.05 c coefdiving : 0.00 0 0
0.00/0.05 c pscostdiving : 0.00 0 0
0.00/0.05 c fracdiving : 0.00 0 0
0.00/0.05 c veclendiving : 0.00 0 0
0.00/0.05 c intdiving : 0.00 0 0
0.00/0.05 c actconsdiving : 0.00 0 0
0.00/0.05 c objpscostdiving : 0.00 0 0
0.00/0.05 c rootsoldiving : 0.00 0 0
0.00/0.05 c linesearchdiving : 0.00 0 0
0.00/0.05 c guideddiving : 0.00 0 0
0.00/0.05 c octane : 0.00 0 0
0.00/0.05 c rens : 0.00 0 0
0.00/0.05 c rins : 0.00 0 0
0.00/0.05 c localbranching : 0.00 0 0
0.00/0.05 c mutation : 0.00 0 0
0.00/0.05 c crossover : 0.00 0 0
0.00/0.05 c dins : 0.00 0 0
0.00/0.05 c vbounds : 0.00 0 0
0.00/0.05 c undercover : 0.03 1 1
0.00/0.05 c subnlp : 0.00 0 0
0.00/0.05 c trysol : 0.00 0 0
0.00/0.05 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.05 c primal LP : 0.00 0 0 0.00 -
0.00/0.05 c dual LP : 0.00 1 36 36.00 -
0.00/0.05 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.05 c barrier LP : 0.00 0 0 0.00 -
0.00/0.05 c diving/probing LP: 0.00 10 211 21.10 -
0.00/0.05 c strong branching : 0.00 0 0 0.00 -
0.00/0.05 c (at root node) : - 0 0 0.00 -
0.00/0.05 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.05 c B&B Tree :
0.00/0.05 c number of runs : 1
0.00/0.05 c nodes : 1
0.00/0.05 c nodes (total) : 1
0.00/0.05 c nodes left : 0
0.00/0.05 c max depth : 0
0.00/0.05 c max depth (total): 0
0.00/0.05 c backtracks : 0 (0.0%)
0.00/0.05 c delayed cutoffs : 0
0.00/0.05 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.05 c avg switch length: 2.00
0.00/0.05 c switching time : 0.00
0.00/0.05 c Solution :
0.00/0.05 c Solutions found : 1 (1 improvements)
0.00/0.05 c First Solution : +2.00000000000000e+00 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <undercover>)
0.00/0.05 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <undercover>)
0.00/0.05 c Dual Bound : +2.00000000000000e+00
0.00/0.05 c Gap : 0.00 %
0.00/0.05 c Root Dual Bound : +2.00000000000000e+00
0.00/0.05 c Root Iterations : 247
0.00/0.06 c Time complete: 0.05.