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-2702993-1278564378.opb>
0.00/0.01 c original problem has 160 variables (160 bin, 0 int, 0 impl, 0 cont) and 109 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) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 15 chg coeffs, 0 upgd conss, 548 impls, 0 clqs
0.00/0.02 c (round 2) 17 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 826 impls, 0 clqs
0.00/0.02 c (round 3) 28 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 33 chg coeffs, 5 upgd conss, 986 impls, 0 clqs
0.00/0.03 c (round 4) 38 del vars, 26 del conss, 0 chg bounds, 0 chg sides, 41 chg coeffs, 5 upgd conss, 1066 impls, 0 clqs
0.00/0.03 c (round 5) 48 del vars, 34 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 5 upgd conss, 1066 impls, 0 clqs
0.00/0.03 c (round 6) 49 del vars, 35 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 5 upgd conss, 1066 impls, 0 clqs
0.03/0.04 c presolving (7 rounds):
0.03/0.04 c 49 deleted vars, 35 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 49 changed coefficients
0.03/0.04 c 1090 implications, 0 cliques
0.03/0.04 c presolved problem has 111 variables (111 bin, 0 int, 0 impl, 0 cont) and 70 constraints
0.03/0.04 c 61 constraints of type <and>
0.03/0.04 c 4 constraints of type <linear>
0.03/0.04 c 5 constraints of type <logicor>
0.03/0.04 c transformed objective value is always integral (scale: 2)
0.03/0.04 c Presolving Time: 0.02
0.03/0.04 c - non default parameters ----------------------------------------------------------------------
0.03/0.04 c # SCIP version 1.2.1.3
0.03/0.04 c
0.03/0.04 c # frequency for displaying node information lines
0.03/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.04 c display/freq = 10000
0.03/0.04 c
0.03/0.04 c # maximal time in seconds to run
0.03/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.04 c limits/time = 1790
0.03/0.04 c
0.03/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.04 c limits/memory = 1620
0.03/0.04 c
0.03/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.04 c # [type: int, range: [1,2], default: 1]
0.03/0.04 c timing/clocktype = 2
0.03/0.04 c
0.03/0.04 c # should presolving try to simplify inequalities
0.03/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.04 c constraints/linear/simplifyinequalities = TRUE
0.03/0.04 c
0.03/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.04 c constraints/indicator/addCouplingCons = TRUE
0.03/0.04 c
0.03/0.04 c # should presolving try to simplify knapsacks
0.03/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.04 c
0.03/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.04 c heuristics/undercover/freq = 0
0.03/0.04 c
0.03/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.04 c separating/rapidlearning/freq = 0
0.03/0.04 c
0.03/0.04 c -----------------------------------------------------------------------------------------------
0.03/0.04 c start solving
0.03/0.04 c
0.03/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.03/0.04 c 0.0s| 1 | 0 | 9 | - | 625k| 0 | 2 | 111 | 70 | 111 | 131 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.03/0.08 o 3
0.03/0.08 c u 0.1s| 1 | 0 | 157 | - | 631k| 0 | - | 111 | 70 | 111 | 131 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.03/0.09 c 0.1s| 1 | 0 | 157 | - | 630k| 0 | - | 111 | 70 | 111 | 131 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.03/0.09 c
0.03/0.09 c SCIP Status : problem is solved [optimal solution found]
0.03/0.09 c Solving Time (sec) : 0.08
0.03/0.09 c Solving Nodes : 1
0.03/0.09 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.03/0.09 c Dual Bound : +3.00000000000000e+00
0.03/0.09 c Gap : 0.00 %
0.03/0.09 s OPTIMUM FOUND
0.03/0.09 v -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x40 -x39 -x38 x37 x36 -x50 -x49 -x48 -x47 x46 -x35 -x34 -x33 -x32 x31 -x45 -x44
0.03/0.09 v -x43 x42 -x41 -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
0.03/0.09 v -x5 -x4 -x3 x2 x1
0.03/0.09 c SCIP Status : problem is solved [optimal solution found]
0.03/0.09 c Solving Time : 0.08
0.03/0.09 c Original Problem :
0.03/0.09 c Problem name : HOME/instance-2702993-1278564378.opb
0.03/0.09 c Variables : 160 (160 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.09 c Constraints : 109 initial, 109 maximal
0.03/0.09 c Presolved Problem :
0.03/0.09 c Problem name : t_HOME/instance-2702993-1278564378.opb
0.03/0.09 c Variables : 111 (111 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.09 c Constraints : 70 initial, 70 maximal
0.03/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.03/0.09 c trivial : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c implics : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c probing : 0.01 0 0 0 0 0 0 0 0
0.03/0.09 c and : 0.01 8 35 0 0 0 35 0 34
0.03/0.09 c linear : 0.00 1 5 0 0 0 0 0 15
0.03/0.09 c logicor : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c root node : - 0 - - 0 - - - -
0.03/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.03/0.09 c integral : 0 0 0 0 0 0 0 0 0 0
0.03/0.09 c and : 61 0 259 0 0 0 0 0 0 0
0.03/0.09 c linear : 4 0 259 0 0 0 0 0 0 0
0.03/0.09 c logicor : 5 0 57 0 0 0 0 0 0 0
0.03/0.09 c countsols : 0 0 0 0 0 0 0 0 0 0
0.03/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.03/0.09 c integral : 0.00 0.00 0.00 0.00 0.00
0.03/0.09 c and : 0.00 0.00 0.00 0.00 0.00
0.03/0.09 c linear : 0.00 0.00 0.00 0.00 0.00
0.03/0.09 c logicor : 0.00 0.00 0.00 0.00 0.00
0.03/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00
0.03/0.09 c Propagators : Time Calls Cutoffs DomReds
0.03/0.09 c vbounds : 0.00 2 0 0
0.03/0.09 c rootredcost : 0.00 0 0 0
0.03/0.09 c pseudoobj : 0.00 26 0 0
0.03/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.03/0.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.09 c applied globally : - - - 0 0.0 - - -
0.03/0.09 c applied locally : - - - 0 0.0 - - -
0.03/0.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.03/0.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.03/0.09 c redcost : 0.00 0 0 0 0 0
0.03/0.09 c impliedbounds : 0.00 0 0 0 0 0
0.03/0.09 c intobj : 0.00 0 0 0 0 0
0.03/0.09 c cgmip : 0.00 0 0 0 0 0
0.03/0.09 c gomory : 0.00 0 0 0 0 0
0.03/0.09 c strongcg : 0.00 0 0 0 0 0
0.03/0.09 c cmir : 0.00 0 0 0 0 0
0.03/0.09 c flowcover : 0.00 0 0 0 0 0
0.03/0.09 c clique : 0.00 0 0 0 0 0
0.03/0.09 c zerohalf : 0.00 0 0 0 0 0
0.03/0.09 c mcf : 0.00 0 0 0 0 0
0.03/0.09 c rapidlearning : 0.00 0 0 0 0 0
0.03/0.09 c Pricers : Time Calls Vars
0.03/0.09 c problem variables: 0.00 0 0
0.03/0.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.03/0.09 c pscost : 0.00 0 0 0 0 0 0
0.03/0.09 c inference : 0.00 0 0 0 0 0 0
0.03/0.09 c mostinf : 0.00 0 0 0 0 0 0
0.03/0.09 c leastinf : 0.00 0 0 0 0 0 0
0.03/0.09 c fullstrong : 0.00 0 0 0 0 0 0
0.03/0.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.03/0.09 c random : 0.00 0 0 0 0 0 0
0.03/0.09 c relpscost : 0.00 0 0 0 0 0 0
0.03/0.09 c Primal Heuristics : Time Calls Found
0.03/0.09 c LP solutions : 0.00 - 0
0.03/0.09 c pseudo solutions : 0.00 - 0
0.03/0.09 c oneopt : 0.00 0 0
0.03/0.09 c trivial : 0.00 2 0
0.03/0.09 c simplerounding : 0.00 0 0
0.03/0.09 c zirounding : 0.00 0 0
0.03/0.09 c rounding : 0.00 1 0
0.03/0.09 c shifting : 0.00 1 0
0.03/0.09 c intshifting : 0.00 0 0
0.03/0.09 c twoopt : 0.00 0 0
0.03/0.09 c fixandinfer : 0.00 0 0
0.03/0.09 c feaspump : 0.00 1 0
0.03/0.09 c coefdiving : 0.00 0 0
0.03/0.09 c pscostdiving : 0.00 0 0
0.03/0.09 c fracdiving : 0.00 0 0
0.03/0.09 c veclendiving : 0.00 0 0
0.03/0.09 c intdiving : 0.00 0 0
0.03/0.09 c actconsdiving : 0.00 0 0
0.03/0.09 c objpscostdiving : 0.00 0 0
0.03/0.09 c rootsoldiving : 0.00 0 0
0.03/0.09 c linesearchdiving : 0.00 0 0
0.03/0.09 c guideddiving : 0.00 0 0
0.03/0.09 c octane : 0.00 0 0
0.03/0.09 c rens : 0.00 0 0
0.03/0.09 c rins : 0.00 0 0
0.03/0.09 c localbranching : 0.00 0 0
0.03/0.09 c mutation : 0.00 0 0
0.03/0.09 c crossover : 0.00 0 0
0.03/0.09 c dins : 0.00 0 0
0.03/0.09 c undercover : 0.04 1 1
0.03/0.09 c nlp : 0.00 0 0
0.03/0.09 c trysol : 0.00 0 0
0.03/0.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.03/0.09 c primal LP : 0.00 0 0 0.00 -
0.03/0.09 c dual LP : 0.00 1 9 9.00 -
0.03/0.09 c lex dual LP : 0.00 0 0 0.00 -
0.03/0.09 c barrier LP : 0.00 0 0 0.00 -
0.03/0.09 c diving/probing LP: 0.00 11 148 13.45 -
0.03/0.09 c strong branching : 0.00 0 0 0.00 -
0.03/0.09 c (at root node) : - 0 0 0.00 -
0.03/0.09 c conflict analysis: 0.00 0 0 0.00 -
0.03/0.09 c B&B Tree :
0.03/0.09 c number of runs : 1
0.03/0.09 c nodes : 1
0.03/0.09 c nodes (total) : 1
0.03/0.09 c nodes left : 0
0.03/0.09 c max depth : 0
0.03/0.09 c max depth (total): 0
0.03/0.09 c backtracks : 0 (0.0%)
0.03/0.09 c delayed cutoffs : 0
0.03/0.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.03/0.09 c avg switch length: 2.00
0.03/0.09 c switching time : 0.00
0.03/0.09 c Solution :
0.03/0.09 c Solutions found : 1 (1 improvements)
0.03/0.09 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <undercover>)
0.03/0.09 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <undercover>)
0.03/0.09 c Dual Bound : +3.00000000000000e+00
0.03/0.09 c Gap : 0.00 %
0.03/0.09 c Root Dual Bound : +3.00000000000000e+00
0.03/0.09 c Root Iterations : 157
0.09/0.10 c Time complete: 0.09.