0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
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-2665095-1276649519.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.03 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.04 c presolving (5 rounds):
0.00/0.04 c 37 deleted vars, 25 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 37 changed coefficients
0.00/0.04 c 685 implications, 0 cliques
0.00/0.04 c presolved problem has 83 variables (83 bin, 0 int, 0 impl, 0 cont) and 54 constraints
0.00/0.04 c 46 constraints of type <and>
0.00/0.04 c 3 constraints of type <linear>
0.00/0.04 c 5 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.01
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
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 = 1800
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 # 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 # 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 | 6 | - | 493k| 0 | 2 | 83 | 54 | 83 | 99 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 9 | - | 502k| 0 | 8 | 83 | 54 | 83 | 102 | 3 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 16 | - | 516k| 0 | 14 | 83 | 54 | 83 | 105 | 6 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 30 | - | 549k| 0 | 21 | 83 | 54 | 83 | 114 | 15 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 40 | - | 615k| 0 | 24 | 83 | 54 | 83 | 119 | 20 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 56 | - | 671k| 0 | 29 | 83 | 54 | 83 | 129 | 30 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 71 | - | 714k| 0 | 26 | 83 | 54 | 83 | 135 | 36 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 2 | 71 | - | 714k| 0 | 26 | 83 | 54 | 83 | 135 | 36 | 0 | 16 | 3.000000e+00 | -- | Inf
0.39/0.47 o 3
0.39/0.47 c * 0.4s| 75 | 0 | 586 | 7.0 | 739k| 22 | - | 83 | 74 | 83 | 74 | 184 | 20 | 283 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.47 c
0.39/0.47 c SCIP Status : problem is solved [optimal solution found]
0.39/0.47 c Solving Time (sec) : 0.36
0.39/0.47 c Solving Nodes : 75
0.39/0.47 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.39/0.47 c Dual Bound : +3.00000000000000e+00
0.39/0.47 c Gap : 0.00 %
0.39/0.47 s OPTIMUM FOUND
0.39/0.47 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 -x18
0.39/0.47 v x17 x16 x15 -x14 x13 -x12 x11 -x10 x9 -x8 -x7 x6 -x5 -x4 -x3 x2 x1
0.39/0.47 c SCIP Status : problem is solved [optimal solution found]
0.39/0.47 c Solving Time : 0.36
0.39/0.47 c Original Problem :
0.39/0.47 c Problem name : HOME/instance-2665095-1276649519.opb
0.39/0.47 c Variables : 120 (120 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.47 c Constraints : 82 initial, 82 maximal
0.39/0.47 c Presolved Problem :
0.39/0.47 c Problem name : t_HOME/instance-2665095-1276649519.opb
0.39/0.47 c Variables : 83 (83 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.47 c Constraints : 54 initial, 74 maximal
0.39/0.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.47 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c probing : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c and : 0.00 6 25 0 0 0 25 0 25
0.39/0.47 c linear : 0.01 2 4 0 0 0 0 0 12
0.39/0.47 c logicor : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c root node : - 0 - - 0 - - - -
0.39/0.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.47 c integral : 0 0 0 75 0 5 18 0 0 116
0.39/0.47 c and : 46 157 364 0 0 6 207 155 0 0
0.39/0.47 c linear : 3 6 357 0 0 8 144 0 0 0
0.39/0.47 c logicor : 5+ 6 93 0 0 0 6 0 0 0
0.39/0.47 c countsols : 0 0 0 1 0 0 0 0 0 0
0.39/0.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.47 c integral : 0.15 0.00 0.00 0.15 0.00
0.39/0.47 c and : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c linear : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c Propagators : Time Calls Cutoffs DomReds
0.39/0.47 c vbounds : 0.00 2 0 0
0.39/0.47 c rootredcost : 0.00 0 0 0
0.39/0.47 c pseudoobj : 0.00 190 0 0
0.39/0.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.47 c propagation : 0.00 14 13 60 19.0 0 0.0 -
0.39/0.47 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.47 c applied globally : - - - 20 13.6 - - -
0.39/0.47 c applied locally : - - - 0 0.0 - - -
0.39/0.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.47 c cut pool : 0.00 5 - - 47 - (maximal pool size: 144)
0.39/0.47 c redcost : 0.00 158 0 0 0 0
0.39/0.47 c impliedbounds : 0.00 6 0 0 11 0
0.39/0.47 c intobj : 0.00 0 0 0 0 0
0.39/0.47 c cgmip : 0.00 0 0 0 0 0
0.39/0.47 c gomory : 0.01 6 0 0 36 0
0.39/0.47 c strongcg : 0.01 6 0 0 232 0
0.39/0.47 c cmir : 0.03 6 0 0 29 0
0.39/0.47 c flowcover : 0.00 6 0 0 52 0
0.39/0.47 c clique : 0.00 6 0 0 0 0
0.39/0.47 c zerohalf : 0.00 0 0 0 0 0
0.39/0.47 c mcf : 0.00 1 0 0 0 0
0.39/0.47 c rapidlearning : 0.04 1 0 0 0 0
0.39/0.47 c Pricers : Time Calls Vars
0.39/0.47 c problem variables: 0.00 0 0
0.39/0.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.47 c relpscost : 0.15 74 5 18 0 0 116
0.39/0.47 c pscost : 0.00 0 0 0 0 0 0
0.39/0.47 c inference : 0.00 0 0 0 0 0 0
0.39/0.47 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.47 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.47 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.47 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.47 c random : 0.00 0 0 0 0 0 0
0.39/0.47 c Primal Heuristics : Time Calls Found
0.39/0.47 c LP solutions : 0.00 - 1
0.39/0.47 c pseudo solutions : 0.00 - 0
0.39/0.47 c oneopt : 0.00 0 0
0.39/0.47 c crossover : 0.00 0 0
0.39/0.47 c pscostdiving : 0.00 0 0
0.39/0.47 c fracdiving : 0.00 0 0
0.39/0.47 c veclendiving : 0.00 0 0
0.39/0.47 c objpscostdiving : 0.00 0 0
0.39/0.47 c rootsoldiving : 0.00 0 0
0.39/0.47 c linesearchdiving : 0.00 0 0
0.39/0.47 c guideddiving : 0.00 0 0
0.39/0.47 c intshifting : 0.00 0 0
0.39/0.47 c coefdiving : 0.00 1 0
0.39/0.47 c feaspump : 0.00 1 0
0.39/0.47 c trivial : 0.00 2 0
0.39/0.47 c simplerounding : 0.00 0 0
0.39/0.47 c zirounding : 0.00 62 0
0.39/0.47 c rounding : 0.01 129 0
0.39/0.47 c shifting : 0.01 29 0
0.39/0.47 c twoopt : 0.00 0 0
0.39/0.47 c fixandinfer : 0.00 0 0
0.39/0.47 c intdiving : 0.00 0 0
0.39/0.47 c actconsdiving : 0.00 0 0
0.39/0.47 c octane : 0.00 0 0
0.39/0.47 c rens : 0.01 1 0
0.39/0.47 c rins : 0.00 0 0
0.39/0.47 c localbranching : 0.00 0 0
0.39/0.47 c mutation : 0.00 0 0
0.39/0.47 c dins : 0.00 0 0
0.39/0.47 c undercover : 0.01 1 0
0.39/0.47 c nlp : 0.00 0 0
0.39/0.47 c trysol : 0.00 0 0
0.39/0.47 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.47 c primal LP : 0.00 0 0 0.00 -
0.39/0.47 c dual LP : 0.04 161 584 3.63 14600.00
0.39/0.47 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.47 c barrier LP : 0.00 0 0 0.00 -
0.39/0.47 c diving/probing LP: 0.00 2 2 1.00 -
0.39/0.47 c strong branching : 0.15 283 2283 8.07 15220.00
0.39/0.47 c (at root node) : - 16 551 34.44 -
0.39/0.47 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.47 c B&B Tree :
0.39/0.47 c number of runs : 1
0.39/0.47 c nodes : 75
0.39/0.47 c nodes (total) : 75
0.39/0.47 c nodes left : 0
0.39/0.47 c max depth : 22
0.39/0.47 c max depth (total): 22
0.39/0.47 c backtracks : 8 (10.7%)
0.39/0.47 c delayed cutoffs : 1
0.39/0.47 c repropagations : 9 (13 domain reductions, 1 cutoffs)
0.39/0.47 c avg switch length: 2.75
0.39/0.47 c switching time : 0.00
0.39/0.47 c Solution :
0.39/0.47 c Solutions found : 1 (1 improvements)
0.39/0.47 c First Solution : +3.00000000000000e+00 (in run 1, after 75 nodes, 0.36 seconds, depth 22, found by <relaxation>)
0.39/0.47 c Primal Bound : +3.00000000000000e+00 (in run 1, after 75 nodes, 0.36 seconds, depth 22, found by <relaxation>)
0.39/0.47 c Dual Bound : +3.00000000000000e+00
0.39/0.47 c Gap : 0.00 %
0.39/0.47 c Root Dual Bound : +3.00000000000000e+00
0.39/0.47 c Root Iterations : 71
0.39/0.48 c Time complete: 0.48.