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-2703047-1278564422.opb>
0.00/0.01 c original problem has 216 variables (216 bin, 0 int, 0 impl, 0 cont) and 153 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, 20 chg coeffs, 0 upgd conss, 744 impls, 0 clqs
0.00/0.02 c (round 2) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 20 chg coeffs, 5 upgd conss, 766 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 154/212 (72.6%) - 0 fixings, 0 aggregations, 33 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 4 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 20 changed coefficients
0.00/0.03 c 832 implications, 0 cliques
0.00/0.03 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 153 constraints
0.00/0.03 c 143 constraints of type <and>
0.00/0.03 c 4 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: 1)
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.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 | 9 | - | 955k| 0 | 4 | 212 | 153 | 212 | 296 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.15 c 0.1s| 1 | 0 | 162 | - |1001k| 0 | 10 | 212 | 168 | 212 | 301 | 5 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 180 | - |1021k| 0 | 29 | 212 | 168 | 212 | 310 | 14 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 196 | - |1050k| 0 | 37 | 212 | 168 | 212 | 321 | 25 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 217 | - |1080k| 0 | 32 | 212 | 168 | 212 | 332 | 36 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 239 | - |1096k| 0 | 44 | 212 | 168 | 212 | 347 | 51 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 268 | - |1114k| 0 | 53 | 212 | 168 | 212 | 362 | 66 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.48 c 0.5s| 1 | 2 | 268 | - |1115k| 0 | 53 | 212 | 168 | 212 | 362 | 66 | 0 | 12 | 2.000000e+00 | -- | Inf
1.59/1.70 o 2
1.59/1.70 c * 1.7s| 155 | 0 | 2018 | 11.4 |1183k| 39 | - | 212 | 237 | 212 | 174 | 525 | 73 | 823 | 2.000000e+00 | 2.000000e+00 | 0.00%
1.59/1.70 c
1.59/1.70 c SCIP Status : problem is solved [optimal solution found]
1.59/1.70 c Solving Time (sec) : 1.69
1.59/1.70 c Solving Nodes : 155
1.59/1.70 c Primal Bound : +2.00000000000000e+00 (1 solutions)
1.59/1.70 c Dual Bound : +2.00000000000000e+00
1.59/1.70 c Gap : 0.00 %
1.69/1.70 s OPTIMUM FOUND
1.69/1.70 v -x72 x71 -x70 x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 x61 x48 x47 x46 x45 x44 -x43 -x60 -x59 -x58 -x57 -x56 x55 -x42 -x41 x40 x39
1.69/1.70 v x38 -x37 -x54 -x53 -x52 -x51 -x50 -x49 -x36 -x35 -x34 x33 x32 -x31 -x30 x29 -x28 x27 x26 x25 -x24 -x23 x22 -x21 -x20 x19 -x18
1.69/1.70 v -x17 x16 x15 -x14 x13 -x12 -x11 -x10 -x9 x8 x7 -x6 -x5 -x4 -x3 x2 -x1
1.69/1.70 c SCIP Status : problem is solved [optimal solution found]
1.69/1.70 c Solving Time : 1.69
1.69/1.70 c Original Problem :
1.69/1.70 c Problem name : HOME/instance-2703047-1278564422.opb
1.69/1.70 c Variables : 216 (216 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.70 c Constraints : 153 initial, 153 maximal
1.69/1.70 c Presolved Problem :
1.69/1.70 c Problem name : t_HOME/instance-2703047-1278564422.opb
1.69/1.70 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.70 c Constraints : 153 initial, 237 maximal
1.69/1.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.69/1.70 c trivial : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c implics : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c probing : 0.01 0 0 0 0 0 0 0 0
1.69/1.70 c and : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c linear : 0.00 1 3 0 0 0 0 0 20
1.69/1.70 c logicor : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c root node : - 0 - - 0 - - - -
1.69/1.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.69/1.70 c integral : 0 0 0 138 0 0 37 0 0 228
1.69/1.70 c and : 143 306 866 2 0 20 864 484 0 0
1.69/1.70 c linear : 4+ 7 846 1 0 31 348 5 0 0
1.69/1.70 c logicor : 6+ 6 241 0 0 3 67 0 0 0
1.69/1.70 c countsols : 0 0 0 1 0 0 0 0 0 0
1.69/1.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.69/1.70 c integral : 1.14 0.00 0.00 1.14 0.00
1.69/1.70 c and : 0.01 0.01 0.01 0.00 0.00
1.69/1.70 c linear : 0.02 0.00 0.02 0.00 0.00
1.69/1.70 c logicor : 0.00 0.00 0.00 0.00 0.00
1.69/1.70 c countsols : 0.00 0.00 0.00 0.00 0.00
1.69/1.70 c Propagators : Time Calls Cutoffs DomReds
1.69/1.70 c vbounds : 0.00 2 0 0
1.69/1.70 c rootredcost : 0.00 0 0 0
1.69/1.70 c pseudoobj : 0.00 548 0 0
1.69/1.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.69/1.70 c propagation : 0.01 54 47 406 33.2 2 10.5 -
1.69/1.70 c infeasible LP : 0.00 1 1 2 30.0 0 0.0 0
1.69/1.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.70 c applied globally : - - - 69 14.0 - - -
1.69/1.70 c applied locally : - - - 4 34.2 - - -
1.69/1.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.69/1.70 c cut pool : 0.00 5 - - 30 - (maximal pool size: 105)
1.69/1.70 c redcost : 0.00 306 0 0 0 0
1.69/1.70 c impliedbounds : 0.00 6 0 0 35 0
1.69/1.70 c intobj : 0.00 0 0 0 0 0
1.69/1.70 c cgmip : 0.00 0 0 0 0 0
1.69/1.70 c gomory : 0.06 6 0 0 24 0
1.69/1.70 c strongcg : 0.04 6 0 0 43 0
1.69/1.70 c cmir : 0.02 6 0 0 41 0
1.69/1.70 c flowcover : 0.03 6 0 0 82 0
1.69/1.70 c clique : 0.00 1 0 0 0 0
1.69/1.70 c zerohalf : 0.00 0 0 0 0 0
1.69/1.70 c mcf : 0.00 1 0 0 0 0
1.69/1.70 c rapidlearning : 0.08 1 0 0 0 15
1.69/1.70 c Pricers : Time Calls Vars
1.69/1.70 c problem variables: 0.00 0 0
1.69/1.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.69/1.70 c relpscost : 1.14 136 0 37 0 0 228
1.69/1.70 c pscost : 0.00 0 0 0 0 0 0
1.69/1.70 c inference : 0.00 0 0 0 0 0 0
1.69/1.70 c mostinf : 0.00 0 0 0 0 0 0
1.69/1.70 c leastinf : 0.00 0 0 0 0 0 0
1.69/1.70 c fullstrong : 0.00 0 0 0 0 0 0
1.69/1.70 c allfullstrong : 0.00 0 0 0 0 0 0
1.69/1.70 c random : 0.00 0 0 0 0 0 0
1.69/1.70 c Primal Heuristics : Time Calls Found
1.69/1.70 c LP solutions : 0.00 - 1
1.69/1.70 c pseudo solutions : 0.00 - 0
1.69/1.70 c oneopt : 0.00 0 0
1.69/1.70 c crossover : 0.00 0 0
1.69/1.70 c coefdiving : 0.00 0 0
1.69/1.70 c pscostdiving : 0.00 0 0
1.69/1.70 c fracdiving : 0.00 0 0
1.69/1.70 c veclendiving : 0.00 0 0
1.69/1.70 c objpscostdiving : 0.00 0 0
1.69/1.70 c rootsoldiving : 0.00 0 0
1.69/1.70 c linesearchdiving : 0.00 0 0
1.69/1.70 c guideddiving : 0.00 0 0
1.69/1.70 c intshifting : 0.00 0 0
1.69/1.70 c feaspump : 0.01 1 0
1.69/1.70 c trivial : 0.00 2 0
1.69/1.70 c simplerounding : 0.00 0 0
1.69/1.70 c zirounding : 0.00 113 0
1.69/1.70 c rounding : 0.01 209 0
1.69/1.70 c shifting : 0.01 22 0
1.69/1.70 c twoopt : 0.00 0 0
1.69/1.70 c fixandinfer : 0.00 0 0
1.69/1.70 c intdiving : 0.00 0 0
1.69/1.70 c actconsdiving : 0.00 0 0
1.69/1.70 c octane : 0.00 0 0
1.69/1.70 c rens : 0.02 1 0
1.69/1.70 c rins : 0.00 0 0
1.69/1.70 c localbranching : 0.00 0 0
1.69/1.70 c mutation : 0.00 0 0
1.69/1.70 c dins : 0.00 0 0
1.69/1.70 c undercover : 0.02 1 0
1.69/1.70 c nlp : 0.00 0 0
1.69/1.70 c trysol : 0.00 0 0
1.69/1.70 c LP : Time Calls Iterations Iter/call Iter/sec
1.69/1.70 c primal LP : 0.01 0 0 0.00 -
1.69/1.70 c dual LP : 0.15 323 1875 5.80 12668.83
1.69/1.70 c lex dual LP : 0.00 0 0 0.00 -
1.69/1.70 c barrier LP : 0.00 0 0 0.00 -
1.69/1.70 c diving/probing LP: 0.00 10 143 14.30 -
1.69/1.70 c strong branching : 1.13 823 14753 17.93 13067.13
1.69/1.70 c (at root node) : - 12 1274 106.17 -
1.69/1.70 c conflict analysis: 0.00 0 0 0.00 -
1.69/1.70 c B&B Tree :
1.69/1.70 c number of runs : 1
1.69/1.70 c nodes : 155
1.69/1.70 c nodes (total) : 155
1.69/1.70 c nodes left : 0
1.69/1.70 c max depth : 39
1.69/1.70 c max depth (total): 39
1.69/1.70 c backtracks : 19 (12.3%)
1.69/1.70 c delayed cutoffs : 15
1.69/1.70 c repropagations : 50 (245 domain reductions, 15 cutoffs)
1.69/1.70 c avg switch length: 2.70
1.69/1.70 c switching time : 0.01
1.69/1.70 c Solution :
1.69/1.70 c Solutions found : 1 (1 improvements)
1.69/1.70 c First Solution : +2.00000000000000e+00 (in run 1, after 155 nodes, 1.68 seconds, depth 34, found by <relaxation>)
1.69/1.70 c Primal Bound : +2.00000000000000e+00 (in run 1, after 155 nodes, 1.68 seconds, depth 34, found by <relaxation>)
1.69/1.70 c Dual Bound : +2.00000000000000e+00
1.69/1.70 c Gap : 0.00 %
1.69/1.70 c Root Dual Bound : +2.00000000000000e+00
1.69/1.70 c Root Iterations : 268
1.69/1.71 c Time complete: 1.7.