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-2703127-1278564500.opb>
0.00/0.01 c original problem has 324 variables (324 bin, 0 int, 0 impl, 0 cont) and 229 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.03 c (round 1) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 0 upgd conss, 1284 impls, 0 clqs
0.00/0.03 c (round 2) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 7 upgd conss, 1306 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 178/318 (56.0%) - 0 fixings, 0 aggregations, 37 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 6 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 28 changed coefficients
0.00/0.04 c 1380 implications, 0 cliques
0.00/0.04 c presolved problem has 318 variables (318 bin, 0 int, 0 impl, 0 cont) and 229 constraints
0.00/0.04 c 215 constraints of type <and>
0.00/0.04 c 6 constraints of type <linear>
0.00/0.04 c 8 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.03
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.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c heuristics/undercover/freq = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 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 | - |1372k| 0 | 4 | 318 | 229 | 318 | 444 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.00/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.19/0.22 c 0.2s| 1 | 0 | 317 | - |1521k| 0 | 7 | 318 | 305 | 318 | 448 | 4 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 330 | - |1542k| 0 | 13 | 318 | 305 | 318 | 466 | 22 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 344 | - |1571k| 0 | 23 | 318 | 305 | 318 | 474 | 30 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 361 | - |1581k| 0 | 38 | 318 | 305 | 318 | 483 | 39 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 389 | - |1591k| 0 | 47 | 318 | 305 | 318 | 492 | 48 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 420 | - |1612k| 0 | 57 | 318 | 305 | 318 | 506 | 62 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.45 c 0.4s| 1 | 2 | 420 | - |1612k| 0 | 57 | 318 | 305 | 318 | 506 | 62 | 0 | 10 | 2.000000e+00 | -- | Inf
5.59/5.62 o 2
5.59/5.62 c * 5.6s| 1942 | 0 | 17099 | 8.6 |2427k| 57 | - | 318 |1618 | 318 | 227 |5171 |1318 |2224 | 2.000000e+00 | 2.000000e+00 | 0.00%
5.59/5.63 c
5.59/5.63 c SCIP Status : problem is solved [optimal solution found]
5.59/5.63 c Solving Time (sec) : 5.61
5.59/5.63 c Solving Nodes : 1942
5.59/5.63 c Primal Bound : +2.00000000000000e+00 (1 solutions)
5.59/5.63 c Dual Bound : +2.00000000000000e+00
5.59/5.63 c Gap : 0.00 %
5.59/5.63 s OPTIMUM FOUND
5.59/5.63 v -x108 -x107 -x106 x105 -x104 x103 -x102 x101 -x100 x99 -x98 -x97 -x72 -x71 x70 -x69 x68 -x67 -x96 -x95 -x94 -x93 -x92 -x91 -x66
5.59/5.63 v x65 x64 x63 x62 -x61 -x90 -x89 x88 x87 -x86 -x85 -x60 -x59 -x58 -x57 x56 -x55 -x84 -x83 -x82 -x81 -x80 x79 -x54 -x53 x52 x51
5.59/5.63 v x50 -x49 -x78 -x77 -x76 -x75 -x74 x73 -x48 x47 x46 -x45 x44 -x43 x42 -x41 -x40 -x39 -x38 x37 x36 -x35 x34 -x33 x32 x31 -x30
5.59/5.63 v -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 x2 -x1
5.59/5.63 c SCIP Status : problem is solved [optimal solution found]
5.59/5.63 c Solving Time : 5.61
5.59/5.63 c Original Problem :
5.59/5.63 c Problem name : HOME/instance-2703127-1278564500.opb
5.59/5.63 c Variables : 324 (324 binary, 0 integer, 0 implicit integer, 0 continuous)
5.59/5.63 c Constraints : 229 initial, 229 maximal
5.59/5.63 c Presolved Problem :
5.59/5.63 c Problem name : t_HOME/instance-2703127-1278564500.opb
5.59/5.63 c Variables : 318 (318 binary, 0 integer, 0 implicit integer, 0 continuous)
5.59/5.63 c Constraints : 229 initial, 1618 maximal
5.59/5.63 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.59/5.63 c trivial : 0.00 0 0 0 0 0 0 0 0
5.59/5.63 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.59/5.63 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.59/5.63 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.59/5.63 c implics : 0.00 0 0 0 0 0 0 0 0
5.59/5.63 c probing : 0.02 0 0 0 0 0 0 0 0
5.59/5.63 c and : 0.01 0 0 0 0 0 0 0 0
5.59/5.63 c linear : 0.00 1 5 0 0 0 0 0 28
5.59/5.63 c logicor : 0.00 0 0 0 0 0 0 0 0
5.59/5.63 c root node : - 0 - - 0 - - - -
5.59/5.63 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.59/5.63 c integral : 0 0 0 1645 0 5 220 0 0 3092
5.59/5.63 c and : 215 3542 6618 0 0 181 9078 5130 0 0
5.59/5.63 c linear : 6+ 7 6436 0 0 397 3426 8 0 0
5.59/5.63 c logicor : 8+ 6 2776 0 0 15 648 0 0 0
5.59/5.63 c countsols : 0 0 0 1 0 0 0 0 0 0
5.59/5.63 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.59/5.63 c integral : 2.11 0.00 0.00 2.11 0.00
5.59/5.63 c and : 0.18 0.09 0.09 0.00 0.00
5.59/5.63 c linear : 0.19 0.00 0.19 0.00 0.00
5.59/5.63 c logicor : 0.04 0.00 0.04 0.00 0.00
5.59/5.63 c countsols : 0.00 0.00 0.00 0.00 0.00
5.59/5.63 c Propagators : Time Calls Cutoffs DomReds
5.59/5.63 c vbounds : 0.00 2 0 0
5.59/5.63 c rootredcost : 0.00 0 0 0
5.59/5.63 c pseudoobj : 0.01 6249 0 0
5.59/5.63 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.59/5.63 c propagation : 0.10 593 592 5462 37.3 80 24.3 -
5.59/5.63 c infeasible LP : 0.00 37 37 115 28.2 36 7.5 0
5.59/5.63 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.59/5.63 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.59/5.63 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.59/5.63 c applied globally : - - - 1313 18.6 - - -
5.59/5.63 c applied locally : - - - 5 35.0 - - -
5.59/5.63 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.59/5.63 c cut pool : 0.00 5 - - 7 - (maximal pool size: 78)
5.59/5.63 c redcost : 0.03 3543 0 3 0 0
5.59/5.63 c impliedbounds : 0.00 6 0 0 32 0
5.59/5.63 c intobj : 0.00 0 0 0 0 0
5.59/5.63 c cgmip : 0.00 0 0 0 0 0
5.59/5.63 c gomory : 0.04 6 0 0 14 0
5.59/5.63 c strongcg : 0.03 6 0 0 73 0
5.59/5.63 c cmir : 0.02 6 0 0 34 0
5.59/5.63 c flowcover : 0.04 6 0 0 55 0
5.59/5.63 c clique : 0.00 1 0 0 0 0
5.59/5.63 c zerohalf : 0.00 0 0 0 0 0
5.59/5.63 c mcf : 0.00 1 0 0 0 0
5.59/5.63 c rapidlearning : 0.13 1 0 0 0 76
5.59/5.63 c Pricers : Time Calls Vars
5.59/5.63 c problem variables: 0.00 0 0
5.59/5.63 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.59/5.63 c relpscost : 2.11 1644 5 220 0 0 3092
5.59/5.63 c pscost : 0.00 0 0 0 0 0 0
5.59/5.63 c inference : 0.00 0 0 0 0 0 0
5.59/5.63 c mostinf : 0.00 0 0 0 0 0 0
5.59/5.63 c leastinf : 0.00 0 0 0 0 0 0
5.59/5.63 c fullstrong : 0.00 0 0 0 0 0 0
5.59/5.63 c allfullstrong : 0.00 0 0 0 0 0 0
5.59/5.63 c random : 0.00 0 0 0 0 0 0
5.59/5.63 c Primal Heuristics : Time Calls Found
5.59/5.63 c LP solutions : 0.00 - 1
5.59/5.63 c pseudo solutions : 0.00 - 0
5.59/5.63 c oneopt : 0.00 0 0
5.59/5.63 c crossover : 0.00 0 0
5.59/5.63 c guideddiving : 0.00 0 0
5.59/5.63 c intshifting : 0.00 0 0
5.59/5.63 c veclendiving : 0.01 3 0
5.59/5.63 c linesearchdiving : 0.01 3 0
5.59/5.63 c feaspump : 0.02 2 0
5.59/5.63 c rootsoldiving : 0.08 2 0
5.59/5.63 c objpscostdiving : 0.01 2 0
5.59/5.63 c coefdiving : 0.02 4 0
5.59/5.63 c pscostdiving : 0.01 4 0
5.59/5.63 c fracdiving : 0.01 4 0
5.59/5.63 c trivial : 0.00 2 0
5.59/5.63 c simplerounding : 0.00 0 0
5.59/5.63 c zirounding : 0.02 1000 0
5.59/5.63 c rounding : 0.03 791 0
5.59/5.63 c shifting : 0.22 210 0
5.59/5.63 c twoopt : 0.00 0 0
5.59/5.63 c fixandinfer : 0.00 0 0
5.59/5.63 c intdiving : 0.00 0 0
5.59/5.63 c actconsdiving : 0.00 0 0
5.59/5.63 c octane : 0.00 0 0
5.59/5.63 c rens : 0.02 1 0
5.59/5.63 c rins : 0.00 0 0
5.59/5.63 c localbranching : 0.00 0 0
5.59/5.63 c mutation : 0.00 0 0
5.59/5.63 c dins : 0.00 0 0
5.59/5.63 c undercover : 0.02 1 0
5.59/5.63 c nlp : 0.00 0 0
5.59/5.63 c trysol : 0.00 0 0
5.59/5.63 c LP : Time Calls Iterations Iter/call Iter/sec
5.59/5.63 c primal LP : 0.06 0 0 0.00 0.00
5.59/5.63 c dual LP : 1.59 3647 15806 4.33 9934.67
5.59/5.63 c lex dual LP : 0.00 0 0 0.00 -
5.59/5.63 c barrier LP : 0.00 0 0 0.00 -
5.59/5.63 c diving/probing LP: 0.11 247 1293 5.23 12084.11
5.59/5.63 c strong branching : 2.07 2224 18831 8.47 9101.56
5.59/5.63 c (at root node) : - 10 526 52.60 -
5.59/5.63 c conflict analysis: 0.00 0 0 0.00 -
5.59/5.63 c B&B Tree :
5.59/5.63 c number of runs : 1
5.59/5.63 c nodes : 1942
5.59/5.63 c nodes (total) : 1942
5.59/5.63 c nodes left : 0
5.59/5.63 c max depth : 57
5.59/5.63 c max depth (total): 57
5.59/5.63 c backtracks : 272 (14.0%)
5.59/5.63 c delayed cutoffs : 193
5.59/5.63 c repropagations : 879 (2564 domain reductions, 163 cutoffs)
5.59/5.63 c avg switch length: 3.80
5.59/5.63 c switching time : 0.20
5.59/5.63 c Solution :
5.59/5.63 c Solutions found : 1 (1 improvements)
5.59/5.63 c First Solution : +2.00000000000000e+00 (in run 1, after 1942 nodes, 5.61 seconds, depth 49, found by <relaxation>)
5.59/5.63 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1942 nodes, 5.61 seconds, depth 49, found by <relaxation>)
5.59/5.63 c Dual Bound : +2.00000000000000e+00
5.59/5.63 c Gap : 0.00 %
5.59/5.63 c Root Dual Bound : +2.00000000000000e+00
5.59/5.63 c Root Iterations : 420
5.59/5.64 c Time complete: 5.63.