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-2703079-1278564448.opb>
0.00/0.01 c original problem has 350 variables (350 bin, 0 int, 0 impl, 0 cont) and 256 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) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1300 impls, 0 clqs
0.00/0.03 c (round 2) 19 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 6 upgd conss, 1972 impls, 0 clqs
0.00/0.03 c (round 3) 33 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 6 upgd conss, 2476 impls, 0 clqs
0.00/0.04 c (round 4) 47 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 66 chg coeffs, 6 upgd conss, 2812 impls, 0 clqs
0.00/0.04 c (round 5) 61 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 78 chg coeffs, 6 upgd conss, 2980 impls, 0 clqs
0.00/0.04 c (round 6) 75 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 90 chg coeffs, 6 upgd conss, 2980 impls, 0 clqs
0.03/0.05 c (0.0s) probing: 156/275 (56.7%) - 0 fixings, 0 aggregations, 10 implications, 0 bound changes
0.03/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.03/0.05 c presolving (7 rounds):
0.03/0.05 c 75 deleted vars, 60 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 90 changed coefficients
0.03/0.05 c 3000 implications, 0 cliques
0.03/0.05 c presolved problem has 275 variables (275 bin, 0 int, 0 impl, 0 cont) and 191 constraints
0.03/0.05 c 180 constraints of type <and>
0.03/0.05 c 5 constraints of type <linear>
0.03/0.05 c 6 constraints of type <logicor>
0.03/0.05 c transformed objective value is always integral (scale: 2)
0.03/0.05 c Presolving Time: 0.04
0.03/0.05 c - non default parameters ----------------------------------------------------------------------
0.03/0.05 c # SCIP version 1.2.1.3
0.03/0.05 c
0.03/0.05 c # frequency for displaying node information lines
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.05 c display/freq = 10000
0.03/0.05 c
0.03/0.05 c # maximal time in seconds to run
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/time = 1790
0.03/0.05 c
0.03/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/memory = 1620
0.03/0.05 c
0.03/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.05 c # [type: int, range: [1,2], default: 1]
0.03/0.05 c timing/clocktype = 2
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify inequalities
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/linear/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/indicator/addCouplingCons = TRUE
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify knapsacks
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c heuristics/undercover/freq = 0
0.03/0.05 c
0.03/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c separating/rapidlearning/freq = 0
0.03/0.05 c
0.03/0.05 c -----------------------------------------------------------------------------------------------
0.03/0.05 c start solving
0.03/0.06 c
0.03/0.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.06 c 0.0s| 1 | 0 | 14 | - |1341k| 0 | 8 | 275 | 191 | 275 | 371 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.49 o 3
0.39/0.49 c u 0.5s| 1 | 0 | 266 | - |1364k| 0 | - | 275 | 191 | 275 | 371 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.49 c 0.5s| 1 | 0 | 266 | - |1359k| 0 | - | 275 | 191 | 275 | 371 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.49 c
0.39/0.49 c SCIP Status : problem is solved [optimal solution found]
0.39/0.49 c Solving Time (sec) : 0.48
0.39/0.49 c Solving Nodes : 1
0.39/0.49 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.39/0.49 c Dual Bound : +3.00000000000000e+00
0.39/0.49 c Gap : 0.00 %
0.39/0.49 s OPTIMUM FOUND
0.39/0.49 v x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 x70 x69 x68 x67 -x66 x65 x64 -x91 -x90 -x89 -x88 -x87
0.39/0.49 v x86 -x85 -x63 x62 -x61 x60 -x59 -x58 x57 -x84 -x83 -x82 -x81 -x80 -x79 -x78 x56 x55 -x54 -x53 -x52 x51 x50 -x77 -x76 -x75 -x74
0.39/0.49 v -x73 -x72 -x71 -x49 x48 -x47 -x46 -x45 -x44 x43 x42 -x41 -x40 -x39 -x38 x37 x36 -x35 -x34 -x33 -x32 -x31 x30 x29 -x28 -x27
0.39/0.49 v -x26 -x25 -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.39/0.49 c SCIP Status : problem is solved [optimal solution found]
0.39/0.49 c Solving Time : 0.48
0.39/0.49 c Original Problem :
0.39/0.49 c Problem name : HOME/instance-2703079-1278564448.opb
0.39/0.49 c Variables : 350 (350 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.49 c Constraints : 256 initial, 256 maximal
0.39/0.49 c Presolved Problem :
0.39/0.49 c Problem name : t_HOME/instance-2703079-1278564448.opb
0.39/0.49 c Variables : 275 (275 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.49 c Constraints : 191 initial, 191 maximal
0.39/0.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.49 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.49 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.49 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.49 c probing : 0.01 0 0 0 0 0 0 0 0
0.39/0.49 c and : 0.01 10 60 0 0 0 60 0 60
0.39/0.49 c linear : 0.01 1 4 0 0 0 0 0 30
0.39/0.49 c logicor : 0.00 0 0 0 0 0 0 0 0
0.39/0.49 c root node : - 0 - - 0 - - - -
0.39/0.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.49 c integral : 0 0 0 0 0 0 0 0 0 0
0.39/0.49 c and : 180 0 371 0 0 0 0 0 0 0
0.39/0.49 c linear : 5 0 371 0 0 0 0 0 0 0
0.39/0.49 c logicor : 6 0 60 0 0 0 0 0 0 0
0.39/0.49 c countsols : 0 0 0 0 0 0 0 0 0 0
0.39/0.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.49 c integral : 0.00 0.00 0.00 0.00 0.00
0.39/0.49 c and : 0.00 0.00 0.00 0.00 0.00
0.39/0.49 c linear : 0.00 0.00 0.00 0.00 0.00
0.39/0.49 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.49 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.49 c Propagators : Time Calls Cutoffs DomReds
0.39/0.49 c vbounds : 0.00 2 0 0
0.39/0.49 c rootredcost : 0.00 0 0 0
0.39/0.49 c pseudoobj : 0.00 52 0 0
0.39/0.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.49 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.49 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.49 c applied globally : - - - 0 0.0 - - -
0.39/0.49 c applied locally : - - - 0 0.0 - - -
0.39/0.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.49 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.49 c redcost : 0.00 0 0 0 0 0
0.39/0.49 c impliedbounds : 0.00 0 0 0 0 0
0.39/0.49 c intobj : 0.00 0 0 0 0 0
0.39/0.49 c cgmip : 0.00 0 0 0 0 0
0.39/0.49 c gomory : 0.00 0 0 0 0 0
0.39/0.49 c strongcg : 0.00 0 0 0 0 0
0.39/0.49 c cmir : 0.00 0 0 0 0 0
0.39/0.49 c flowcover : 0.00 0 0 0 0 0
0.39/0.49 c clique : 0.00 0 0 0 0 0
0.39/0.49 c zerohalf : 0.00 0 0 0 0 0
0.39/0.49 c mcf : 0.00 0 0 0 0 0
0.39/0.49 c rapidlearning : 0.00 0 0 0 0 0
0.39/0.49 c Pricers : Time Calls Vars
0.39/0.49 c problem variables: 0.00 0 0
0.39/0.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.49 c pscost : 0.00 0 0 0 0 0 0
0.39/0.49 c inference : 0.00 0 0 0 0 0 0
0.39/0.49 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.49 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.49 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.49 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.49 c random : 0.00 0 0 0 0 0 0
0.39/0.49 c relpscost : 0.00 0 0 0 0 0 0
0.39/0.49 c Primal Heuristics : Time Calls Found
0.39/0.49 c LP solutions : 0.00 - 0
0.39/0.49 c pseudo solutions : 0.00 - 0
0.39/0.49 c oneopt : 0.00 0 0
0.39/0.49 c trivial : 0.00 2 0
0.39/0.49 c simplerounding : 0.00 0 0
0.39/0.49 c zirounding : 0.00 0 0
0.39/0.49 c rounding : 0.00 1 0
0.39/0.49 c shifting : 0.00 1 0
0.39/0.49 c intshifting : 0.00 0 0
0.39/0.49 c twoopt : 0.00 0 0
0.39/0.49 c fixandinfer : 0.00 0 0
0.39/0.49 c feaspump : 0.01 1 0
0.39/0.49 c coefdiving : 0.00 0 0
0.39/0.49 c pscostdiving : 0.00 0 0
0.39/0.49 c fracdiving : 0.00 0 0
0.39/0.49 c veclendiving : 0.00 0 0
0.39/0.49 c intdiving : 0.00 0 0
0.39/0.49 c actconsdiving : 0.00 0 0
0.39/0.49 c objpscostdiving : 0.00 0 0
0.39/0.49 c rootsoldiving : 0.00 0 0
0.39/0.49 c linesearchdiving : 0.00 0 0
0.39/0.49 c guideddiving : 0.00 0 0
0.39/0.49 c octane : 0.00 0 0
0.39/0.49 c rens : 0.00 0 0
0.39/0.49 c rins : 0.00 0 0
0.39/0.49 c localbranching : 0.00 0 0
0.39/0.49 c mutation : 0.00 0 0
0.39/0.49 c crossover : 0.00 0 0
0.39/0.49 c dins : 0.00 0 0
0.39/0.49 c undercover : 0.42 1 1
0.39/0.49 c nlp : 0.00 0 0
0.39/0.49 c trysol : 0.00 0 0
0.39/0.49 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.49 c primal LP : 0.00 0 0 0.00 -
0.39/0.49 c dual LP : 0.00 1 14 14.00 -
0.39/0.49 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.49 c barrier LP : 0.00 0 0 0.00 -
0.39/0.49 c diving/probing LP: 0.01 14 252 18.00 -
0.39/0.49 c strong branching : 0.00 0 0 0.00 -
0.39/0.49 c (at root node) : - 0 0 0.00 -
0.39/0.49 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.49 c B&B Tree :
0.39/0.49 c number of runs : 1
0.39/0.49 c nodes : 1
0.39/0.49 c nodes (total) : 1
0.39/0.49 c nodes left : 0
0.39/0.49 c max depth : 0
0.39/0.49 c max depth (total): 0
0.39/0.49 c backtracks : 0 (0.0%)
0.39/0.49 c delayed cutoffs : 0
0.39/0.49 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.39/0.49 c avg switch length: 2.00
0.39/0.49 c switching time : 0.00
0.39/0.49 c Solution :
0.39/0.49 c Solutions found : 1 (1 improvements)
0.39/0.49 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.48 seconds, depth 0, found by <undercover>)
0.39/0.49 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.48 seconds, depth 0, found by <undercover>)
0.39/0.50 c Dual Bound : +3.00000000000000e+00
0.39/0.50 c Gap : 0.00 %
0.39/0.50 c Root Dual Bound : +3.00000000000000e+00
0.39/0.50 c Root Iterations : 266
0.49/0.50 c Time complete: 0.5.