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-2664937-1276645904.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) 18 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 23 chg coeffs, 0 upgd conss, 882 impls, 0 clqs
0.00/0.03 c (round 3) 28 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 31 chg coeffs, 5 upgd conss, 1042 impls, 0 clqs
0.00/0.03 c (round 4) 38 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 39 chg coeffs, 5 upgd conss, 1122 impls, 0 clqs
0.00/0.03 c (round 5) 48 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 5 upgd conss, 1122 impls, 0 clqs
0.00/0.04 c presolving (6 rounds):
0.00/0.04 c 48 deleted vars, 32 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 47 changed coefficients
0.00/0.04 c 1146 implications, 0 cliques
0.00/0.04 c presolved problem has 112 variables (112 bin, 0 int, 0 impl, 0 cont) and 73 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 7 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.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 | - | 629k| 0 | 5 | 112 | 73 | 112 | 133 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 24 | - | 647k| 0 | 20 | 112 | 73 | 112 | 140 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 39 | - | 687k| 0 | 30 | 112 | 73 | 112 | 149 | 16 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 67 | - | 722k| 0 | 42 | 112 | 73 | 112 | 161 | 28 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 95 | - | 765k| 0 | 47 | 112 | 73 | 112 | 171 | 38 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.20 c 0.1s| 1 | 0 | 130 | - | 784k| 0 | 56 | 112 | 73 | 112 | 184 | 51 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 202 | - | 808k| 0 | 60 | 112 | 73 | 112 | 197 | 64 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 2 | 202 | - | 809k| 0 | 60 | 112 | 73 | 112 | 197 | 64 | 0 | 10 | 3.000000e+00 | -- | Inf
1.19/1.22 o 3
1.19/1.22 c * 1.0s| 257 | 0 | 2279 | 8.1 | 904k| 21 | - | 112 | 182 | 112 | 120 | 580 | 109 | 632 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.19/1.22 c
1.19/1.22 c SCIP Status : problem is solved [optimal solution found]
1.19/1.22 c Solving Time (sec) : 1.00
1.19/1.22 c Solving Nodes : 257
1.19/1.22 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.19/1.22 c Dual Bound : +3.00000000000000e+00
1.19/1.22 c Gap : 0.00 %
1.19/1.22 s OPTIMUM FOUND
1.19/1.22 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 x42
1.19/1.22 v -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
1.19/1.22 v x2 x1
1.19/1.22 c SCIP Status : problem is solved [optimal solution found]
1.19/1.22 c Solving Time : 1.00
1.19/1.22 c Original Problem :
1.19/1.22 c Problem name : HOME/instance-2664937-1276645904.opb
1.19/1.22 c Variables : 160 (160 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.22 c Constraints : 109 initial, 109 maximal
1.19/1.22 c Presolved Problem :
1.19/1.22 c Problem name : t_HOME/instance-2664937-1276645904.opb
1.19/1.22 c Variables : 112 (112 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.22 c Constraints : 73 initial, 182 maximal
1.19/1.22 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.19/1.22 c trivial : 0.00 0 0 0 0 0 0 0 0
1.19/1.22 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.19/1.22 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.19/1.22 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.19/1.22 c implics : 0.00 0 0 0 0 0 0 0 0
1.19/1.22 c probing : 0.01 0 0 0 0 0 0 0 0
1.19/1.22 c and : 0.00 8 32 0 0 0 32 0 32
1.19/1.22 c linear : 0.00 3 5 0 0 0 0 0 15
1.19/1.22 c logicor : 0.00 0 0 0 0 0 0 0 0
1.19/1.22 c root node : - 0 - - 0 - - - -
1.19/1.22 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.19/1.22 c integral : 0 0 0 224 0 2 31 0 0 408
1.19/1.22 c and : 62 477 892 1 0 24 714 533 0 0
1.19/1.22 c linear : 4 6 868 1 0 38 475 0 0 0
1.19/1.22 c logicor : 7+ 6 309 0 0 4 49 0 0 0
1.19/1.22 c countsols : 0 0 0 1 0 0 0 0 0 0
1.19/1.22 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.19/1.22 c integral : 0.48 0.00 0.00 0.48 0.00
1.19/1.22 c and : 0.01 0.01 0.00 0.00 0.00
1.19/1.22 c linear : 0.01 0.00 0.01 0.00 0.00
1.19/1.22 c logicor : 0.00 0.00 0.00 0.00 0.00
1.19/1.22 c countsols : 0.00 0.00 0.00 0.00 0.00
1.19/1.22 c Propagators : Time Calls Cutoffs DomReds
1.19/1.22 c vbounds : 0.00 2 0 0
1.19/1.22 c rootredcost : 0.00 0 0 0
1.19/1.22 c pseudoobj : 0.00 657 0 0
1.19/1.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.19/1.22 c propagation : 0.00 66 65 369 19.4 4 10.0 -
1.19/1.22 c infeasible LP : 0.00 1 1 2 6.0 0 0.0 0
1.19/1.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.22 c applied globally : - - - 109 12.9 - - -
1.19/1.22 c applied locally : - - - 0 0.0 - - -
1.19/1.22 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.19/1.22 c cut pool : 0.00 5 - - 41 - (maximal pool size: 173)
1.19/1.22 c redcost : 0.00 477 0 0 0 0
1.19/1.22 c impliedbounds : 0.00 6 0 0 30 0
1.19/1.22 c intobj : 0.00 0 0 0 0 0
1.19/1.22 c cgmip : 0.00 0 0 0 0 0
1.19/1.22 c gomory : 0.03 6 0 0 72 0
1.19/1.22 c strongcg : 0.01 6 0 0 182 0
1.19/1.22 c cmir : 0.02 6 0 0 58 0
1.19/1.22 c flowcover : 0.04 6 0 0 105 0
1.19/1.22 c clique : 0.00 1 0 0 0 0
1.19/1.22 c zerohalf : 0.00 0 0 0 0 0
1.19/1.22 c mcf : 0.00 1 0 0 0 0
1.19/1.22 c rapidlearning : 0.04 1 0 0 0 0
1.19/1.22 c Pricers : Time Calls Vars
1.19/1.22 c problem variables: 0.00 0 0
1.19/1.22 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.19/1.22 c relpscost : 0.48 223 2 31 0 0 408
1.19/1.22 c pscost : 0.00 0 0 0 0 0 0
1.19/1.22 c inference : 0.00 0 0 0 0 0 0
1.19/1.22 c mostinf : 0.00 0 0 0 0 0 0
1.19/1.22 c leastinf : 0.00 0 0 0 0 0 0
1.19/1.22 c fullstrong : 0.00 0 0 0 0 0 0
1.19/1.22 c allfullstrong : 0.00 0 0 0 0 0 0
1.19/1.22 c random : 0.00 0 0 0 0 0 0
1.19/1.22 c Primal Heuristics : Time Calls Found
1.19/1.22 c LP solutions : 0.00 - 1
1.19/1.22 c pseudo solutions : 0.00 - 0
1.19/1.22 c oneopt : 0.00 0 0
1.19/1.22 c crossover : 0.00 0 0
1.19/1.22 c fracdiving : 0.00 0 0
1.19/1.22 c veclendiving : 0.00 0 0
1.19/1.22 c objpscostdiving : 0.00 0 0
1.19/1.22 c rootsoldiving : 0.00 0 0
1.19/1.22 c linesearchdiving : 0.00 0 0
1.19/1.22 c guideddiving : 0.00 0 0
1.19/1.22 c coefdiving : 0.00 1 0
1.19/1.22 c pscostdiving : 0.00 1 0
1.19/1.22 c feaspump : 0.00 1 0
1.19/1.22 c trivial : 0.00 2 0
1.19/1.22 c simplerounding : 0.00 0 0
1.19/1.22 c zirounding : 0.00 204 0
1.19/1.22 c rounding : 0.02 259 0
1.19/1.22 c shifting : 0.04 57 0
1.19/1.22 c intshifting : 0.00 0 0
1.19/1.22 c twoopt : 0.00 0 0
1.19/1.22 c fixandinfer : 0.00 0 0
1.19/1.22 c intdiving : 0.00 0 0
1.19/1.22 c actconsdiving : 0.00 0 0
1.19/1.22 c octane : 0.00 0 0
1.19/1.22 c rens : 0.00 0 0
1.19/1.22 c rins : 0.00 0 0
1.19/1.22 c localbranching : 0.00 0 0
1.19/1.22 c mutation : 0.00 0 0
1.19/1.22 c dins : 0.00 0 0
1.19/1.22 c undercover : 0.00 1 0
1.19/1.22 c nlp : 0.00 0 0
1.19/1.22 c trysol : 0.00 0 0
1.19/1.22 c LP : Time Calls Iterations Iter/call Iter/sec
1.19/1.22 c primal LP : 0.01 0 0 0.00 0.00
1.19/1.22 c dual LP : 0.22 504 2270 4.50 10318.18
1.19/1.22 c lex dual LP : 0.00 0 0 0.00 -
1.19/1.22 c barrier LP : 0.00 0 0 0.00 -
1.19/1.22 c diving/probing LP: 0.00 6 9 1.50 -
1.19/1.22 c strong branching : 0.48 632 7189 11.38 14977.08
1.19/1.22 c (at root node) : - 10 677 67.70 -
1.19/1.22 c conflict analysis: 0.00 0 0 0.00 -
1.19/1.22 c B&B Tree :
1.19/1.22 c number of runs : 1
1.19/1.22 c nodes : 257
1.19/1.22 c nodes (total) : 257
1.19/1.22 c nodes left : 0
1.19/1.22 c max depth : 21
1.19/1.22 c max depth (total): 21
1.19/1.22 c backtracks : 29 (11.3%)
1.19/1.22 c delayed cutoffs : 16
1.19/1.22 c repropagations : 46 (218 domain reductions, 16 cutoffs)
1.19/1.22 c avg switch length: 2.47
1.19/1.22 c switching time : 0.02
1.19/1.22 c Solution :
1.19/1.22 c Solutions found : 1 (1 improvements)
1.19/1.22 c First Solution : +3.00000000000000e+00 (in run 1, after 257 nodes, 1.00 seconds, depth 19, found by <relaxation>)
1.19/1.22 c Primal Bound : +3.00000000000000e+00 (in run 1, after 257 nodes, 1.00 seconds, depth 19, found by <relaxation>)
1.19/1.22 c Dual Bound : +3.00000000000000e+00
1.19/1.22 c Gap : 0.00 %
1.19/1.22 c Root Dual Bound : +3.00000000000000e+00
1.19/1.22 c Root Iterations : 202
1.19/1.22 c Time complete: 1.22.