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-2665026-1276647855.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, 400 impls, 0 clqs
0.00/0.02 c (round 2) 17 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 20 chg coeffs, 0 upgd conss, 618 impls, 0 clqs
0.00/0.03 c (round 3) 27 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 4 upgd conss, 698 impls, 0 clqs
0.00/0.03 c (round 4) 37 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 4 upgd conss, 698 impls, 0 clqs
0.00/0.03 c presolving (5 rounds):
0.00/0.03 c 37 deleted vars, 24 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 36 changed coefficients
0.00/0.03 c 716 implications, 0 cliques
0.00/0.03 c presolved problem has 83 variables (83 bin, 0 int, 0 impl, 0 cont) and 55 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 6 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.2
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 = 1800
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.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 | 10 | - | 494k| 0 | 4 | 83 | 55 | 83 | 99 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.00/0.09 c 0.1s| 1 | 0 | 19 | - | 510k| 0 | 15 | 83 | 55 | 83 | 105 | 6 | 0 | 0 | 3.000000e+00 | -- | Inf
0.00/0.10 c 0.1s| 1 | 0 | 31 | - | 552k| 0 | 20 | 83 | 55 | 83 | 113 | 14 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.11 c 0.1s| 1 | 0 | 45 | - | 598k| 0 | 29 | 83 | 55 | 83 | 121 | 22 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.13 c 0.1s| 1 | 0 | 66 | - | 632k| 0 | 29 | 83 | 55 | 83 | 129 | 30 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.15 c 0.1s| 1 | 0 | 88 | - | 655k| 0 | 25 | 83 | 55 | 83 | 137 | 38 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.16 c 0.1s| 1 | 0 | 103 | - | 690k| 0 | 34 | 83 | 55 | 83 | 146 | 47 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 2 | 103 | - | 690k| 0 | 34 | 83 | 55 | 83 | 146 | 47 | 0 | 9 | 3.000000e+00 | -- | Inf
0.39/0.41 o 13
0.39/0.41 c s 0.3s| 43 | 9 | 399 | 7.0 | 700k| 17 | - | 83 | 62 | 83 | 59 | 141 | 7 | 172 | 3.000000e+00 | 1.300000e+01 | 333.33%
0.39/0.46 o 3
0.39/0.46 c * 0.3s| 59 | 0 | 490 | 6.7 | 709k| 17 | - | 83 | 61 | 83 | 67 | 170 | 13 | 230 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.46 c
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time (sec) : 0.31
0.39/0.46 c Solving Nodes : 59
0.39/0.46 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.39/0.46 c Dual Bound : +3.00000000000000e+00
0.39/0.46 c Gap : 0.00 %
0.39/0.46 s OPTIMUM FOUND
0.39/0.46 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 -x17
0.39/0.46 v x16 x15 x14 x13 -x12 x11 x10 -x9 x8 -x7 x6 -x5 -x4 -x3 x2 x1
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time : 0.31
0.39/0.46 c Original Problem :
0.39/0.46 c Problem name : HOME/instance-2665026-1276647855.opb
0.39/0.46 c Variables : 120 (120 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 82 initial, 82 maximal
0.39/0.46 c Presolved Problem :
0.39/0.46 c Problem name : t_HOME/instance-2665026-1276647855.opb
0.39/0.46 c Variables : 83 (83 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 55 initial, 65 maximal
0.39/0.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.46 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c probing : 0.01 0 0 0 0 0 0 0 0
0.39/0.46 c and : 0.01 6 24 0 0 0 24 0 24
0.39/0.46 c linear : 0.00 3 4 0 0 0 0 0 12
0.39/0.46 c logicor : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c root node : - 6 - - 6 - - - -
0.39/0.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.46 c integral : 0 0 0 54 0 0 7 0 0 98
0.39/0.46 c and : 46 110 332 1 0 1 163 134 0 0
0.39/0.46 c linear : 3 6 331 1 0 10 84 0 0 0
0.39/0.46 c logicor : 6+ 6 94 1 0 0 6 0 0 0
0.39/0.46 c countsols : 0 0 0 1 0 0 0 0 0 0
0.39/0.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.46 c integral : 0.14 0.00 0.00 0.14 0.00
0.39/0.46 c and : 0.01 0.01 0.00 0.00 0.00
0.39/0.46 c linear : 0.01 0.00 0.01 0.00 0.00
0.39/0.46 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c Propagators : Time Calls Cutoffs DomReds
0.39/0.46 c vbounds : 0.00 2 0 0
0.39/0.46 c rootredcost : 0.00 1 0 1
0.39/0.46 c pseudoobj : 0.00 158 0 0
0.39/0.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.46 c propagation : 0.00 11 8 38 18.4 0 0.0 -
0.39/0.46 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c pseudo solution : 0.00 1 1 5 10.4 0 0.0 -
0.39/0.46 c applied globally : - - - 13 10.6 - - -
0.39/0.46 c applied locally : - - - 0 0.0 - - -
0.39/0.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.46 c cut pool : 0.00 5 - - 36 - (maximal pool size: 171)
0.39/0.46 c redcost : 0.00 110 0 0 0 0
0.39/0.46 c impliedbounds : 0.00 6 0 0 17 0
0.39/0.46 c intobj : 0.00 0 0 0 0 0
0.39/0.46 c cgmip : 0.00 0 0 0 0 0
0.39/0.46 c gomory : 0.02 6 0 0 77 0
0.39/0.46 c strongcg : 0.00 6 0 0 198 0
0.39/0.46 c cmir : 0.03 6 0 0 40 0
0.39/0.46 c flowcover : 0.01 6 0 0 72 0
0.39/0.46 c clique : 0.00 1 0 0 0 0
0.39/0.46 c zerohalf : 0.00 0 0 0 0 0
0.39/0.46 c mcf : 0.00 1 0 0 0 0
0.39/0.46 c rapidlearning : 0.02 1 0 0 0 0
0.39/0.46 c Pricers : Time Calls Vars
0.39/0.46 c problem variables: 0.00 0 0
0.39/0.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.46 c relpscost : 0.14 53 0 7 0 0 98
0.39/0.46 c pscost : 0.00 0 0 0 0 0 0
0.39/0.46 c inference : 0.00 0 0 0 0 0 0
0.39/0.46 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.46 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.46 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.46 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.46 c random : 0.00 0 0 0 0 0 0
0.39/0.46 c Primal Heuristics : Time Calls Found
0.39/0.46 c LP solutions : 0.00 - 1
0.39/0.46 c pseudo solutions : 0.00 - 0
0.39/0.46 c crossover : 0.00 0 0
0.39/0.46 c pscostdiving : 0.00 0 0
0.39/0.46 c fracdiving : 0.00 0 0
0.39/0.46 c veclendiving : 0.00 0 0
0.39/0.46 c objpscostdiving : 0.00 0 0
0.39/0.46 c rootsoldiving : 0.00 0 0
0.39/0.46 c linesearchdiving : 0.00 0 0
0.39/0.46 c guideddiving : 0.00 0 0
0.39/0.46 c intshifting : 0.00 0 0
0.39/0.46 c oneopt : 0.00 1 0
0.39/0.46 c coefdiving : 0.00 1 0
0.39/0.46 c trivial : 0.00 2 0
0.39/0.46 c simplerounding : 0.00 0 0
0.39/0.46 c zirounding : 0.00 49 0
0.39/0.46 c rounding : 0.00 108 0
0.39/0.46 c shifting : 0.00 15 1
0.39/0.46 c twoopt : 0.00 0 0
0.39/0.46 c fixandinfer : 0.00 0 0
0.39/0.46 c feaspump : 0.00 1 0
0.39/0.46 c intdiving : 0.00 0 0
0.39/0.46 c actconsdiving : 0.00 0 0
0.39/0.46 c octane : 0.00 0 0
0.39/0.46 c rens : 0.03 1 0
0.39/0.46 c rins : 0.00 0 0
0.39/0.46 c localbranching : 0.00 0 0
0.39/0.46 c mutation : 0.00 0 0
0.39/0.46 c dins : 0.00 0 0
0.39/0.46 c undercover : 0.01 1 0
0.39/0.46 c nlp : 0.00 0 0
0.39/0.46 c trysol : 0.00 0 0
0.39/0.46 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.46 c primal LP : 0.00 0 0 0.00 -
0.39/0.46 c dual LP : 0.01 113 475 4.20 47500.00
0.39/0.46 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.46 c barrier LP : 0.00 0 0 0.00 -
0.39/0.46 c diving/probing LP: 0.00 7 15 2.14 -
0.39/0.46 c strong branching : 0.14 230 1702 7.40 12157.14
0.39/0.46 c (at root node) : - 9 486 54.00 -
0.39/0.46 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.46 c B&B Tree :
0.39/0.46 c number of runs : 1
0.39/0.46 c nodes : 59
0.39/0.46 c nodes (total) : 59
0.39/0.46 c nodes left : 0
0.39/0.46 c max depth : 17
0.39/0.46 c max depth (total): 17
0.39/0.46 c backtracks : 5 (8.5%)
0.39/0.46 c delayed cutoffs : 1
0.39/0.46 c repropagations : 12 (34 domain reductions, 1 cutoffs)
0.39/0.46 c avg switch length: 2.31
0.39/0.46 c switching time : 0.00
0.39/0.46 c Solution :
0.39/0.46 c Solutions found : 2 (2 improvements)
0.39/0.46 c First Solution : +1.30000000000000e+01 (in run 1, after 43 nodes, 0.28 seconds, depth 10, found by <shifting>)
0.39/0.46 c Primal Bound : +3.00000000000000e+00 (in run 1, after 59 nodes, 0.31 seconds, depth 16, found by <relaxation>)
0.39/0.46 c Dual Bound : +3.00000000000000e+00
0.39/0.46 c Gap : 0.00 %
0.39/0.46 c Root Dual Bound : +3.00000000000000e+00
0.39/0.46 c Root Iterations : 103
0.39/0.47 c Time complete: 0.46.