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-2703032-1278564405.opb>
0.00/0.01 c original problem has 240 variables (240 bin, 0 int, 0 impl, 0 cont) and 163 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) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 1012 impls, 0 clqs
0.01/0.02 c (round 2) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 7 upgd conss, 1034 impls, 0 clqs
0.01/0.04 c (0.0s) probing: 160/231 (69.3%) - 0 fixings, 0 aggregations, 27 implications, 0 bound changes
0.01/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.04 c presolving (3 rounds):
0.01/0.04 c 9 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 21 changed coefficients
0.01/0.04 c 1088 implications, 0 cliques
0.01/0.04 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 163 constraints
0.01/0.04 c 149 constraints of type <and>
0.01/0.04 c 6 constraints of type <linear>
0.01/0.04 c 8 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.02
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.3
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1790
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.04 c # [type: int, range: [1,2], default: 1]
0.01/0.04 c timing/clocktype = 2
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/indicator/addCouplingCons = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c heuristics/undercover/freq = 0
0.01/0.04 c
0.01/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c separating/rapidlearning/freq = 0
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/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.01/0.04 c 0.0s| 1 | 0 | 19 | - |1032k| 0 | 11 | 231 | 163 | 231 | 309 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.01/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.19/0.21 c 0.2s| 1 | 0 | 254 | - |1058k| 0 | 18 | 231 | 163 | 231 | 315 | 6 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 274 | - |1081k| 0 | 27 | 231 | 163 | 231 | 336 | 27 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 312 | - |1132k| 0 | 41 | 231 | 163 | 231 | 367 | 58 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 342 | - |1174k| 0 | 48 | 231 | 163 | 231 | 379 | 70 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 376 | - |1242k| 0 | 66 | 231 | 163 | 231 | 393 | 84 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 428 | - |1261k| 0 | 62 | 231 | 163 | 231 | 409 | 100 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.44 c 0.4s| 1 | 2 | 428 | - |1261k| 0 | 62 | 231 | 163 | 231 | 409 | 100 | 0 | 9 | 2.000000e+00 | -- | Inf
2.89/2.96 o 10
2.89/2.96 c * 2.9s| 680 | 331 | 6513 | 9.0 |1836k| 47 | - | 231 | 608 | 231 | 192 |2135 | 447 |1453 | 2.000000e+00 | 1.000000e+01 | 400.00%
2.89/2.99 o 6
2.89/2.99 c * 3.0s| 704 | 336 | 6644 | 8.8 |1855k| 47 | - | 231 | 621 | 231 | 193 |2185 | 470 |1468 | 2.000000e+00 | 6.000000e+00 | 200.00%
2.89/3.00 o 2
2.89/3.00 c * 3.0s| 705 | 0 | 6646 | 8.8 |1586k| 47 | - | 231 | 621 | 231 | 182 |2185 | 470 |1468 | 2.000000e+00 | 2.000000e+00 | 0.00%
2.89/3.00 c
2.89/3.00 c SCIP Status : problem is solved [optimal solution found]
2.89/3.00 c Solving Time (sec) : 2.98
2.89/3.00 c Solving Nodes : 705
2.89/3.00 c Primal Bound : +2.00000000000000e+00 (3 solutions)
2.89/3.00 c Dual Bound : +2.00000000000000e+00
2.89/3.00 c Gap : 0.00 %
2.99/3.00 s OPTIMUM FOUND
2.99/3.00 v -x90 x89 x88 -x87 -x86 x85 -x84 -x83 x82 -x81 x60 -x59 -x58 x57 -x56 -x80 -x79 x78 -x77 x76 x55 -x54 x53 x52 -x51 -x75 -x74 x73
2.99/3.00 v x72 x71 -x50 x49 x48 x47 -x46 -x70 -x69 -x68 x67 x66 -x45 x44 x43 x42 -x41 -x65 -x64 -x63 -x62 -x61 x40 -x39 x38 x37 -x36 x35
2.99/3.00 v -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 x6
2.99/3.00 v -x5 -x4 -x3 x2 -x1
2.99/3.00 c SCIP Status : problem is solved [optimal solution found]
2.99/3.00 c Solving Time : 2.98
2.99/3.00 c Original Problem :
2.99/3.00 c Problem name : HOME/instance-2703032-1278564405.opb
2.99/3.00 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.00 c Constraints : 163 initial, 163 maximal
2.99/3.00 c Presolved Problem :
2.99/3.00 c Problem name : t_HOME/instance-2703032-1278564405.opb
2.99/3.00 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.00 c Constraints : 163 initial, 621 maximal
2.99/3.00 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.00 c trivial : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c implics : 0.00 0 2 0 0 0 0 0 0
2.99/3.00 c probing : 0.01 0 0 0 0 0 0 0 0
2.99/3.00 c and : 0.01 0 0 0 0 0 0 0 0
2.99/3.00 c linear : 0.00 1 6 0 0 0 0 0 21
2.99/3.00 c logicor : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c root node : - 8 - - 8 - - - -
2.99/3.00 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.00 c integral : 0 0 0 597 0 0 74 0 0 1120
2.99/3.00 c and : 149 1367 2713 1 0 45 2975 2115 0 0
2.99/3.00 c linear : 6 6 2666 1 0 158 1239 0 0 0
2.99/3.00 c logicor : 8+ 6 985 3 0 5 247 0 0 0
2.99/3.00 c countsols : 0 0 0 3 0 0 0 0 0 0
2.99/3.00 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.00 c integral : 1.61 0.00 0.00 1.61 0.00
2.99/3.00 c and : 0.04 0.03 0.01 0.00 0.00
2.99/3.00 c linear : 0.04 0.00 0.04 0.00 0.00
2.99/3.00 c logicor : 0.01 0.00 0.01 0.00 0.00
2.99/3.00 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.00 c Propagators : Time Calls Cutoffs DomReds
2.99/3.00 c vbounds : 0.00 2 0 0
2.99/3.00 c rootredcost : 0.00 2 0 2
2.99/3.00 c pseudoobj : 0.00 2382 0 1
2.99/3.00 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.00 c propagation : 0.02 208 208 1286 21.0 10 11.3 -
2.99/3.00 c infeasible LP : 0.00 11 11 70 20.8 2 8.5 0
2.99/3.00 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.00 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.00 c applied globally : - - - 468 15.6 - - -
2.99/3.00 c applied locally : - - - 2 31.5 - - -
2.99/3.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.00 c cut pool : 0.00 5 - - 41 - (maximal pool size: 218)
2.99/3.00 c redcost : 0.01 1369 0 0 0 0
2.99/3.00 c impliedbounds : 0.00 6 0 0 64 0
2.99/3.00 c intobj : 0.00 0 0 0 0 0
2.99/3.00 c cgmip : 0.00 0 0 0 0 0
2.99/3.00 c gomory : 0.04 6 0 0 147 0
2.99/3.00 c strongcg : 0.04 6 0 0 232 0
2.99/3.00 c cmir : 0.02 6 0 0 57 0
2.99/3.00 c flowcover : 0.03 6 0 0 125 0
2.99/3.00 c clique : 0.00 6 0 0 0 0
2.99/3.00 c zerohalf : 0.00 0 0 0 0 0
2.99/3.00 c mcf : 0.00 1 0 0 0 0
2.99/3.00 c rapidlearning : 0.13 1 0 0 0 0
2.99/3.00 c Pricers : Time Calls Vars
2.99/3.00 c problem variables: 0.00 0 0
2.99/3.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.00 c relpscost : 1.61 594 0 74 0 0 1120
2.99/3.00 c pscost : 0.00 0 0 0 0 0 0
2.99/3.00 c inference : 0.00 0 0 0 0 0 0
2.99/3.00 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.00 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.00 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.00 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.00 c random : 0.00 0 0 0 0 0 0
2.99/3.00 c Primal Heuristics : Time Calls Found
2.99/3.00 c LP solutions : 0.00 - 3
2.99/3.00 c pseudo solutions : 0.00 - 0
2.99/3.00 c crossover : 0.00 0 0
2.99/3.00 c guideddiving : 0.00 0 0
2.99/3.00 c coefdiving : 0.01 1 0
2.99/3.00 c pscostdiving : 0.01 1 0
2.99/3.00 c fracdiving : 0.00 1 0
2.99/3.00 c veclendiving : 0.00 1 0
2.99/3.00 c linesearchdiving : 0.00 1 0
2.99/3.00 c feaspump : 0.01 1 0
2.99/3.00 c objpscostdiving : 0.00 1 0
2.99/3.00 c rootsoldiving : 0.01 1 0
2.99/3.00 c trivial : 0.00 2 0
2.99/3.00 c simplerounding : 0.00 0 0
2.99/3.00 c zirounding : 0.01 558 0
2.99/3.00 c rounding : 0.03 467 0
2.99/3.00 c shifting : 0.09 116 0
2.99/3.00 c intshifting : 0.00 0 0
2.99/3.00 c oneopt : 0.00 2 0
2.99/3.00 c twoopt : 0.00 0 0
2.99/3.00 c fixandinfer : 0.00 0 0
2.99/3.00 c intdiving : 0.00 0 0
2.99/3.00 c actconsdiving : 0.00 0 0
2.99/3.00 c octane : 0.00 0 0
2.99/3.00 c rens : 0.02 1 0
2.99/3.00 c rins : 0.00 0 0
2.99/3.00 c localbranching : 0.00 0 0
2.99/3.00 c mutation : 0.00 0 0
2.99/3.00 c dins : 0.00 0 0
2.99/3.00 c undercover : 0.02 1 0
2.99/3.00 c nlp : 0.00 0 0
2.99/3.00 c trysol : 0.00 0 0
2.99/3.00 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.00 c primal LP : 0.02 0 0 0.00 0.00
2.99/3.00 c dual LP : 0.57 1446 6010 4.16 10488.71
2.99/3.00 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.00 c barrier LP : 0.00 0 0 0.00 -
2.99/3.00 c diving/probing LP: 0.04 118 636 5.39 15512.20
2.99/3.00 c strong branching : 1.60 1468 18080 12.32 11286.08
2.99/3.00 c (at root node) : - 9 567 63.00 -
2.99/3.00 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.00 c B&B Tree :
2.99/3.00 c number of runs : 1
2.99/3.00 c nodes : 705
2.99/3.00 c nodes (total) : 705
2.99/3.00 c nodes left : 0
2.99/3.00 c max depth : 47
2.99/3.00 c max depth (total): 47
2.99/3.00 c backtracks : 98 (13.9%)
2.99/3.00 c delayed cutoffs : 71
2.99/3.00 c repropagations : 312 (1016 domain reductions, 61 cutoffs)
2.99/3.00 c avg switch length: 3.37
2.99/3.00 c switching time : 0.06
2.99/3.00 c Solution :
2.99/3.00 c Solutions found : 3 (3 improvements)
2.99/3.00 c First Solution : +1.00000000000000e+01 (in run 1, after 680 nodes, 2.95 seconds, depth 42, found by <relaxation>)
2.99/3.00 c Primal Bound : +2.00000000000000e+00 (in run 1, after 705 nodes, 2.98 seconds, depth 43, found by <relaxation>)
2.99/3.00 c Dual Bound : +2.00000000000000e+00
2.99/3.00 c Gap : 0.00 %
2.99/3.00 c Root Dual Bound : +2.00000000000000e+00
2.99/3.00 c Root Iterations : 428
2.99/3.01 c Time complete: 3.