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-2703091-1278564457.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 190 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1264 impls, 0 clqs
0.00/0.03 c (round 2) 10 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 8 upgd conss, 1286 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 176/270 (65.2%) - 0 fixings, 0 aggregations, 29 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 10 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 24 changed coefficients
0.00/0.04 c 1344 implications, 0 cliques
0.00/0.04 c presolved problem has 270 variables (270 bin, 0 int, 0 impl, 0 cont) and 190 constraints
0.00/0.04 c 174 constraints of type <and>
0.00/0.04 c 7 constraints of type <linear>
0.00/0.04 c 9 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
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.3
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 = 1790
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = 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 | 20 | - |1187k| 0 | 11 | 270 | 190 | 270 | 361 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.07/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.07/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.07/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.07/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.07/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.07/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.07/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.07/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.19 c 0.2s| 1 | 0 | 282 | - |1214k| 0 | 21 | 270 | 190 | 270 | 367 | 6 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 302 | - |1252k| 0 | 31 | 270 | 190 | 270 | 399 | 38 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 336 | - |1292k| 0 | 31 | 270 | 190 | 270 | 412 | 51 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 387 | - |1341k| 0 | 56 | 270 | 190 | 270 | 434 | 73 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 418 | - |1374k| 0 | 69 | 270 | 190 | 270 | 449 | 88 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 468 | - |1396k| 0 | 78 | 270 | 190 | 270 | 463 | 102 | 0 | 0 | 2.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 2 | 468 | - |1397k| 0 | 78 | 270 | 190 | 270 | 463 | 102 | 0 | 10 | 2.000000e+00 | -- | Inf
4.89/4.98 o 2
4.89/4.98 c * 5.0s| 1210 | 0 | 16988 | 13.7 |1997k| 53 | - | 270 |1161 | 270 | 211 |4556 | 971 |1764 | 2.000000e+00 | 2.000000e+00 | 0.00%
4.89/4.98 c
4.89/4.98 c SCIP Status : problem is solved [optimal solution found]
4.89/4.98 c Solving Time (sec) : 4.97
4.89/4.98 c Solving Nodes : 1210
4.89/4.98 c Primal Bound : +2.00000000000000e+00 (1 solutions)
4.89/4.98 c Dual Bound : +2.00000000000000e+00
4.89/4.98 c Gap : 0.00 %
4.89/4.98 s OPTIMUM FOUND
4.89/4.98 v -x105 -x104 x103 -x102 -x101 -x100 x99 -x98 -x97 x96 x70 -x69 x68 x67 -x66 -x95 -x94 -x93 -x92 -x91 -x65 x64 -x63 x62 -x61 -x90
4.89/4.98 v x89 x88 x87 -x86 -x60 -x59 -x58 x57 -x56 -x85 -x84 -x83 -x82 x81 x55 -x54 -x53 x52 -x51 -x80 -x79 -x78 -x77 x76 -x50 x49 -x48
4.89/4.98 v x47 -x46 -x75 -x74 -x73 -x72 -x71 -x45 -x44 x43 x42 -x41 -x40 -x39 x38 x37 x36 x35 x34 x33 x32 x31 -x30 -x29 x28 -x27 x26 x25
4.89/4.98 v x24 -x23 -x22 x21 -x20 -x19 x18 -x17 x16 -x15 -x14 x13 x12 x11 -x10 -x9 -x8 x7 x6 -x5 -x4 -x3 x2 -x1
4.89/4.98 c SCIP Status : problem is solved [optimal solution found]
4.89/4.98 c Solving Time : 4.97
4.89/4.98 c Original Problem :
4.89/4.98 c Problem name : HOME/instance-2703091-1278564457.opb
4.89/4.98 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.98 c Constraints : 190 initial, 190 maximal
4.89/4.98 c Presolved Problem :
4.89/4.98 c Problem name : t_HOME/instance-2703091-1278564457.opb
4.89/4.98 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.98 c Constraints : 190 initial, 1161 maximal
4.89/4.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.89/4.98 c trivial : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c implics : 0.00 0 2 0 0 0 0 0 0
4.89/4.98 c probing : 0.01 0 0 0 0 0 0 0 0
4.89/4.98 c and : 0.01 0 0 0 0 0 0 0 0
4.89/4.98 c linear : 0.00 1 7 0 0 0 0 0 24
4.89/4.98 c logicor : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c root node : - 0 - - 0 - - - -
4.89/4.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.89/4.98 c integral : 0 0 0 1031 0 0 133 0 0 1970
4.89/4.98 c and : 174 2312 4621 1 0 97 6234 4482 0 0
4.89/4.98 c linear : 7 6 4524 1 0 220 2167 0 0 0
4.89/4.98 c logicor : 9+ 6 1917 1 0 17 439 0 0 0
4.89/4.98 c countsols : 0 0 0 1 0 0 0 0 0 0
4.89/4.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.89/4.98 c integral : 2.26 0.00 0.00 2.26 0.00
4.89/4.98 c and : 0.12 0.08 0.04 0.00 0.00
4.89/4.98 c linear : 0.05 0.00 0.05 0.00 0.00
4.89/4.98 c logicor : 0.02 0.00 0.02 0.00 0.00
4.89/4.98 c countsols : 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c Propagators : Time Calls Cutoffs DomReds
4.89/4.98 c vbounds : 0.00 2 0 0
4.89/4.98 c rootredcost : 0.00 0 0 0
4.89/4.98 c pseudoobj : 0.00 4254 0 0
4.89/4.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.89/4.98 c propagation : 0.03 334 334 2056 19.9 74 17.7 -
4.89/4.98 c infeasible LP : 0.00 8 8 32 20.2 4 9.5 0
4.89/4.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.98 c applied globally : - - - 971 16.4 - - -
4.89/4.98 c applied locally : - - - 0 0.0 - - -
4.89/4.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.89/4.98 c cut pool : 0.00 5 - - 27 - (maximal pool size: 195)
4.89/4.98 c redcost : 0.02 2312 0 0 0 0
4.89/4.98 c impliedbounds : 0.00 6 0 0 60 0
4.89/4.98 c intobj : 0.00 0 0 0 0 0
4.89/4.98 c cgmip : 0.00 0 0 0 0 0
4.89/4.98 c gomory : 0.05 6 0 0 62 0
4.89/4.98 c strongcg : 0.04 6 0 0 165 0
4.89/4.98 c cmir : 0.02 6 0 0 47 0
4.89/4.98 c flowcover : 0.04 6 0 0 100 0
4.89/4.98 c clique : 0.00 6 0 0 0 0
4.89/4.98 c zerohalf : 0.00 0 0 0 0 0
4.89/4.98 c mcf : 0.00 1 0 0 0 0
4.89/4.98 c rapidlearning : 0.10 1 0 0 0 0
4.89/4.98 c Pricers : Time Calls Vars
4.89/4.98 c problem variables: 0.00 0 0
4.89/4.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.89/4.98 c relpscost : 2.26 1030 0 133 0 0 1970
4.89/4.98 c pscost : 0.00 0 0 0 0 0 0
4.89/4.98 c inference : 0.00 0 0 0 0 0 0
4.89/4.98 c mostinf : 0.00 0 0 0 0 0 0
4.89/4.98 c leastinf : 0.00 0 0 0 0 0 0
4.89/4.98 c fullstrong : 0.00 0 0 0 0 0 0
4.89/4.98 c allfullstrong : 0.00 0 0 0 0 0 0
4.89/4.98 c random : 0.00 0 0 0 0 0 0
4.89/4.98 c Primal Heuristics : Time Calls Found
4.89/4.98 c LP solutions : 0.00 - 1
4.89/4.98 c pseudo solutions : 0.00 - 0
4.89/4.98 c oneopt : 0.00 0 0
4.89/4.98 c crossover : 0.00 0 0
4.89/4.98 c guideddiving : 0.00 0 0
4.89/4.98 c intshifting : 0.00 0 0
4.89/4.98 c pscostdiving : 0.03 2 0
4.89/4.98 c fracdiving : 0.02 2 0
4.89/4.98 c veclendiving : 0.01 2 0
4.89/4.98 c linesearchdiving : 0.01 2 0
4.89/4.98 c coefdiving : 0.02 3 0
4.89/4.98 c feaspump : 0.01 2 0
4.89/4.98 c objpscostdiving : 0.02 2 0
4.89/4.98 c rootsoldiving : 0.02 2 0
4.89/4.98 c trivial : 0.00 2 0
4.89/4.98 c simplerounding : 0.00 0 0
4.89/4.98 c zirounding : 0.02 976 0
4.89/4.98 c rounding : 0.04 680 0
4.89/4.98 c shifting : 0.22 198 0
4.89/4.98 c twoopt : 0.00 0 0
4.89/4.98 c fixandinfer : 0.00 0 0
4.89/4.98 c intdiving : 0.00 0 0
4.89/4.98 c actconsdiving : 0.00 0 0
4.89/4.98 c octane : 0.00 0 0
4.89/4.98 c rens : 0.02 1 0
4.89/4.98 c rins : 0.00 0 0
4.89/4.98 c localbranching : 0.00 0 0
4.89/4.98 c mutation : 0.00 0 0
4.89/4.98 c dins : 0.00 0 0
4.89/4.98 c undercover : 0.02 1 0
4.89/4.98 c nlp : 0.00 0 0
4.89/4.98 c trysol : 0.00 0 0
4.89/4.98 c LP : Time Calls Iterations Iter/call Iter/sec
4.89/4.98 c primal LP : 0.05 0 0 0.00 0.00
4.89/4.98 c dual LP : 1.31 2370 15736 6.64 12003.43
4.89/4.98 c lex dual LP : 0.00 0 0 0.00 -
4.89/4.98 c barrier LP : 0.00 0 0 0.00 -
4.89/4.98 c diving/probing LP: 0.10 337 1252 3.72 12647.10
4.89/4.98 c strong branching : 2.23 1764 23170 13.13 10395.10
4.89/4.98 c (at root node) : - 10 959 95.90 -
4.89/4.98 c conflict analysis: 0.00 0 0 0.00 -
4.89/4.98 c B&B Tree :
4.89/4.98 c number of runs : 1
4.89/4.98 c nodes : 1210
4.89/4.98 c nodes (total) : 1210
4.89/4.98 c nodes left : 0
4.89/4.98 c max depth : 53
4.89/4.98 c max depth (total): 53
4.89/4.98 c backtracks : 123 (10.2%)
4.89/4.98 c delayed cutoffs : 101
4.89/4.98 c repropagations : 442 (1695 domain reductions, 73 cutoffs)
4.89/4.98 c avg switch length: 3.28
4.89/4.98 c switching time : 0.11
4.89/4.98 c Solution :
4.89/4.98 c Solutions found : 1 (1 improvements)
4.89/4.98 c First Solution : +2.00000000000000e+00 (in run 1, after 1210 nodes, 4.97 seconds, depth 50, found by <relaxation>)
4.89/4.98 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1210 nodes, 4.97 seconds, depth 50, found by <relaxation>)
4.89/4.98 c Dual Bound : +2.00000000000000e+00
4.89/4.98 c Gap : 0.00 %
4.89/4.98 c Root Dual Bound : +2.00000000000000e+00
4.89/4.98 c Root Iterations : 468
4.89/4.99 c Time complete: 4.99.