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-2702958-1278564330.opb>
0.00/0.01 c original problem has 216 variables (216 bin, 0 int, 0 impl, 0 cont) and 167 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 688 impls, 0 clqs
0.00/0.02 c (round 2) 20 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 3 upgd conss, 976 impls, 0 clqs
0.00/0.03 c (round 3) 38 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 53 chg coeffs, 3 upgd conss, 976 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 128/178 (71.9%) - 0 fixings, 0 aggregations, 4 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (4 rounds):
0.00/0.04 c 38 deleted vars, 32 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 53 changed coefficients
0.00/0.04 c 984 implications, 0 cliques
0.00/0.04 c presolved problem has 178 variables (178 bin, 0 int, 0 impl, 0 cont) and 133 constraints
0.00/0.04 c 128 constraints of type <and>
0.00/0.04 c 2 constraints of type <linear>
0.00/0.04 c 3 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 2)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.3
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1790
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 8 | - | 898k| 0 | 5 | 178 | 133 | 178 | 261 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.33 o 3
0.29/0.33 c u 0.3s| 1 | 0 | 207 | - | 911k| 0 | - | 178 | 133 | 178 | 261 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.29/0.33 c 0.3s| 1 | 0 | 207 | - | 908k| 0 | - | 178 | 133 | 178 | 261 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.29/0.33 c
0.29/0.33 c SCIP Status : problem is solved [optimal solution found]
0.29/0.33 c Solving Time (sec) : 0.32
0.29/0.33 c Solving Nodes : 1
0.29/0.33 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.29/0.33 c Dual Bound : +3.00000000000000e+00
0.29/0.33 c Gap : 0.00 %
0.29/0.33 s OPTIMUM FOUND
0.29/0.33 v -x54 -x53 -x52 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
0.29/0.33 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.29/0.33 c SCIP Status : problem is solved [optimal solution found]
0.29/0.33 c Solving Time : 0.32
0.29/0.33 c Original Problem :
0.29/0.33 c Problem name : HOME/instance-2702958-1278564330.opb
0.29/0.33 c Variables : 216 (216 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.33 c Constraints : 167 initial, 167 maximal
0.29/0.33 c Presolved Problem :
0.29/0.33 c Problem name : t_HOME/instance-2702958-1278564330.opb
0.29/0.33 c Variables : 178 (178 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.33 c Constraints : 133 initial, 133 maximal
0.29/0.33 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.29/0.33 c trivial : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c implics : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c probing : 0.01 0 0 0 0 0 0 0 0
0.29/0.33 c and : 0.01 4 32 0 0 0 32 0 32
0.29/0.33 c linear : 0.00 1 1 0 0 0 0 0 21
0.29/0.33 c logicor : 0.00 0 0 0 0 0 0 0 0
0.29/0.33 c root node : - 0 - - 0 - - - -
0.29/0.33 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.29/0.33 c integral : 0 0 0 0 0 0 0 0 0 0
0.29/0.33 c and : 128 0 287 0 0 0 0 0 0 0
0.29/0.33 c linear : 2 0 287 0 0 0 0 0 0 0
0.29/0.33 c logicor : 3 0 52 0 0 0 0 0 0 0
0.29/0.33 c countsols : 0 0 0 0 0 0 0 0 0 0
0.29/0.33 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.29/0.33 c integral : 0.00 0.00 0.00 0.00 0.00
0.29/0.33 c and : 0.00 0.00 0.00 0.00 0.00
0.29/0.33 c linear : 0.01 0.00 0.01 0.00 0.00
0.29/0.33 c logicor : 0.00 0.00 0.00 0.00 0.00
0.29/0.33 c countsols : 0.00 0.00 0.00 0.00 0.00
0.29/0.33 c Propagators : Time Calls Cutoffs DomReds
0.29/0.33 c vbounds : 0.00 2 0 0
0.29/0.33 c rootredcost : 0.00 0 0 0
0.29/0.33 c pseudoobj : 0.00 30 0 0
0.29/0.33 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.33 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.33 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.33 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.33 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.33 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.33 c applied globally : - - - 0 0.0 - - -
0.29/0.33 c applied locally : - - - 0 0.0 - - -
0.29/0.33 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.33 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.29/0.33 c redcost : 0.00 0 0 0 0 0
0.29/0.33 c impliedbounds : 0.00 0 0 0 0 0
0.29/0.33 c intobj : 0.00 0 0 0 0 0
0.29/0.33 c cgmip : 0.00 0 0 0 0 0
0.29/0.33 c gomory : 0.00 0 0 0 0 0
0.29/0.33 c strongcg : 0.00 0 0 0 0 0
0.29/0.33 c cmir : 0.00 0 0 0 0 0
0.29/0.33 c flowcover : 0.00 0 0 0 0 0
0.29/0.33 c clique : 0.00 0 0 0 0 0
0.29/0.33 c zerohalf : 0.00 0 0 0 0 0
0.29/0.33 c mcf : 0.00 0 0 0 0 0
0.29/0.33 c rapidlearning : 0.00 0 0 0 0 0
0.29/0.33 c Pricers : Time Calls Vars
0.29/0.33 c problem variables: 0.00 0 0
0.29/0.33 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.33 c pscost : 0.00 0 0 0 0 0 0
0.29/0.33 c inference : 0.00 0 0 0 0 0 0
0.29/0.33 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.33 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.33 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.33 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.33 c random : 0.00 0 0 0 0 0 0
0.29/0.33 c relpscost : 0.00 0 0 0 0 0 0
0.29/0.33 c Primal Heuristics : Time Calls Found
0.29/0.33 c LP solutions : 0.00 - 0
0.29/0.33 c pseudo solutions : 0.00 - 0
0.29/0.33 c oneopt : 0.00 0 0
0.29/0.33 c trivial : 0.00 2 0
0.29/0.33 c simplerounding : 0.00 0 0
0.29/0.33 c zirounding : 0.00 0 0
0.29/0.33 c rounding : 0.00 1 0
0.29/0.33 c shifting : 0.00 1 0
0.29/0.33 c intshifting : 0.00 0 0
0.29/0.33 c twoopt : 0.00 0 0
0.29/0.33 c fixandinfer : 0.00 0 0
0.29/0.33 c feaspump : 0.01 1 0
0.29/0.33 c coefdiving : 0.00 0 0
0.29/0.33 c pscostdiving : 0.00 0 0
0.29/0.33 c fracdiving : 0.00 0 0
0.29/0.33 c veclendiving : 0.00 0 0
0.29/0.33 c intdiving : 0.00 0 0
0.29/0.33 c actconsdiving : 0.00 0 0
0.29/0.33 c objpscostdiving : 0.00 0 0
0.29/0.33 c rootsoldiving : 0.00 0 0
0.29/0.33 c linesearchdiving : 0.00 0 0
0.29/0.33 c guideddiving : 0.00 0 0
0.29/0.33 c octane : 0.00 0 0
0.29/0.33 c rens : 0.00 0 0
0.29/0.33 c rins : 0.00 0 0
0.29/0.33 c localbranching : 0.00 0 0
0.29/0.33 c mutation : 0.00 0 0
0.29/0.33 c crossover : 0.00 0 0
0.29/0.33 c dins : 0.00 0 0
0.29/0.33 c undercover : 0.28 1 1
0.29/0.33 c nlp : 0.00 0 0
0.29/0.33 c trysol : 0.00 0 0
0.29/0.33 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.33 c primal LP : 0.00 0 0 0.00 -
0.29/0.33 c dual LP : 0.00 1 8 8.00 -
0.29/0.33 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.33 c barrier LP : 0.00 0 0 0.00 -
0.29/0.33 c diving/probing LP: 0.01 8 199 24.88 -
0.29/0.33 c strong branching : 0.00 0 0 0.00 -
0.29/0.33 c (at root node) : - 0 0 0.00 -
0.29/0.33 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.33 c B&B Tree :
0.29/0.33 c number of runs : 1
0.29/0.33 c nodes : 1
0.29/0.33 c nodes (total) : 1
0.29/0.33 c nodes left : 0
0.29/0.33 c max depth : 0
0.29/0.33 c max depth (total): 0
0.29/0.33 c backtracks : 0 (0.0%)
0.29/0.33 c delayed cutoffs : 0
0.29/0.33 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.29/0.33 c avg switch length: 2.00
0.29/0.33 c switching time : 0.00
0.29/0.33 c Solution :
0.29/0.33 c Solutions found : 1 (1 improvements)
0.29/0.33 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.31 seconds, depth 0, found by <undercover>)
0.29/0.33 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.31 seconds, depth 0, found by <undercover>)
0.29/0.33 c Dual Bound : +3.00000000000000e+00
0.29/0.33 c Gap : 0.00 %
0.29/0.33 c Root Dual Bound : +3.00000000000000e+00
0.29/0.33 c Root Iterations : 207
0.29/0.34 c Time complete: 0.33.