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-2703087-1278564454.opb>
0.00/0.01 c original problem has 270 variables (270 bin, 0 int, 0 impl, 0 cont) and 191 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.02/0.02 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1000 impls, 0 clqs
0.02/0.03 c (round 2) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 6 upgd conss, 1022 impls, 0 clqs
0.02/0.04 c (0.0s) probing: 166/265 (62.6%) - 0 fixings, 0 aggregations, 35 implications, 0 bound changes
0.02/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.04 c presolving (3 rounds):
0.02/0.04 c 5 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 24 changed coefficients
0.02/0.04 c 1092 implications, 0 cliques
0.02/0.04 c presolved problem has 265 variables (265 bin, 0 int, 0 impl, 0 cont) and 191 constraints
0.02/0.04 c 179 constraints of type <and>
0.02/0.04 c 5 constraints of type <linear>
0.02/0.04 c 7 constraints of type <logicor>
0.02/0.04 c transformed objective value is always integral (scale: 1)
0.02/0.04 c Presolving Time: 0.02
0.02/0.04 c - non default parameters ----------------------------------------------------------------------
0.02/0.04 c # SCIP version 1.2.1.3
0.02/0.04 c
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = 10000
0.02/0.04 c
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = 1790
0.02/0.04 c
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = 1620
0.02/0.04 c
0.02/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.04 c # [type: int, range: [1,2], default: 1]
0.02/0.04 c timing/clocktype = 2
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/indicator/addCouplingCons = TRUE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c heuristics/undercover/freq = 0
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/rapidlearning/freq = 0
0.02/0.04 c
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving
0.02/0.04 c
0.02/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.02/0.04 c 0.0s| 1 | 0 | 10 | - |1163k| 0 | 4 | 265 | 191 | 265 | 370 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.02/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.18 c 0.2s| 1 | 0 | 262 | - |1281k| 0 | 22 | 265 | 239 | 265 | 377 | 7 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 290 | - |1334k| 0 | 40 | 265 | 239 | 265 | 390 | 20 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 317 | - |1366k| 0 | 45 | 265 | 239 | 265 | 405 | 35 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 353 | - |1391k| 0 | 60 | 265 | 239 | 265 | 418 | 48 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 401 | - |1405k| 0 | 45 | 265 | 239 | 265 | 431 | 61 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 481 | - |1431k| 0 | 48 | 265 | 239 | 265 | 442 | 72 | 0 | 0 | 2.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 2 | 481 | - |1432k| 0 | 48 | 265 | 239 | 265 | 442 | 72 | 0 | 9 | 2.000000e+00 | -- | Inf
3.30/3.39 o 39
3.30/3.39 c l 3.4s| 1296 | 505 | 8268 | 6.0 |2477k| 50 | - | 265 |1174 | 265 | 209 |2756 | 978 |1540 | 2.000000e+00 | 3.900000e+01 |1850.00%
3.69/3.78 o 3
3.69/3.78 c * 3.8s| 1620 | 364 | 9856 | 5.8 |2494k| 51 | - | 265 |1450 | 265 | 233 |3222 |1271 |1596 | 2.000000e+00 | 3.000000e+00 | 50.00%
3.89/3.98 o 2
3.89/3.98 c * 4.0s| 1825 | 0 | 10615 | 5.6 |2123k| 51 | - | 265 |1429 | 265 | 206 |3501 |1446 |1600 | 2.000000e+00 | 2.000000e+00 | 0.00%
3.89/3.98 c
3.89/3.98 c SCIP Status : problem is solved [optimal solution found]
3.89/3.98 c Solving Time (sec) : 3.97
3.89/3.98 c Solving Nodes : 1825
3.89/3.98 c Primal Bound : +2.00000000000000e+00 (3 solutions)
3.89/3.98 c Dual Bound : +2.00000000000000e+00
3.89/3.98 c Gap : 0.00 %
3.89/3.98 s OPTIMUM FOUND
3.89/3.98 v -x90 -x89 -x88 x87 x86 -x85 -x84 -x83 -x82 -x81 x80 x79 -x60 x59 -x58 -x57 x56 -x55 -x78 -x77 -x76 -x75 x74 x73 -x54 -x53 -x52
3.89/3.98 v x51 x50 -x49 -x72 x71 -x70 x69 x68 -x67 -x48 x47 -x46 x45 x44 -x43 -x66 -x65 -x64 -x63 -x62 x61 -x42 x41 x40 -x39 x38 -x37 -x36
3.89/3.98 v x35 -x34 x33 x32 x31 x30 -x29 -x28 -x27 x26 x25 -x24 -x23 x22 -x21 -x20 x19 x18 x17 -x16 x15 x14 x13 x12 -x11 x10 x9 -x8 x7
3.89/3.98 v -x6 -x5 -x4 -x3 x2 -x1
3.89/3.98 c SCIP Status : problem is solved [optimal solution found]
3.89/3.98 c Solving Time : 3.97
3.89/3.98 c Original Problem :
3.89/3.98 c Problem name : HOME/instance-2703087-1278564454.opb
3.89/3.98 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
3.89/3.98 c Constraints : 191 initial, 191 maximal
3.89/3.98 c Presolved Problem :
3.89/3.98 c Problem name : t_HOME/instance-2703087-1278564454.opb
3.89/3.98 c Variables : 265 (265 binary, 0 integer, 0 implicit integer, 0 continuous)
3.89/3.98 c Constraints : 191 initial, 1450 maximal
3.89/3.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.89/3.98 c trivial : 0.00 0 0 0 0 0 0 0 0
3.89/3.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.89/3.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.89/3.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.89/3.98 c implics : 0.00 0 0 0 0 0 0 0 0
3.89/3.98 c probing : 0.01 0 0 0 0 0 0 0 0
3.89/3.98 c and : 0.01 0 0 0 0 0 0 0 0
3.89/3.98 c linear : 0.00 1 4 0 0 0 0 0 24
3.89/3.98 c logicor : 0.00 0 0 0 0 0 0 0 0
3.89/3.98 c root node : - 64 - - 64 - - - -
3.89/3.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.89/3.98 c integral : 0 0 0 1466 0 0 86 0 0 2818
3.89/3.98 c and : 179 2934 6267 1 0 144 8921 3455 0 0
3.89/3.98 c linear : 5+ 7 6121 1 0 476 3747 14 0 0
3.89/3.98 c logicor : 7+ 6 2382 2 0 20 590 0 0 0
3.89/3.98 c countsols : 0 0 0 2 0 0 0 0 0 0
3.89/3.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.89/3.98 c integral : 1.48 0.00 0.00 1.48 0.00
3.89/3.98 c and : 0.08 0.03 0.05 0.00 0.00
3.89/3.98 c linear : 0.16 0.00 0.15 0.00 0.00
3.89/3.98 c logicor : 0.03 0.00 0.03 0.00 0.00
3.89/3.98 c countsols : 0.00 0.00 0.00 0.00 0.00
3.89/3.98 c Propagators : Time Calls Cutoffs DomReds
3.89/3.98 c vbounds : 0.00 2 0 0
3.89/3.98 c rootredcost : 0.00 2 0 5
3.89/3.98 c pseudoobj : 0.01 5925 0 11
3.89/3.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.89/3.98 c propagation : 0.08 640 640 6423 37.0 69 22.5 -
3.89/3.98 c infeasible LP : 0.00 10 10 90 40.2 3 30.3 0
3.89/3.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.89/3.98 c applied globally : - - - 1386 18.1 - - -
3.89/3.98 c applied locally : - - - 60 34.8 - - -
3.89/3.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.89/3.98 c cut pool : 0.00 5 - - 27 - (maximal pool size: 142)
3.89/3.98 c redcost : 0.02 2937 0 10 0 0
3.89/3.98 c impliedbounds : 0.00 6 0 0 28 0
3.89/3.98 c intobj : 0.00 0 0 0 0 0
3.89/3.98 c cgmip : 0.00 0 0 0 0 0
3.89/3.98 c gomory : 0.07 6 0 0 46 0
3.89/3.98 c strongcg : 0.05 6 0 0 100 0
3.89/3.98 c cmir : 0.02 6 0 0 57 0
3.89/3.98 c flowcover : 0.05 6 0 0 120 0
3.89/3.98 c clique : 0.00 1 0 0 0 0
3.89/3.98 c zerohalf : 0.00 0 0 0 0 0
3.89/3.98 c mcf : 0.00 1 0 0 0 0
3.89/3.98 c rapidlearning : 0.10 1 0 0 0 48
3.89/3.98 c Pricers : Time Calls Vars
3.89/3.98 c problem variables: 0.00 0 0
3.89/3.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.89/3.98 c relpscost : 1.47 1464 0 86 0 0 2818
3.89/3.98 c pscost : 0.00 0 0 0 0 0 0
3.89/3.98 c inference : 0.00 0 0 0 0 0 0
3.89/3.98 c mostinf : 0.00 0 0 0 0 0 0
3.89/3.98 c leastinf : 0.00 0 0 0 0 0 0
3.89/3.98 c fullstrong : 0.00 0 0 0 0 0 0
3.89/3.98 c allfullstrong : 0.00 0 0 0 0 0 0
3.89/3.98 c random : 0.00 0 0 0 0 0 0
3.89/3.98 c Primal Heuristics : Time Calls Found
3.89/3.98 c LP solutions : 0.00 - 2
3.89/3.98 c pseudo solutions : 0.00 - 0
3.89/3.98 c crossover : 0.00 0 0
3.89/3.98 c intshifting : 0.00 0 0
3.89/3.98 c oneopt : 0.00 2 0
3.89/3.98 c coefdiving : 0.00 2 0
3.89/3.98 c pscostdiving : 0.01 2 0
3.89/3.98 c fracdiving : 0.01 2 0
3.89/3.98 c veclendiving : 0.00 2 0
3.89/3.98 c guideddiving : 0.00 2 0
3.89/3.98 c linesearchdiving : 0.00 3 1
3.89/3.98 c feaspump : 0.02 2 0
3.89/3.98 c objpscostdiving : 0.01 2 0
3.89/3.98 c rootsoldiving : 0.01 2 0
3.89/3.98 c trivial : 0.00 2 0
3.89/3.98 c simplerounding : 0.00 0 0
3.89/3.98 c zirounding : 0.02 1000 0
3.89/3.98 c rounding : 0.03 723 0
3.89/3.98 c shifting : 0.15 190 0
3.89/3.98 c twoopt : 0.00 0 0
3.89/3.98 c fixandinfer : 0.00 0 0
3.89/3.98 c intdiving : 0.00 0 0
3.89/3.98 c actconsdiving : 0.00 0 0
3.89/3.98 c octane : 0.00 0 0
3.89/3.98 c rens : 0.02 1 0
3.89/3.98 c rins : 0.00 0 0
3.89/3.98 c localbranching : 0.00 0 0
3.89/3.98 c mutation : 0.00 0 0
3.89/3.98 c dins : 0.00 0 0
3.89/3.98 c undercover : 0.02 1 0
3.89/3.98 c nlp : 0.00 0 0
3.89/3.98 c trysol : 0.00 0 0
3.89/3.98 c LP : Time Calls Iterations Iter/call Iter/sec
3.89/3.98 c primal LP : 0.05 0 0 0.00 0.00
3.89/3.98 c dual LP : 1.01 2956 10044 3.40 9934.62
3.89/3.98 c lex dual LP : 0.00 0 0 0.00 -
3.89/3.98 c barrier LP : 0.00 0 0 0.00 -
3.89/3.98 c diving/probing LP: 0.03 110 571 5.19 19032.70
3.89/3.98 c strong branching : 1.45 1600 15007 9.38 10349.47
3.89/3.98 c (at root node) : - 9 900 100.00 -
3.89/3.98 c conflict analysis: 0.00 0 0 0.00 -
3.89/3.98 c B&B Tree :
3.89/3.98 c number of runs : 1
3.89/3.98 c nodes : 1825
3.89/3.98 c nodes (total) : 1825
3.89/3.98 c nodes left : 0
3.89/3.98 c max depth : 51
3.89/3.98 c max depth (total): 51
3.89/3.98 c backtracks : 274 (15.0%)
3.89/3.98 c delayed cutoffs : 218
3.89/3.98 c repropagations : 861 (2910 domain reductions, 202 cutoffs)
3.89/3.98 c avg switch length: 3.44
3.89/3.98 c switching time : 0.16
3.89/3.98 c Solution :
3.89/3.98 c Solutions found : 3 (3 improvements)
3.89/3.98 c First Solution : +3.90000000000000e+01 (in run 1, after 1296 nodes, 3.38 seconds, depth 47, found by <linesearchdiving>)
3.89/3.98 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1825 nodes, 3.97 seconds, depth 47, found by <relaxation>)
3.89/3.98 c Dual Bound : +2.00000000000000e+00
3.89/3.98 c Gap : 0.00 %
3.89/3.98 c Root Dual Bound : +2.00000000000000e+00
3.89/3.98 c Root Iterations : 481
3.89/3.99 c Time complete: 3.99.