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-2703083-1278564452.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.06/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.06/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.06/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.15 c 0.1s| 1 | 0 | 258 | - | 999k| 0 | 12 | 212 | 166 | 212 | 301 | 5 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.16 c 0.2s| 1 | 0 | 278 | - |1009k| 0 | 31 | 212 | 166 | 212 | 309 | 13 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.19 c 0.2s| 1 | 0 | 294 | - |1024k| 0 | 42 | 212 | 166 | 212 | 320 | 24 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 315 | - |1040k| 0 | 50 | 212 | 166 | 212 | 329 | 33 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 342 | - |1051k| 0 | 58 | 212 | 166 | 212 | 337 | 41 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 384 | - |1067k| 0 | 60 | 212 | 166 | 212 | 348 | 52 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.40 c 0.4s| 1 | 2 | 384 | - |1068k| 0 | 60 | 212 | 166 | 212 | 348 | 52 | 0 | 12 | 2.000000e+00 | -- | Inf
1.29/1.38 o 37
1.29/1.38 c * 1.4s| 188 | 104 | 2139 | 9.4 |1249k| 34 | - | 212 | 295 | 212 | 170 | 533 | 129 | 818 | 2.000000e+00 | 3.700000e+01 |1750.00%
1.69/1.70 o 10
1.69/1.70 c * 1.7s| 345 | 182 | 3259 | 8.4 |1393k| 36 | - | 212 | 401 | 212 | 165 | 861 | 235 |1052 | 2.000000e+00 | 1.000000e+01 | 400.00%
1.79/1.85 o 7
1.79/1.85 c * 1.8s| 463 | 234 | 3934 | 7.7 |1477k| 36 | - | 212 | 441 | 212 | 163 |1042 | 301 |1116 | 2.000000e+00 | 7.000000e+00 | 250.00%
2.79/2.80 o 2
2.79/2.80 c * 2.8s| 1133 | 0 | 8417 | 7.1 |1472k| 36 | - | 212 | 817 | 212 | 148 |2410 | 690 |1405 | 2.000000e+00 | 2.000000e+00 | 0.00%
2.79/2.80 c
2.79/2.80 c SCIP Status : problem is solved [optimal solution found]
2.79/2.80 c Solving Time (sec) : 2.79
2.79/2.80 c Solving Nodes : 1133
2.79/2.80 c Primal Bound : +2.00000000000000e+00 (4 solutions)
2.79/2.80 c Dual Bound : +2.00000000000000e+00
2.79/2.80 c Gap : 0.00 %
2.79/2.80 s OPTIMUM FOUND
2.79/2.80 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
2.79/2.80 v x39 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
2.79/2.80 v x19 -x18 -x17 -x16 x15 x14 x13 x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 x2 -x1
2.79/2.80 c SCIP Status : problem is solved [optimal solution found]
2.79/2.80 c Solving Time : 2.79
2.79/2.80 c Original Problem :
2.79/2.80 c Problem name : HOME/instance-2703083-1278564452.opb
2.79/2.80 c Variables : 216 (216 binary, 0 integer, 0 implicit integer, 0 continuous)
2.79/2.80 c Constraints : 153 initial, 153 maximal
2.79/2.80 c Presolved Problem :
2.79/2.80 c Problem name : t_HOME/instance-2703083-1278564452.opb
2.79/2.80 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
2.79/2.80 c Constraints : 153 initial, 817 maximal
2.79/2.80 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.79/2.80 c trivial : 0.00 0 0 0 0 0 0 0 0
2.79/2.80 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.79/2.80 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.79/2.80 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.79/2.80 c implics : 0.00 0 0 0 0 0 0 0 0
2.79/2.80 c probing : 0.01 0 0 0 0 0 0 0 0
2.79/2.80 c and : 0.01 0 0 0 0 0 0 0 0
2.79/2.80 c linear : 0.00 1 3 0 0 0 0 0 20
2.79/2.80 c logicor : 0.00 0 0 0 0 0 0 0 0
2.79/2.80 c root node : - 24 - - 24 - - - -
2.79/2.80 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.79/2.80 c integral : 0 0 0 964 0 0 133 0 0 1800
2.79/2.80 c and : 143 1923 4271 1 0 127 6287 2383 0 0
2.79/2.80 c linear : 4+ 7 4142 1 0 202 2356 14 0 0
2.79/2.80 c logicor : 6+ 6 1854 2 0 9 469 0 0 0
2.79/2.80 c countsols : 0 0 0 4 0 0 0 0 0 0
2.79/2.80 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.79/2.80 c integral : 1.17 0.00 0.00 1.17 0.00
2.79/2.80 c and : 0.08 0.03 0.04 0.00 0.00
2.79/2.80 c linear : 0.09 0.00 0.09 0.00 0.00
2.79/2.80 c logicor : 0.02 0.00 0.02 0.00 0.00
2.79/2.80 c countsols : 0.00 0.00 0.00 0.00 0.00
2.79/2.80 c Propagators : Time Calls Cutoffs DomReds
2.79/2.80 c vbounds : 0.00 2 0 0
2.79/2.80 c rootredcost : 0.01 3 0 3
2.79/2.80 c pseudoobj : 0.00 3961 0 18
2.79/2.80 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.79/2.80 c propagation : 0.04 338 336 3152 31.9 63 17.3 -
2.79/2.80 c infeasible LP : 0.00 4 4 46 40.3 0 0.0 0
2.79/2.80 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.79/2.80 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.79/2.80 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.79/2.80 c applied globally : - - - 689 18.4 - - -
2.79/2.80 c applied locally : - - - 1 35.0 - - -
2.79/2.80 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.79/2.80 c cut pool : 0.00 5 - - 30 - (maximal pool size: 87)
2.79/2.80 c redcost : 0.02 1926 0 5 0 0
2.79/2.80 c impliedbounds : 0.00 6 0 0 21 0
2.79/2.80 c intobj : 0.00 0 0 0 0 0
2.79/2.80 c cgmip : 0.00 0 0 0 0 0
2.79/2.80 c gomory : 0.05 6 0 0 24 0
2.79/2.80 c strongcg : 0.04 6 0 0 24 0
2.79/2.80 c cmir : 0.02 6 0 0 46 0
2.79/2.80 c flowcover : 0.03 6 0 0 83 0
2.79/2.80 c clique : 0.00 1 0 0 0 0
2.79/2.80 c zerohalf : 0.00 0 0 0 0 0
2.79/2.80 c mcf : 0.00 1 0 0 0 0
2.79/2.80 c rapidlearning : 0.08 1 0 0 0 13
2.79/2.80 c Pricers : Time Calls Vars
2.79/2.80 c problem variables: 0.00 0 0
2.79/2.80 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.79/2.80 c relpscost : 1.17 960 0 133 0 0 1800
2.79/2.80 c pscost : 0.00 0 0 0 0 0 0
2.79/2.80 c inference : 0.00 0 0 0 0 0 0
2.79/2.80 c mostinf : 0.00 0 0 0 0 0 0
2.79/2.80 c leastinf : 0.00 0 0 0 0 0 0
2.79/2.80 c fullstrong : 0.00 0 0 0 0 0 0
2.79/2.80 c allfullstrong : 0.00 0 0 0 0 0 0
2.79/2.80 c random : 0.00 0 0 0 0 0 0
2.79/2.80 c Primal Heuristics : Time Calls Found
2.79/2.80 c LP solutions : 0.00 - 4
2.79/2.80 c pseudo solutions : 0.00 - 0
2.79/2.80 c intshifting : 0.00 0 0
2.79/2.80 c oneopt : 0.00 3 0
2.79/2.80 c coefdiving : 0.00 1 0
2.79/2.80 c pscostdiving : 0.00 1 0
2.79/2.80 c fracdiving : 0.00 1 0
2.79/2.80 c veclendiving : 0.00 1 0
2.79/2.80 c linesearchdiving : 0.00 1 0
2.79/2.80 c guideddiving : 0.00 1 0
2.79/2.80 c feaspump : 0.01 1 0
2.79/2.80 c objpscostdiving : 0.00 1 0
2.79/2.80 c rootsoldiving : 0.01 1 0
2.79/2.80 c crossover : 0.03 1 0
2.79/2.80 c trivial : 0.00 2 0
2.79/2.80 c simplerounding : 0.00 0 0
2.79/2.80 c zirounding : 0.01 898 0
2.79/2.80 c rounding : 0.02 594 0
2.79/2.80 c shifting : 0.06 111 0
2.79/2.80 c twoopt : 0.00 0 0
2.79/2.80 c fixandinfer : 0.00 0 0
2.79/2.80 c intdiving : 0.00 0 0
2.79/2.80 c actconsdiving : 0.00 0 0
2.79/2.80 c octane : 0.00 0 0
2.79/2.80 c rens : 0.04 1 0
2.79/2.80 c rins : 0.00 0 0
2.79/2.80 c localbranching : 0.00 0 0
2.79/2.80 c mutation : 0.00 0 0
2.79/2.80 c dins : 0.00 0 0
2.79/2.80 c undercover : 0.02 1 0
2.79/2.80 c nlp : 0.00 0 0
2.79/2.80 c trysol : 0.00 0 0
2.79/2.80 c LP : Time Calls Iterations Iter/call Iter/sec
2.79/2.80 c primal LP : 0.02 0 0 0.00 0.00
2.79/2.80 c dual LP : 0.65 1978 7930 4.01 12218.95
2.79/2.80 c lex dual LP : 0.00 0 0 0.00 -
2.79/2.80 c barrier LP : 0.00 0 0 0.00 -
2.79/2.80 c diving/probing LP: 0.02 62 487 7.85 22136.36
2.79/2.80 c strong branching : 1.15 1405 14020 9.98 12202.10
2.79/2.80 c (at root node) : - 12 508 42.33 -
2.79/2.80 c conflict analysis: 0.00 0 0 0.00 -
2.79/2.80 c B&B Tree :
2.79/2.80 c number of runs : 1
2.79/2.80 c nodes : 1133
2.79/2.80 c nodes (total) : 1133
2.79/2.80 c nodes left : 0
2.79/2.80 c max depth : 36
2.79/2.80 c max depth (total): 36
2.79/2.80 c backtracks : 132 (11.7%)
2.79/2.80 c delayed cutoffs : 98
2.79/2.80 c repropagations : 529 (2101 domain reductions, 93 cutoffs)
2.79/2.80 c avg switch length: 3.45
2.79/2.80 c switching time : 0.07
2.79/2.80 c Solution :
2.79/2.80 c Solutions found : 4 (4 improvements)
2.79/2.80 c First Solution : +3.70000000000000e+01 (in run 1, after 188 nodes, 1.37 seconds, depth 34, found by <relaxation>)
2.79/2.80 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1133 nodes, 2.79 seconds, depth 28, found by <relaxation>)
2.79/2.80 c Dual Bound : +2.00000000000000e+00
2.79/2.80 c Gap : 0.00 %
2.79/2.80 c Root Dual Bound : +2.00000000000000e+00
2.79/2.80 c Root Iterations : 384
2.79/2.81 c Time complete: 2.81.