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-2665029-1276647905.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, 580 impls, 0 clqs
0.00/0.02 c (round 2) 17 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 23 chg coeffs, 0 upgd conss, 863 impls, 0 clqs
0.00/0.03 c (round 3) 28 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 5 upgd conss, 1023 impls, 0 clqs
0.00/0.03 c (round 4) 38 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 5 upgd conss, 1103 impls, 0 clqs
0.00/0.03 c (round 5) 48 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 5 upgd conss, 1103 impls, 0 clqs
0.00/0.04 c presolving (6 rounds):
0.00/0.04 c 48 deleted vars, 33 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 48 changed coefficients
0.00/0.04 c 1127 implications, 0 cliques
0.00/0.04 c presolved problem has 112 variables (112 bin, 0 int, 0 impl, 0 cont) and 72 constraints
0.00/0.04 c 62 constraints of type <and>
0.00/0.04 c 4 constraints of type <linear>
0.00/0.04 c 6 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.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.05 c start solving
0.00/0.05 c
0.00/0.05 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.05 c 0.0s| 1 | 0 | 11 | - | 628k| 0 | 6 | 112 | 72 | 112 | 133 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 22 | - | 649k| 0 | 17 | 112 | 72 | 112 | 140 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 33 | - | 676k| 0 | 24 | 112 | 72 | 112 | 148 | 15 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 65 | - | 724k| 0 | 32 | 112 | 72 | 112 | 162 | 29 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 108 | - | 798k| 0 | 49 | 112 | 72 | 112 | 178 | 45 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.19 c 0.1s| 1 | 0 | 146 | - | 882k| 0 | 44 | 112 | 72 | 112 | 195 | 62 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 190 | - | 914k| 0 | 25 | 112 | 72 | 112 | 210 | 77 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 2 | 190 | - | 914k| 0 | 25 | 112 | 72 | 112 | 210 | 77 | 0 | 9 | 3.000000e+00 | -- | Inf
0.39/0.41 o 7
0.39/0.41 c * 0.3s| 21 | 16 | 502 | 15.6 | 923k| 19 | - | 112 | 74 | 112 | 138 | 162 | 2 | 124 | 3.000000e+00 | 7.000000e+00 | 133.33%
0.80/0.82 o 5
0.80/0.82 c * 0.7s| 106 | 45 | 1409 | 11.6 | 971k| 20 | - | 112 | 105 | 112 | 100 | 422 | 41 | 430 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.80/0.84 o 3
0.80/0.84 c * 0.7s| 124 | 0 | 1463 | 10.3 | 967k| 20 | - | 112 | 115 | 112 | 122 | 430 | 57 | 444 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.80/0.84 c
0.80/0.84 c SCIP Status : problem is solved [optimal solution found]
0.80/0.84 c Solving Time (sec) : 0.68
0.80/0.84 c Solving Nodes : 124
0.80/0.84 c Primal Bound : +3.00000000000000e+00 (3 solutions)
0.80/0.84 c Dual Bound : +3.00000000000000e+00
0.80/0.84 c Gap : 0.00 %
0.80/0.84 s OPTIMUM FOUND
0.80/0.84 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 -x43
0.80/0.84 v -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 -x5 -x4 -x3
0.80/0.84 v x2 x1
0.80/0.84 c SCIP Status : problem is solved [optimal solution found]
0.80/0.84 c Solving Time : 0.68
0.80/0.84 c Original Problem :
0.80/0.84 c Problem name : HOME/instance-2665029-1276647905.opb
0.80/0.84 c Variables : 160 (160 binary, 0 integer, 0 implicit integer, 0 continuous)
0.80/0.84 c Constraints : 109 initial, 109 maximal
0.80/0.84 c Presolved Problem :
0.80/0.84 c Problem name : t_HOME/instance-2665029-1276647905.opb
0.80/0.84 c Variables : 112 (112 binary, 0 integer, 0 implicit integer, 0 continuous)
0.80/0.84 c Constraints : 72 initial, 115 maximal
0.80/0.84 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.80/0.84 c trivial : 0.00 0 0 0 0 0 0 0 0
0.80/0.84 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.80/0.84 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.80/0.84 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.80/0.84 c implics : 0.00 0 0 0 0 0 0 0 0
0.80/0.84 c probing : 0.01 0 0 0 0 0 0 0 0
0.80/0.84 c and : 0.01 8 33 0 0 0 33 0 33
0.80/0.84 c linear : 0.00 2 5 0 0 0 0 0 15
0.80/0.84 c logicor : 0.00 0 0 0 0 0 0 0 0
0.80/0.84 c root node : - 19 - - 19 - - - -
0.80/0.84 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.80/0.84 c integral : 0 0 0 120 0 2 40 0 0 184
0.80/0.84 c and : 62 266 634 3 0 14 407 377 0 0
0.80/0.84 c linear : 4 6 620 3 0 21 244 0 0 0
0.80/0.84 c logicor : 6+ 6 207 3 0 0 27 0 0 0
0.80/0.84 c countsols : 0 0 0 3 0 0 0 0 0 0
0.80/0.84 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.80/0.84 c integral : 0.26 0.00 0.00 0.26 0.00
0.80/0.84 c and : 0.00 0.00 0.00 0.00 0.00
0.80/0.84 c linear : 0.03 0.00 0.03 0.00 0.00
0.80/0.84 c logicor : 0.00 0.00 0.00 0.00 0.00
0.80/0.84 c countsols : 0.00 0.00 0.00 0.00 0.00
0.80/0.84 c Propagators : Time Calls Cutoffs DomReds
0.80/0.84 c vbounds : 0.00 2 0 0
0.80/0.84 c rootredcost : 0.00 2 0 3
0.80/0.84 c pseudoobj : 0.00 399 0 12
0.80/0.84 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.80/0.84 c propagation : 0.01 35 33 134 16.3 10 9.8 -
0.80/0.84 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.80/0.84 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.80/0.84 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.80/0.84 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.80/0.84 c applied globally : - - - 57 12.4 - - -
0.80/0.84 c applied locally : - - - 0 0.0 - - -
0.80/0.84 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.80/0.84 c cut pool : 0.00 5 - - 31 - (maximal pool size: 232)
0.80/0.84 c redcost : 0.00 266 0 0 0 0
0.80/0.84 c impliedbounds : 0.00 6 0 0 29 0
0.80/0.84 c intobj : 0.00 0 0 0 0 0
0.80/0.84 c cgmip : 0.00 0 0 0 0 0
0.80/0.84 c gomory : 0.02 6 0 0 196 0
0.80/0.84 c strongcg : 0.01 6 0 0 328 0
0.80/0.84 c cmir : 0.03 6 0 0 47 0
0.80/0.84 c flowcover : 0.02 6 0 0 88 0
0.80/0.84 c clique : 0.00 6 0 0 1 0
0.80/0.84 c zerohalf : 0.00 0 0 0 0 0
0.80/0.84 c mcf : 0.00 1 0 0 0 0
0.80/0.84 c rapidlearning : 0.04 1 0 0 0 0
0.80/0.84 c Pricers : Time Calls Vars
0.80/0.84 c problem variables: 0.00 0 0
0.80/0.84 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.80/0.84 c relpscost : 0.26 117 2 40 0 0 184
0.80/0.84 c pscost : 0.00 0 0 0 0 0 0
0.80/0.84 c inference : 0.00 0 0 0 0 0 0
0.80/0.84 c mostinf : 0.00 0 0 0 0 0 0
0.80/0.84 c leastinf : 0.00 0 0 0 0 0 0
0.80/0.84 c fullstrong : 0.00 0 0 0 0 0 0
0.80/0.84 c allfullstrong : 0.00 0 0 0 0 0 0
0.80/0.84 c random : 0.00 0 0 0 0 0 0
0.80/0.84 c Primal Heuristics : Time Calls Found
0.80/0.84 c LP solutions : 0.00 - 3
0.80/0.84 c pseudo solutions : 0.00 - 0
0.80/0.84 c crossover : 0.00 0 0
0.80/0.84 c pscostdiving : 0.00 0 0
0.80/0.84 c fracdiving : 0.00 0 0
0.80/0.84 c veclendiving : 0.00 0 0
0.80/0.84 c objpscostdiving : 0.00 0 0
0.80/0.84 c rootsoldiving : 0.00 0 0
0.80/0.84 c linesearchdiving : 0.00 0 0
0.80/0.84 c guideddiving : 0.00 0 0
0.80/0.84 c intshifting : 0.00 0 0
0.80/0.84 c oneopt : 0.00 2 0
0.80/0.84 c coefdiving : 0.00 1 0
0.80/0.84 c feaspump : 0.01 1 0
0.80/0.84 c trivial : 0.00 2 0
0.80/0.84 c simplerounding : 0.00 0 0
0.80/0.84 c zirounding : 0.00 94 0
0.80/0.84 c rounding : 0.00 192 0
0.80/0.84 c shifting : 0.01 19 0
0.80/0.84 c twoopt : 0.00 0 0
0.80/0.84 c fixandinfer : 0.00 0 0
0.80/0.84 c intdiving : 0.00 0 0
0.80/0.84 c actconsdiving : 0.00 0 0
0.80/0.84 c octane : 0.00 0 0
0.80/0.84 c rens : 0.01 1 0
0.80/0.84 c rins : 0.00 0 0
0.80/0.84 c localbranching : 0.00 0 0
0.80/0.84 c mutation : 0.00 0 0
0.80/0.84 c dins : 0.00 0 0
0.80/0.84 c undercover : 0.00 1 0
0.80/0.84 c nlp : 0.00 0 0
0.80/0.84 c trysol : 0.00 0 0
0.80/0.84 c LP : Time Calls Iterations Iter/call Iter/sec
0.80/0.84 c primal LP : 0.01 0 0 0.00 0.00
0.80/0.84 c dual LP : 0.19 282 1460 5.18 7684.21
0.80/0.84 c lex dual LP : 0.00 0 0 0.00 -
0.80/0.84 c barrier LP : 0.00 0 0 0.00 -
0.80/0.84 c diving/probing LP: 0.00 3 3 1.00 -
0.80/0.84 c strong branching : 0.26 444 4210 9.48 16192.31
0.80/0.84 c (at root node) : - 9 381 42.33 -
0.80/0.84 c conflict analysis: 0.00 0 0 0.00 -
0.80/0.84 c B&B Tree :
0.80/0.84 c number of runs : 1
0.80/0.84 c nodes : 124
0.80/0.84 c nodes (total) : 124
0.80/0.84 c nodes left : 0
0.80/0.84 c max depth : 20
0.80/0.84 c max depth (total): 20
0.80/0.84 c backtracks : 15 (12.1%)
0.80/0.84 c delayed cutoffs : 6
0.80/0.84 c repropagations : 60 (169 domain reductions, 6 cutoffs)
0.80/0.84 c avg switch length: 3.23
0.80/0.84 c switching time : 0.02
0.80/0.84 c Solution :
0.80/0.84 c Solutions found : 3 (3 improvements)
0.80/0.84 c First Solution : +7.00000000000000e+00 (in run 1, after 21 nodes, 0.33 seconds, depth 19, found by <relaxation>)
0.80/0.84 c Primal Bound : +3.00000000000000e+00 (in run 1, after 124 nodes, 0.68 seconds, depth 19, found by <relaxation>)
0.80/0.84 c Dual Bound : +3.00000000000000e+00
0.80/0.84 c Gap : 0.00 %
0.80/0.84 c Root Dual Bound : +3.00000000000000e+00
0.80/0.84 c Root Iterations : 190
0.80/0.85 c Time complete: 0.84.