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-2703094-1278564459.opb>
0.00/0.01 c original problem has 120 variables (120 bin, 0 int, 0 impl, 0 cont) and 82 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) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 0 upgd conss, 376 impls, 0 clqs
0.00/0.02 c (round 2) 17 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 587 impls, 0 clqs
0.00/0.02 c (round 3) 27 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 29 chg coeffs, 4 upgd conss, 667 impls, 0 clqs
0.00/0.02 c (round 4) 37 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 4 upgd conss, 667 impls, 0 clqs
0.00/0.03 c presolving (5 rounds):
0.00/0.03 c 37 deleted vars, 25 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 37 changed coefficients
0.00/0.03 c 685 implications, 0 cliques
0.00/0.03 c presolved problem has 83 variables (83 bin, 0 int, 0 impl, 0 cont) and 54 constraints
0.00/0.03 c 46 constraints of type <and>
0.00/0.03 c 3 constraints of type <linear>
0.00/0.03 c 5 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 2)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.3
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1790
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c heuristics/undercover/freq = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 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 | 6 | - | 493k| 0 | 2 | 83 | 54 | 83 | 99 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.00/0.09 o 3
0.00/0.09 c y 0.1s| 1 | 0 | 107 | - | 506k| 0 | - | 83 | 54 | 83 | 99 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.08/0.09 c 0.1s| 1 | 0 | 107 | - | 654k| 0 | - | 83 | 142 | 83 | 99 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.08/0.09 c 0.1s| 1 | 0 | 107 | - | 654k| 0 | - | 83 | 142 | 83 | 99 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.08/0.09 c
0.08/0.09 c SCIP Status : problem is solved [optimal solution found]
0.08/0.09 c Solving Time (sec) : 0.08
0.08/0.09 c Solving Nodes : 1
0.08/0.09 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.08/0.09 c Dual Bound : +3.00000000000000e+00
0.08/0.09 c Gap : 0.00 %
0.08/0.09 s OPTIMUM FOUND
0.08/0.09 v -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 x37 -x36 -x30 -x29 -x28 -x27 x26 -x35 -x34 -x33 x32 -x31 -x25 -x24 x23 -x22 x21 -x20 -x19
0.08/0.09 v x18 -x17 x16 -x15 x14 x13 -x12 x11 x10 -x9 x8 x7 x6 -x5 -x4 -x3 x2 x1
0.08/0.09 c SCIP Status : problem is solved [optimal solution found]
0.08/0.09 c Solving Time : 0.08
0.08/0.09 c Original Problem :
0.08/0.09 c Problem name : HOME/instance-2703094-1278564459.opb
0.08/0.09 c Variables : 120 (120 binary, 0 integer, 0 implicit integer, 0 continuous)
0.08/0.09 c Constraints : 82 initial, 82 maximal
0.08/0.09 c Presolved Problem :
0.08/0.09 c Problem name : t_HOME/instance-2703094-1278564459.opb
0.08/0.09 c Variables : 83 (83 binary, 0 integer, 0 implicit integer, 0 continuous)
0.08/0.09 c Constraints : 54 initial, 142 maximal
0.08/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.08/0.09 c trivial : 0.00 0 0 0 0 0 0 0 0
0.08/0.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.08/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.08/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.08/0.09 c implics : 0.00 0 0 0 0 0 0 0 0
0.08/0.09 c probing : 0.00 0 0 0 0 0 0 0 0
0.08/0.09 c and : 0.00 6 25 0 0 0 25 0 25
0.08/0.09 c linear : 0.00 2 4 0 0 0 0 0 12
0.08/0.09 c logicor : 0.00 0 0 0 0 0 0 0 0
0.08/0.09 c root node : - 19 - - 19 - - - -
0.08/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.08/0.09 c integral : 0 0 0 0 0 0 0 0 0 0
0.08/0.09 c and : 46 1 176 0 0 0 0 0 0 0
0.08/0.09 c linear : 3+ 1 176 0 0 0 0 0 0 0
0.08/0.09 c logicor : 5 1 51 0 0 0 0 0 0 0
0.08/0.09 c countsols : 0 0 0 0 0 0 0 0 0 0
0.08/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.08/0.09 c integral : 0.00 0.00 0.00 0.00 0.00
0.08/0.09 c and : 0.00 0.00 0.00 0.00 0.00
0.08/0.09 c linear : 0.00 0.00 0.00 0.00 0.00
0.08/0.09 c logicor : 0.00 0.00 0.00 0.00 0.00
0.08/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00
0.08/0.09 c Propagators : Time Calls Cutoffs DomReds
0.08/0.09 c vbounds : 0.00 2 0 0
0.08/0.09 c rootredcost : 0.00 0 0 0
0.08/0.09 c pseudoobj : 0.00 3 1 0
0.08/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.08/0.09 c propagation : 0.00 1 0 0 0.0 0 0.0 -
0.08/0.10 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.08/0.10 c applied globally : - - - 0 0.0 - - -
0.08/0.10 c applied locally : - - - 0 0.0 - - -
0.08/0.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.08/0.10 c cut pool : 0.00 0 - - 0 - (maximal pool size: 8)
0.08/0.10 c redcost : 0.00 1 0 0 0 0
0.08/0.10 c impliedbounds : 0.00 1 0 0 3 0
0.08/0.10 c intobj : 0.00 0 0 0 0 0
0.08/0.10 c cgmip : 0.00 0 0 0 0 0
0.08/0.10 c gomory : 0.00 1 0 0 0 0
0.08/0.10 c strongcg : 0.00 1 0 0 0 0
0.08/0.10 c cmir : 0.00 1 0 0 2 0
0.08/0.10 c flowcover : 0.00 1 0 0 3 0
0.08/0.10 c clique : 0.00 1 0 0 0 0
0.08/0.10 c zerohalf : 0.00 0 0 0 0 0
0.08/0.10 c mcf : 0.00 1 0 0 0 0
0.08/0.10 c rapidlearning : 0.04 1 0 19 0 88
0.08/0.10 c Pricers : Time Calls Vars
0.08/0.10 c problem variables: 0.00 0 0
0.08/0.10 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.08/0.10 c pscost : 0.00 0 0 0 0 0 0
0.08/0.10 c inference : 0.00 0 0 0 0 0 0
0.08/0.10 c mostinf : 0.00 0 0 0 0 0 0
0.08/0.10 c leastinf : 0.00 0 0 0 0 0 0
0.08/0.10 c fullstrong : 0.00 0 0 0 0 0 0
0.08/0.10 c allfullstrong : 0.00 0 0 0 0 0 0
0.08/0.10 c random : 0.00 0 0 0 0 0 0
0.08/0.10 c relpscost : 0.00 0 0 0 0 0 0
0.08/0.10 c Primal Heuristics : Time Calls Found
0.08/0.10 c LP solutions : 0.00 - 0
0.08/0.10 c pseudo solutions : 0.00 - 0
0.08/0.10 c oneopt : 0.00 0 0
0.08/0.10 c trivial : 0.00 2 0
0.08/0.10 c simplerounding : 0.00 0 0
0.08/0.10 c zirounding : 0.00 0 0
0.08/0.10 c rounding : 0.00 1 0
0.08/0.10 c shifting : 0.00 1 0
0.08/0.10 c intshifting : 0.00 0 0
0.08/0.10 c twoopt : 0.00 0 0
0.08/0.10 c fixandinfer : 0.00 0 0
0.08/0.10 c feaspump : 0.00 1 0
0.08/0.10 c coefdiving : 0.00 0 0
0.08/0.10 c pscostdiving : 0.00 0 0
0.08/0.10 c fracdiving : 0.00 0 0
0.08/0.10 c veclendiving : 0.00 0 0
0.08/0.10 c intdiving : 0.00 0 0
0.08/0.10 c actconsdiving : 0.00 0 0
0.08/0.10 c objpscostdiving : 0.00 0 0
0.08/0.10 c rootsoldiving : 0.00 0 0
0.08/0.10 c linesearchdiving : 0.00 0 0
0.08/0.10 c guideddiving : 0.00 0 0
0.08/0.10 c octane : 0.00 0 0
0.08/0.10 c rens : 0.00 0 0
0.08/0.10 c rins : 0.00 0 0
0.08/0.10 c localbranching : 0.00 0 0
0.08/0.10 c mutation : 0.00 0 0
0.08/0.10 c crossover : 0.00 0 0
0.08/0.10 c dins : 0.00 0 0
0.08/0.10 c undercover : 0.02 1 0
0.08/0.10 c nlp : 0.00 0 0
0.08/0.10 c trysol : 0.00 0 0
0.08/0.10 c LP : Time Calls Iterations Iter/call Iter/sec
0.08/0.10 c primal LP : 0.00 0 0 0.00 -
0.08/0.10 c dual LP : 0.00 1 6 6.00 -
0.08/0.10 c lex dual LP : 0.00 0 0 0.00 -
0.08/0.10 c barrier LP : 0.00 0 0 0.00 -
0.08/0.10 c diving/probing LP: 0.00 10 101 10.10 -
0.08/0.10 c strong branching : 0.00 0 0 0.00 -
0.08/0.10 c (at root node) : - 0 0 0.00 -
0.08/0.10 c conflict analysis: 0.00 0 0 0.00 -
0.08/0.10 c B&B Tree :
0.08/0.10 c number of runs : 1
0.08/0.10 c nodes : 1
0.08/0.10 c nodes (total) : 1
0.08/0.10 c nodes left : 0
0.08/0.10 c max depth : 0
0.08/0.10 c max depth (total): 0
0.08/0.10 c backtracks : 0 (0.0%)
0.08/0.10 c delayed cutoffs : 0
0.08/0.10 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.08/0.10 c avg switch length: 2.00
0.08/0.10 c switching time : 0.00
0.08/0.10 c Solution :
0.08/0.10 c Solutions found : 1 (1 improvements)
0.08/0.10 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.08 seconds, depth 0, found by <trysol>)
0.08/0.10 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.08 seconds, depth 0, found by <trysol>)
0.08/0.10 c Dual Bound : +3.00000000000000e+00
0.08/0.10 c Gap : 0.00 %
0.08/0.10 c Root Dual Bound : +3.00000000000000e+00
0.08/0.10 c Root Iterations : 107
0.09/0.10 c Time complete: 0.1.