0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2702948-1278564324.opb>
0.00/0.01 c original problem has 420 variables (420 bin, 0 int, 0 impl, 0 cont) and 307 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 35 chg coeffs, 0 upgd conss, 1656 impls, 0 clqs
0.00/0.04 c (round 2) 20 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 7 upgd conss, 2496 impls, 0 clqs
0.00/0.04 c (round 3) 34 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 59 chg coeffs, 7 upgd conss, 3168 impls, 0 clqs
0.00/0.04 c (round 4) 48 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 71 chg coeffs, 7 upgd conss, 3672 impls, 0 clqs
0.00/0.04 c (round 5) 62 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 83 chg coeffs, 7 upgd conss, 4008 impls, 0 clqs
0.00/0.05 c (round 6) 76 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 95 chg coeffs, 7 upgd conss, 4176 impls, 0 clqs
0.00/0.05 c (round 7) 90 del vars, 72 del conss, 0 chg bounds, 0 chg sides, 107 chg coeffs, 7 upgd conss, 4176 impls, 0 clqs
0.04/0.06 c (0.1s) probing: 172/330 (52.1%) - 0 fixings, 0 aggregations, 12 implications, 0 bound changes
0.04/0.06 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.04/0.06 c presolving (8 rounds):
0.04/0.06 c 90 deleted vars, 72 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 107 changed coefficients
0.04/0.06 c 4200 implications, 0 cliques
0.04/0.06 c presolved problem has 330 variables (330 bin, 0 int, 0 impl, 0 cont) and 229 constraints
0.04/0.06 c 216 constraints of type <and>
0.04/0.06 c 6 constraints of type <linear>
0.04/0.06 c 7 constraints of type <logicor>
0.04/0.06 c transformed objective value is always integral (scale: 2)
0.04/0.06 c Presolving Time: 0.05
0.04/0.06 c - non default parameters ----------------------------------------------------------------------
0.04/0.06 c # SCIP version 1.2.1.3
0.04/0.06 c
0.04/0.06 c # frequency for displaying node information lines
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.06 c display/freq = 10000
0.04/0.06 c
0.04/0.06 c # maximal time in seconds to run
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/time = 1790
0.04/0.06 c
0.04/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/memory = 1620
0.04/0.06 c
0.04/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.04/0.06 c # [type: int, range: [1,2], default: 1]
0.04/0.06 c timing/clocktype = 2
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify inequalities
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/linear/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/indicator/addCouplingCons = TRUE
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify knapsacks
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c heuristics/undercover/freq = 0
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/rapidlearning/freq = 0
0.04/0.06 c
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c start solving
0.04/0.07 c
0.04/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.07 c 0.1s| 1 | 0 | 16 | - |1592k| 0 | 9 | 330 | 229 | 330 | 445 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.53 o 3
0.49/0.53 c u 0.5s| 1 | 0 | 345 | - |1623k| 0 | - | 330 | 229 | 330 | 445 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.54 c 0.5s| 1 | 0 | 345 | - |1617k| 0 | - | 330 | 229 | 330 | 445 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.54 c
0.49/0.54 c SCIP Status : problem is solved [optimal solution found]
0.49/0.54 c Solving Time (sec) : 0.52
0.49/0.54 c Solving Nodes : 1
0.49/0.54 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.49/0.54 c Dual Bound : +3.00000000000000e+00
0.49/0.54 c Gap : 0.00 %
0.49/0.54 s OPTIMUM FOUND
0.49/0.54 v -x126 -x125 x124 -x123 x122 x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x84 x83 -x82 x81 x80 -x79 x78 -x112 -x111 -x110
0.49/0.54 v -x109 -x108 -x107 -x106 -x77 -x76 -x75 x74 x73 x72 x71 -x105 -x104 -x103 -x102 -x101 x100 -x99 -x70 -x69 -x68 -x67 x66 -x65
0.49/0.54 v x64 -x98 -x97 -x96 -x95 -x94 -x93 -x92 x63 -x62 x61 -x60 x59 x58 x57 -x91 -x90 -x89 -x88 -x87 x86 -x85 -x56 -x55 x54 x53 x52
0.49/0.54 v -x51 x50 x49 -x48 -x47 -x46 -x45 x44 x43 -x42 -x41 -x40 -x39 -x38 x37 x36 -x35 -x34 -x33 -x32 -x31 x30 x29 -x28 -x27 -x26 -x25
0.49/0.54 v -x24 x23 x22 -x21 -x20 -x19 -x18 -x17 x16 x15 x14 -x13 x12 x11 x10 x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.49/0.54 c SCIP Status : problem is solved [optimal solution found]
0.49/0.54 c Solving Time : 0.52
0.49/0.54 c Original Problem :
0.49/0.54 c Problem name : HOME/instance-2702948-1278564324.opb
0.49/0.54 c Variables : 420 (420 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.54 c Constraints : 307 initial, 307 maximal
0.49/0.54 c Presolved Problem :
0.49/0.54 c Problem name : t_HOME/instance-2702948-1278564324.opb
0.49/0.54 c Variables : 330 (330 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.54 c Constraints : 229 initial, 229 maximal
0.49/0.54 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.54 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c probing : 0.01 0 0 0 0 0 0 0 0
0.49/0.54 c and : 0.02 12 72 0 0 0 72 0 72
0.49/0.54 c linear : 0.01 1 5 0 0 0 0 0 35
0.49/0.54 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c root node : - 0 - - 0 - - - -
0.49/0.54 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.54 c integral : 0 0 0 0 0 0 0 0 0 0
0.49/0.54 c and : 216 0 415 0 0 0 0 0 0 0
0.49/0.54 c linear : 6 0 415 0 0 0 0 0 0 0
0.49/0.54 c logicor : 7 0 84 0 0 0 0 0 0 0
0.49/0.54 c countsols : 0 0 0 0 0 0 0 0 0 0
0.49/0.54 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.54 c integral : 0.00 0.00 0.00 0.00 0.00
0.49/0.54 c and : 0.00 0.00 0.00 0.00 0.00
0.49/0.54 c linear : 0.01 0.00 0.01 0.00 0.00
0.49/0.54 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.54 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.54 c Propagators : Time Calls Cutoffs DomReds
0.49/0.54 c vbounds : 0.00 2 0 0
0.49/0.54 c rootredcost : 0.00 0 0 0
0.49/0.54 c pseudoobj : 0.00 62 0 0
0.49/0.54 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.54 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.54 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.54 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.54 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.54 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.54 c applied globally : - - - 0 0.0 - - -
0.49/0.54 c applied locally : - - - 0 0.0 - - -
0.49/0.54 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.54 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.49/0.54 c redcost : 0.00 0 0 0 0 0
0.49/0.54 c impliedbounds : 0.00 0 0 0 0 0
0.49/0.54 c intobj : 0.00 0 0 0 0 0
0.49/0.54 c cgmip : 0.00 0 0 0 0 0
0.49/0.54 c gomory : 0.00 0 0 0 0 0
0.49/0.54 c strongcg : 0.00 0 0 0 0 0
0.49/0.54 c cmir : 0.00 0 0 0 0 0
0.49/0.54 c flowcover : 0.00 0 0 0 0 0
0.49/0.54 c clique : 0.00 0 0 0 0 0
0.49/0.54 c zerohalf : 0.00 0 0 0 0 0
0.49/0.54 c mcf : 0.00 0 0 0 0 0
0.49/0.54 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.54 c Pricers : Time Calls Vars
0.49/0.54 c problem variables: 0.00 0 0
0.49/0.54 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.54 c pscost : 0.00 0 0 0 0 0 0
0.49/0.54 c inference : 0.00 0 0 0 0 0 0
0.49/0.54 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.54 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.54 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.54 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.54 c random : 0.00 0 0 0 0 0 0
0.49/0.54 c relpscost : 0.00 0 0 0 0 0 0
0.49/0.54 c Primal Heuristics : Time Calls Found
0.49/0.54 c LP solutions : 0.00 - 0
0.49/0.54 c pseudo solutions : 0.00 - 0
0.49/0.54 c oneopt : 0.00 0 0
0.49/0.54 c trivial : 0.00 2 0
0.49/0.54 c simplerounding : 0.00 0 0
0.49/0.54 c zirounding : 0.00 0 0
0.49/0.54 c rounding : 0.00 1 0
0.49/0.54 c shifting : 0.00 1 0
0.49/0.54 c intshifting : 0.00 0 0
0.49/0.54 c twoopt : 0.00 0 0
0.49/0.54 c fixandinfer : 0.00 0 0
0.49/0.54 c feaspump : 0.01 1 0
0.49/0.54 c coefdiving : 0.00 0 0
0.49/0.54 c pscostdiving : 0.00 0 0
0.49/0.54 c fracdiving : 0.00 0 0
0.49/0.54 c veclendiving : 0.00 0 0
0.49/0.54 c intdiving : 0.00 0 0
0.49/0.54 c actconsdiving : 0.00 0 0
0.49/0.54 c objpscostdiving : 0.00 0 0
0.49/0.54 c rootsoldiving : 0.00 0 0
0.49/0.54 c linesearchdiving : 0.00 0 0
0.49/0.54 c guideddiving : 0.00 0 0
0.49/0.54 c octane : 0.00 0 0
0.49/0.54 c rens : 0.00 0 0
0.49/0.54 c rins : 0.00 0 0
0.49/0.54 c localbranching : 0.00 0 0
0.49/0.54 c mutation : 0.00 0 0
0.49/0.54 c crossover : 0.00 0 0
0.49/0.54 c dins : 0.00 0 0
0.49/0.54 c undercover : 0.45 1 1
0.49/0.54 c nlp : 0.00 0 0
0.49/0.54 c trysol : 0.00 0 0
0.49/0.54 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.54 c primal LP : 0.00 0 0 0.00 -
0.49/0.54 c dual LP : 0.00 1 16 16.00 -
0.49/0.54 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.54 c barrier LP : 0.00 0 0 0.00 -
0.49/0.54 c diving/probing LP: 0.01 11 329 29.91 25309.64
0.49/0.54 c strong branching : 0.00 0 0 0.00 -
0.49/0.54 c (at root node) : - 0 0 0.00 -
0.49/0.54 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.54 c B&B Tree :
0.49/0.54 c number of runs : 1
0.49/0.54 c nodes : 1
0.49/0.54 c nodes (total) : 1
0.49/0.54 c nodes left : 0
0.49/0.54 c max depth : 0
0.49/0.54 c max depth (total): 0
0.49/0.54 c backtracks : 0 (0.0%)
0.49/0.54 c delayed cutoffs : 0
0.49/0.54 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.54 c avg switch length: 2.00
0.49/0.54 c switching time : 0.00
0.49/0.54 c Solution :
0.49/0.54 c Solutions found : 1 (1 improvements)
0.49/0.54 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.52 seconds, depth 0, found by <undercover>)
0.49/0.54 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.52 seconds, depth 0, found by <undercover>)
0.49/0.54 c Dual Bound : +3.00000000000000e+00
0.49/0.54 c Gap : 0.00 %
0.49/0.54 c Root Dual Bound : +3.00000000000000e+00
0.49/0.54 c Root Iterations : 345
0.49/0.55 c Time complete: 0.54.