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-3488292-1307778264.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, 1704 impls, 0 clqs
0.00/0.01 c (round 2) 23 del vars, 19 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 39 chg coeffs, 0 upgd conss, 2443 impls, 0 clqs
0.00/0.01 c (round 3) 33 del vars, 37 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 11 upgd conss, 3003 impls, 0 clqs
0.00/0.01 c (round 4) 43 del vars, 55 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 55 chg coeffs, 11 upgd conss, 3483 impls, 0 clqs
0.00/0.01 c (round 5) 53 del vars, 72 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 63 chg coeffs, 11 upgd conss, 3883 impls, 0 clqs
0.00/0.01 c (round 6) 63 del vars, 89 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 71 chg coeffs, 11 upgd conss, 4203 impls, 0 clqs
0.00/0.01 c (round 7) 73 del vars, 106 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 79 chg coeffs, 11 upgd conss, 4443 impls, 0 clqs
0.00/0.01 c (round 8) 83 del vars, 123 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 87 chg coeffs, 11 upgd conss, 4603 impls, 0 clqs
0.00/0.02 c (round 9) 93 del vars, 140 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 95 chg coeffs, 11 upgd conss, 4683 impls, 0 clqs
0.00/0.02 c (round 10) 103 del vars, 157 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 103 chg coeffs, 11 upgd conss, 4683 impls, 0 clqs
0.00/0.02 c (0.0s) probing: 169/257 (65.8%) - 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 (11 rounds):
0.00/0.02 c 103 deleted vars, 157 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 103 changed coefficients
0.00/0.02 c 4719 implications, 0 cliques
0.00/0.02 c presolved problem has 257 variables (257 bin, 0 int, 0 impl, 0 cont) and 170 constraints
0.00/0.02 c 142 constraints of type <and>
0.00/0.02 c 9 constraints of type <linear>
0.00/0.02 c 10 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: 2)
0.00/0.02 c Presolving Time: 0.02
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.03 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.03 c 0.0s| 1 | 0 | 46 | - |1430k| 0 | 32 | 257 | 175 | 257 | 303 | 0 | 5 | 0 | 3.000000e+00 | -- | Inf
0.00/0.05 o 3
0.00/0.05 c U 0.1s| 1 | 0 | 368 | - |1449k| 0 | - | 257 | 175 | 257 | 303 | 0 | 5 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.06 c 0.1s| 1 | 0 | 368 | - |1444k| 0 | - | 257 | 175 | 257 | 303 | 0 | 5 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.06 c
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time (sec) : 0.06
0.00/0.06 c Solving Nodes : 1
0.00/0.06 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.00/0.06 c Dual Bound : +3.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 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.06 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.06 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.06 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 -x35
0.00/0.06 v -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 x7 x6 -x5
0.00/0.06 v -x4 -x3 x2 x1
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Total Time : 0.06
0.00/0.06 c solving : 0.06
0.00/0.06 c presolving : 0.02 (included in solving)
0.00/0.06 c reading : 0.00 (included in solving)
0.00/0.06 c Original Problem :
0.00/0.06 c Problem name : HOME/instance-3488292-1307778264.opb
0.00/0.06 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 253 initial, 253 maximal
0.00/0.06 c Presolved Problem :
0.00/0.06 c Problem name : t_HOME/instance-3488292-1307778264.opb
0.00/0.06 c Variables : 257 (257 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 170 initial, 175 maximal
0.00/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c setppc : 0.00 0 0 0 0 0 1 0 0 0
0.00/0.06 c and : 0.01 18 73 0 0 0 73 0 0 73
0.00/0.06 c linear : 0.00 2 10 0 0 0 0 0 0 30
0.00/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c pseudoboolean : 0.00 0 0 0 0 0 83 0 0 0
0.00/0.06 c root node : - 0 - - 0 - - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.00/0.06 c and : 142 0 509 0 0 0 384 0 0 0 0 0
0.00/0.06 c linear : 9 0 509 0 0 4 209 2 0 0 0 0
0.00/0.06 c logicor : 10+ 0 121 0 0 1 28 13 0 0 0 0
0.00/0.06 c pseudoboolean : 9 0 0 0 0 1 0 0 0 0 0 0
0.00/0.06 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c pseudoboolean : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.06 c vbounds : 0 0 0 0
0.00/0.06 c rootredcost : 0 0 0 0
0.00/0.06 c pseudoobj : 156 0 0 0
0.00/0.06 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.06 c vbounds : 0.00 0.00 0.00
0.00/0.06 c rootredcost : 0.00 0.00 0.00
0.00/0.06 c pseudoobj : 0.00 0.00 0.00
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.00 15 4 81 89.2 1 21.0 -
0.00/0.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c applied globally : - - - 5 27.0 - - -
0.00/0.06 c applied locally : - - - 0 0.0 - - -
0.00/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.06 c redcost : 0.00 0 0 0 0 0
0.00/0.06 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 0.00 0 0 0 0 0
0.00/0.06 c cgmip : 0.00 0 0 0 0 0
0.00/0.06 c closecuts : 0.00 0 0 0 0 0
0.00/0.06 c strongcg : 0.00 0 0 0 0 0
0.00/0.06 c cmir : 0.00 0 0 0 0 0
0.00/0.06 c flowcover : 0.00 0 0 0 0 0
0.00/0.06 c clique : 0.00 0 0 0 0 0
0.00/0.06 c zerohalf : 0.00 0 0 0 0 0
0.00/0.06 c mcf : 0.00 0 0 0 0 0
0.00/0.06 c oddcycle : 0.00 0 0 0 0 0
0.00/0.06 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.06 c Pricers : Time Calls Vars
0.00/0.06 c problem variables: 0.00 0 0
0.00/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.06 c pscost : 0.00 0 0 0 0 0 0
0.00/0.06 c inference : 0.00 0 0 0 0 0 0
0.00/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c random : 0.00 0 0 0 0 0 0
0.00/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.06 c Primal Heuristics : Time Calls Found
0.00/0.06 c LP solutions : 0.00 - 0
0.00/0.06 c pseudo solutions : 0.00 - 0
0.00/0.06 c oneopt : 0.00 0 0
0.00/0.06 c trivial : 0.00 2 0
0.00/0.06 c shiftandpropagate: 0.00 1 0
0.00/0.06 c simplerounding : 0.00 0 0
0.00/0.06 c zirounding : 0.00 0 0
0.00/0.06 c rounding : 0.00 1 0
0.00/0.06 c shifting : 0.00 1 0
0.00/0.06 c intshifting : 0.00 0 0
0.00/0.06 c twoopt : 0.00 0 0
0.00/0.06 c fixandinfer : 0.00 0 0
0.00/0.06 c feaspump : 0.00 1 0
0.00/0.06 c clique : 0.00 0 0
0.00/0.06 c coefdiving : 0.00 0 0
0.00/0.06 c pscostdiving : 0.00 0 0
0.00/0.06 c fracdiving : 0.00 0 0
0.00/0.06 c veclendiving : 0.00 0 0
0.00/0.06 c intdiving : 0.00 0 0
0.00/0.06 c actconsdiving : 0.00 0 0
0.00/0.06 c objpscostdiving : 0.00 0 0
0.00/0.06 c rootsoldiving : 0.00 0 0
0.00/0.06 c linesearchdiving : 0.00 0 0
0.00/0.06 c guideddiving : 0.00 0 0
0.00/0.06 c octane : 0.00 0 0
0.00/0.06 c rens : 0.00 0 0
0.00/0.06 c rins : 0.00 0 0
0.00/0.06 c localbranching : 0.00 0 0
0.00/0.06 c mutation : 0.00 0 0
0.00/0.06 c crossover : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c vbounds : 0.00 0 0
0.00/0.06 c undercover : 0.03 1 1
0.00/0.06 c subnlp : 0.00 0 0
0.00/0.06 c trysol : 0.00 0 0
0.00/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.06 c primal LP : 0.00 0 0 0.00 -
0.00/0.06 c dual LP : 0.00 1 46 46.00 -
0.00/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.06 c barrier LP : 0.00 0 0 0.00 -
0.00/0.06 c diving/probing LP: 0.00 11 322 29.27 -
0.00/0.06 c strong branching : 0.00 0 0 0.00 -
0.00/0.06 c (at root node) : - 0 0 0.00 -
0.00/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.06 c B&B Tree :
0.00/0.06 c number of runs : 1
0.00/0.06 c nodes : 1
0.00/0.06 c nodes (total) : 1
0.00/0.06 c nodes left : 0
0.00/0.06 c max depth : 0
0.00/0.06 c max depth (total): 0
0.00/0.06 c backtracks : 0 (0.0%)
0.00/0.06 c delayed cutoffs : 0
0.00/0.06 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.06 c avg switch length: 2.00
0.00/0.06 c switching time : 0.00
0.00/0.06 c Solution :
0.00/0.06 c Solutions found : 1 (1 improvements)
0.00/0.06 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <undercover>)
0.00/0.06 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <undercover>)
0.00/0.06 c Dual Bound : +3.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +3.00000000000000e+00
0.00/0.06 c Root Iterations : 368
0.00/0.06 c Time complete: 0.06.