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-2703063-1278564435.opb>
0.00/0.01 c original problem has 360 variables (360 bin, 0 int, 0 impl, 0 cont) and 244 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) 10 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1840 impls, 0 clqs
0.00/0.03 c (round 2) 12 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 10 upgd conss, 1862 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 205/348 (58.9%) - 0 fixings, 0 aggregations, 33 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 12 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 30 changed coefficients
0.00/0.05 c 1928 implications, 0 cliques
0.00/0.05 c presolved problem has 348 variables (348 bin, 0 int, 0 impl, 0 cont) and 244 constraints
0.00/0.05 c 224 constraints of type <and>
0.00/0.05 c 9 constraints of type <linear>
0.00/0.05 c 11 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.3
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1790
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 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.05/0.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.06 c 0.0s| 1 | 0 | 22 | - |1497k| 0 | 11 | 348 | 244 | 348 | 465 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.10 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.19/0.20 c 0.2s| 1 | 0 | 254 | - |1514k| 0 | 15 | 348 | 244 | 348 | 471 | 6 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 269 | - |1565k| 0 | 27 | 348 | 244 | 348 | 511 | 46 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 301 | - |1602k| 0 | 36 | 348 | 244 | 348 | 538 | 73 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 328 | - |1657k| 0 | 46 | 348 | 244 | 348 | 571 | 106 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 391 | - |1684k| 0 | 62 | 348 | 244 | 348 | 588 | 123 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 407 | - |1695k| 0 | 67 | 348 | 244 | 348 | 600 | 135 | 0 | 0 | 2.000000e+00 | -- | Inf
0.48/0.54 c 0.5s| 1 | 2 | 407 | - |1696k| 0 | 67 | 348 | 244 | 348 | 600 | 135 | 0 | 10 | 2.000000e+00 | -- | Inf
4.89/4.99 o 3
4.89/4.99 c * 5.0s| 1295 | 455 | 11943 | 8.9 |2684k| 65 | - | 348 |1167 | 348 | 238 |5240 | 928 |2368 | 2.000000e+00 | 3.000000e+00 | 50.00%
5.18/5.27 o 2
5.18/5.27 c * 5.3s| 1448 | 0 | 13032 | 8.7 |2299k| 65 | - | 348 |1218 | 348 | 247 |5672 |1051 |2388 | 2.000000e+00 | 2.000000e+00 | 0.00%
5.18/5.27 c
5.18/5.27 c SCIP Status : problem is solved [optimal solution found]
5.18/5.27 c Solving Time (sec) : 5.26
5.18/5.27 c Solving Nodes : 1448
5.18/5.27 c Primal Bound : +2.00000000000000e+00 (2 solutions)
5.18/5.27 c Dual Bound : +2.00000000000000e+00
5.18/5.27 c Gap : 0.00 %
5.18/5.27 s OPTIMUM FOUND
5.18/5.27 v -x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x90 x89 -x88 x87 -x86 -x125 -x124 -x123 -x122 x121 -x85 -x84 -x83 x82
5.18/5.27 v -x81 -x120 -x119 -x118 x117 x116 -x80 -x79 -x78 x77 -x76 -x115 -x114 x113 -x112 x111 -x75 x74 x73 x72 -x71 -x110 x109 x108
5.18/5.27 v x107 x106 -x70 -x69 x68 x67 -x66 -x105 -x104 x103 x102 -x101 x65 -x64 -x63 x62 -x61 -x100 -x99 x98 -x97 x96 -x60 x59 x58 x57
5.18/5.27 v -x56 -x95 -x94 -x93 -x92 -x91 -x55 -x54 x53 x52 -x51 x50 x49 -x48 x47 x46 -x45 -x44 x43 -x42 x41 x40 -x39 -x38 -x37 x36 -x35
5.18/5.27 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 -x5
5.18/5.27 v -x4 -x3 x2 -x1
5.18/5.27 c SCIP Status : problem is solved [optimal solution found]
5.18/5.27 c Solving Time : 5.26
5.18/5.27 c Original Problem :
5.18/5.27 c Problem name : HOME/instance-2703063-1278564435.opb
5.18/5.27 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
5.18/5.27 c Constraints : 244 initial, 244 maximal
5.18/5.27 c Presolved Problem :
5.18/5.27 c Problem name : t_HOME/instance-2703063-1278564435.opb
5.18/5.27 c Variables : 348 (348 binary, 0 integer, 0 implicit integer, 0 continuous)
5.18/5.27 c Constraints : 244 initial, 1218 maximal
5.18/5.27 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.18/5.27 c trivial : 0.00 0 0 0 0 0 0 0 0
5.18/5.27 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.18/5.27 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.18/5.27 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.18/5.27 c implics : 0.00 0 2 0 0 0 0 0 0
5.18/5.27 c probing : 0.02 0 0 0 0 0 0 0 0
5.18/5.27 c and : 0.01 0 0 0 0 0 0 0 0
5.18/5.27 c linear : 0.00 1 9 0 0 0 0 0 30
5.18/5.27 c logicor : 0.00 0 0 0 0 0 0 0 0
5.18/5.27 c root node : - 68 - - 68 - - - -
5.18/5.27 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.18/5.27 c integral : 0 0 0 1268 0 0 174 0 0 2378
5.18/5.27 c and : 224 3076 5415 2 0 146 6546 5569 0 0
5.18/5.27 c linear : 9 6 5267 0 0 199 2406 0 0 0
5.18/5.27 c logicor : 11+ 6 2260 2 0 29 403 0 0 0
5.18/5.27 c countsols : 0 0 0 2 0 0 0 0 0 0
5.18/5.27 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.18/5.27 c integral : 2.40 0.00 0.00 2.40 0.00
5.18/5.27 c and : 0.18 0.12 0.06 0.00 0.00
5.18/5.27 c linear : 0.08 0.00 0.08 0.00 0.00
5.18/5.27 c logicor : 0.02 0.00 0.02 0.00 0.00
5.18/5.27 c countsols : 0.00 0.00 0.00 0.00 0.00
5.18/5.27 c Propagators : Time Calls Cutoffs DomReds
5.18/5.27 c vbounds : 0.00 2 0 0
5.18/5.27 c rootredcost : 0.00 1 0 4
5.18/5.27 c pseudoobj : 0.01 4989 0 1
5.18/5.27 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.18/5.27 c propagation : 0.04 374 359 2453 24.5 94 12.2 -
5.18/5.27 c infeasible LP : 0.00 8 8 36 15.4 4 17.2 0
5.18/5.27 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.18/5.27 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.18/5.27 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.18/5.27 c applied globally : - - - 1046 17.1 - - -
5.18/5.27 c applied locally : - - - 5 35.6 - - -
5.18/5.27 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.18/5.27 c cut pool : 0.00 5 - - 17 - (maximal pool size: 191)
5.18/5.27 c redcost : 0.03 3078 0 0 0 0
5.18/5.27 c impliedbounds : 0.00 6 0 0 94 0
5.18/5.27 c intobj : 0.00 0 0 0 0 0
5.18/5.27 c cgmip : 0.00 0 0 0 0 0
5.18/5.27 c gomory : 0.04 6 0 0 4 0
5.18/5.27 c strongcg : 0.03 6 0 0 100 0
5.18/5.27 c cmir : 0.03 6 0 0 49 0
5.18/5.27 c flowcover : 0.05 6 0 0 102 0
5.18/5.27 c clique : 0.00 6 0 0 1 0
5.18/5.27 c zerohalf : 0.00 0 0 0 0 0
5.18/5.27 c mcf : 0.00 1 0 0 0 0
5.18/5.27 c rapidlearning : 0.11 1 0 0 0 0
5.18/5.27 c Pricers : Time Calls Vars
5.18/5.27 c problem variables: 0.00 0 0
5.18/5.27 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.18/5.27 c relpscost : 2.40 1264 0 174 0 0 2378
5.18/5.27 c pscost : 0.00 0 0 0 0 0 0
5.18/5.27 c inference : 0.00 0 0 0 0 0 0
5.18/5.27 c mostinf : 0.00 0 0 0 0 0 0
5.18/5.27 c leastinf : 0.00 0 0 0 0 0 0
5.18/5.27 c fullstrong : 0.00 0 0 0 0 0 0
5.18/5.27 c allfullstrong : 0.00 0 0 0 0 0 0
5.18/5.27 c random : 0.00 0 0 0 0 0 0
5.18/5.27 c Primal Heuristics : Time Calls Found
5.18/5.27 c LP solutions : 0.00 - 2
5.18/5.27 c pseudo solutions : 0.00 - 0
5.18/5.27 c crossover : 0.00 0 0
5.18/5.27 c intshifting : 0.00 0 0
5.18/5.27 c oneopt : 0.00 1 0
5.18/5.27 c linesearchdiving : 0.01 1 0
5.18/5.27 c guideddiving : 0.00 1 0
5.18/5.27 c feaspump : 0.01 1 0
5.18/5.27 c objpscostdiving : 0.02 1 0
5.18/5.27 c rootsoldiving : 0.02 1 0
5.18/5.27 c coefdiving : 0.01 2 0
5.18/5.27 c pscostdiving : 0.02 2 0
5.18/5.27 c fracdiving : 0.02 2 0
5.18/5.27 c veclendiving : 0.02 2 0
5.18/5.27 c trivial : 0.00 2 0
5.18/5.27 c simplerounding : 0.00 0 0
5.18/5.27 c zirounding : 0.02 1000 0
5.18/5.27 c rounding : 0.02 723 0
5.18/5.27 c shifting : 0.18 240 0
5.18/5.27 c twoopt : 0.00 0 0
5.18/5.27 c fixandinfer : 0.00 0 0
5.18/5.27 c intdiving : 0.00 0 0
5.18/5.27 c actconsdiving : 0.00 0 0
5.18/5.27 c octane : 0.00 0 0
5.18/5.27 c rens : 0.02 1 0
5.18/5.27 c rins : 0.00 0 0
5.18/5.27 c localbranching : 0.00 0 0
5.18/5.27 c mutation : 0.00 0 0
5.18/5.27 c dins : 0.00 0 0
5.18/5.27 c undercover : 0.02 1 0
5.18/5.27 c nlp : 0.00 0 0
5.18/5.27 c trysol : 0.00 0 0
5.18/5.27 c LP : Time Calls Iterations Iter/call Iter/sec
5.18/5.27 c primal LP : 0.07 0 0 0.00 0.00
5.18/5.27 c dual LP : 1.28 3249 12221 3.76 9577.63
5.18/5.27 c lex dual LP : 0.00 0 0 0.00 -
5.18/5.27 c barrier LP : 0.00 0 0 0.00 -
5.18/5.27 c diving/probing LP: 0.07 300 811 2.70 11109.74
5.18/5.27 c strong branching : 2.37 2388 20387 8.54 8598.53
5.18/5.27 c (at root node) : - 10 981 98.10 -
5.18/5.27 c conflict analysis: 0.00 0 0 0.00 -
5.18/5.27 c B&B Tree :
5.18/5.27 c number of runs : 1
5.18/5.27 c nodes : 1448
5.18/5.27 c nodes (total) : 1448
5.18/5.27 c nodes left : 0
5.18/5.27 c max depth : 65
5.18/5.27 c max depth (total): 65
5.18/5.27 c backtracks : 138 (9.5%)
5.18/5.27 c delayed cutoffs : 100
5.18/5.27 c repropagations : 557 (1668 domain reductions, 87 cutoffs)
5.18/5.27 c avg switch length: 3.53
5.18/5.27 c switching time : 0.15
5.18/5.27 c Solution :
5.18/5.27 c Solutions found : 2 (2 improvements)
5.18/5.27 c First Solution : +3.00000000000000e+00 (in run 1, after 1295 nodes, 4.98 seconds, depth 60, found by <relaxation>)
5.18/5.27 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1448 nodes, 5.25 seconds, depth 58, found by <relaxation>)
5.18/5.27 c Dual Bound : +2.00000000000000e+00
5.18/5.27 c Gap : 0.00 %
5.18/5.27 c Root Dual Bound : +2.00000000000000e+00
5.18/5.27 c Root Iterations : 407
5.18/5.28 c Time complete: 5.27.