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-2703000-1278564381.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.02/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.02/0.04 c (0.0s) probing: 178/318 (56.0%) - 0 fixings, 0 aggregations, 37 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 6 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 28 changed coefficients
0.02/0.04 c 1380 implications, 0 cliques
0.02/0.04 c presolved problem has 318 variables (318 bin, 0 int, 0 impl, 0 cont) and 229 constraints
0.02/0.04 c 215 constraints of type <and>
0.02/0.04 c 6 constraints of type <linear>
0.02/0.04 c 8 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.03
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.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.05 c limits/time = 1790
0.02/0.05 c
0.02/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.05 c limits/memory = 1620
0.02/0.05 c
0.02/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.05 c # [type: int, range: [1,2], default: 1]
0.02/0.05 c timing/clocktype = 2
0.02/0.05 c
0.02/0.05 c # should presolving try to simplify inequalities
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/linear/simplifyinequalities = TRUE
0.02/0.05 c
0.02/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/indicator/addCouplingCons = TRUE
0.02/0.05 c
0.02/0.05 c # should presolving try to simplify knapsacks
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.05 c
0.02/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c heuristics/undercover/freq = 0
0.02/0.05 c
0.02/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c separating/rapidlearning/freq = 0
0.02/0.05 c
0.02/0.05 c -----------------------------------------------------------------------------------------------
0.02/0.05 c start solving
0.02/0.05 c
0.02/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.02/0.05 c 0.0s| 1 | 0 | 11 | - |1372k| 0 | 4 | 318 | 229 | 318 | 444 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.19/0.21 c 0.2s| 1 | 0 | 309 | - |1430k| 0 | 12 | 318 | 250 | 318 | 449 | 5 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 328 | - |1441k| 0 | 21 | 318 | 250 | 318 | 456 | 12 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 351 | - |1466k| 0 | 37 | 318 | 250 | 318 | 467 | 23 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 388 | - |1492k| 0 | 49 | 318 | 250 | 318 | 482 | 38 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 407 | - |1520k| 0 | 47 | 318 | 250 | 318 | 507 | 63 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.38 c 0.4s| 1 | 0 | 462 | - |1548k| 0 | 55 | 318 | 250 | 318 | 522 | 78 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 2 | 462 | - |1548k| 0 | 55 | 318 | 250 | 318 | 522 | 78 | 0 | 9 | 2.000000e+00 | -- | Inf
3.79/3.86 o 3
3.79/3.86 c * 3.8s| 1147 | 314 | 9667 | 8.0 |2383k| 54 | - | 318 |1209 | 318 | 206 |3641 | 959 |1790 | 2.000000e+00 | 3.000000e+00 | 50.00%
4.40/4.42 o 2
4.40/4.42 c * 4.4s| 1500 | 0 | 10979 | 7.0 |2193k| 54 | - | 318 |1458 | 318 | 197 |4097 |1293 |2037 | 2.000000e+00 | 2.000000e+00 | 0.00%
4.40/4.42 c
4.40/4.42 c SCIP Status : problem is solved [optimal solution found]
4.40/4.42 c Solving Time (sec) : 4.40
4.40/4.42 c Solving Nodes : 1500
4.40/4.42 c Primal Bound : +2.00000000000000e+00 (2 solutions)
4.40/4.42 c Dual Bound : +2.00000000000000e+00
4.40/4.42 c Gap : 0.00 %
4.40/4.42 s OPTIMUM FOUND
4.40/4.42 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 -x65 -x64
4.40/4.42 v 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 x50 -x49 -x78
4.40/4.42 v -x77 -x76 -x75 -x74 x73 x48 x47 -x46 x45 x44 -x43 x42 x41 x40 -x39 x38 x37 x36 x35 -x34 x33 -x32 x31 -x30 x29 x28 -x27 x26 x25
4.40/4.42 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.40/4.42 c SCIP Status : problem is solved [optimal solution found]
4.40/4.42 c Solving Time : 4.40
4.40/4.42 c Original Problem :
4.40/4.42 c Problem name : HOME/instance-2703000-1278564381.opb
4.40/4.42 c Variables : 324 (324 binary, 0 integer, 0 implicit integer, 0 continuous)
4.40/4.42 c Constraints : 229 initial, 229 maximal
4.40/4.42 c Presolved Problem :
4.40/4.42 c Problem name : t_HOME/instance-2703000-1278564381.opb
4.40/4.42 c Variables : 318 (318 binary, 0 integer, 0 implicit integer, 0 continuous)
4.40/4.42 c Constraints : 229 initial, 1458 maximal
4.40/4.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.40/4.42 c trivial : 0.00 0 0 0 0 0 0 0 0
4.40/4.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.40/4.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.40/4.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.40/4.42 c implics : 0.00 0 0 0 0 0 0 0 0
4.40/4.42 c probing : 0.02 0 0 0 0 0 0 0 0
4.40/4.42 c and : 0.01 0 0 0 0 0 0 0 0
4.40/4.42 c linear : 0.00 1 5 0 0 0 0 0 28
4.40/4.42 c logicor : 0.00 0 0 0 0 0 0 0 0
4.40/4.42 c root node : - 70 - - 70 - - - -
4.40/4.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.40/4.42 c integral : 0 0 0 1197 0 0 158 0 0 2244
4.40/4.42 c and : 215 2488 5684 1 0 204 7775 4051 0 0
4.40/4.42 c linear : 6+ 7 5479 1 0 367 3259 4 0 0
4.40/4.42 c logicor : 8+ 6 2382 1 0 11 738 0 0 0
4.40/4.42 c countsols : 0 0 0 2 0 0 0 0 0 0
4.40/4.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.40/4.42 c integral : 1.93 0.00 0.00 1.93 0.00
4.40/4.42 c and : 0.14 0.07 0.07 0.00 0.00
4.40/4.42 c linear : 0.11 0.00 0.11 0.00 0.00
4.40/4.42 c logicor : 0.02 0.00 0.02 0.00 0.00
4.40/4.42 c countsols : 0.00 0.00 0.00 0.00 0.00
4.40/4.42 c Propagators : Time Calls Cutoffs DomReds
4.40/4.42 c vbounds : 0.00 2 0 0
4.40/4.42 c rootredcost : 0.00 1 0 5
4.40/4.42 c pseudoobj : 0.01 5315 0 1
4.40/4.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.40/4.42 c propagation : 0.05 582 575 3798 27.4 166 19.4 -
4.40/4.42 c infeasible LP : 0.00 10 10 54 28.6 2 15.0 0
4.40/4.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.40/4.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.40/4.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.40/4.42 c applied globally : - - - 1293 17.0 - - -
4.40/4.42 c applied locally : - - - 0 0.0 - - -
4.40/4.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.40/4.42 c cut pool : 0.00 5 - - 18 - (maximal pool size: 116)
4.40/4.42 c redcost : 0.03 2489 0 0 0 0
4.40/4.42 c impliedbounds : 0.00 6 0 0 38 0
4.40/4.42 c intobj : 0.00 0 0 0 0 0
4.40/4.42 c cgmip : 0.00 0 0 0 0 0
4.40/4.42 c gomory : 0.05 6 0 0 56 0
4.40/4.42 c strongcg : 0.04 6 0 0 109 0
4.40/4.42 c cmir : 0.02 6 0 0 53 0
4.40/4.42 c flowcover : 0.05 6 0 0 104 0
4.40/4.42 c clique : 0.00 1 0 0 0 0
4.40/4.42 c zerohalf : 0.00 0 0 0 0 0
4.40/4.42 c mcf : 0.00 1 0 0 0 0
4.40/4.42 c rapidlearning : 0.12 1 0 0 0 21
4.40/4.42 c Pricers : Time Calls Vars
4.40/4.42 c problem variables: 0.00 0 0
4.40/4.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.40/4.42 c relpscost : 1.93 1195 0 158 0 0 2244
4.40/4.42 c pscost : 0.00 0 0 0 0 0 0
4.40/4.42 c inference : 0.00 0 0 0 0 0 0
4.40/4.42 c mostinf : 0.00 0 0 0 0 0 0
4.40/4.42 c leastinf : 0.00 0 0 0 0 0 0
4.40/4.42 c fullstrong : 0.00 0 0 0 0 0 0
4.40/4.42 c allfullstrong : 0.00 0 0 0 0 0 0
4.40/4.42 c random : 0.00 0 0 0 0 0 0
4.40/4.42 c Primal Heuristics : Time Calls Found
4.40/4.42 c LP solutions : 0.00 - 2
4.40/4.42 c pseudo solutions : 0.00 - 0
4.40/4.42 c crossover : 0.00 0 0
4.40/4.42 c oneopt : 0.00 1 0
4.40/4.42 c coefdiving : 0.01 1 0
4.40/4.42 c pscostdiving : 0.01 1 0
4.40/4.42 c fracdiving : 0.00 1 0
4.40/4.42 c veclendiving : 0.01 1 0
4.40/4.42 c linesearchdiving : 0.00 1 0
4.40/4.42 c guideddiving : 0.00 1 0
4.40/4.42 c feaspump : 0.01 1 0
4.40/4.42 c objpscostdiving : 0.01 1 0
4.40/4.42 c rootsoldiving : 0.01 1 0
4.40/4.42 c trivial : 0.00 2 0
4.40/4.42 c simplerounding : 0.00 0 0
4.40/4.42 c zirounding : 0.01 1000 0
4.40/4.42 c rounding : 0.04 658 0
4.40/4.42 c shifting : 0.21 168 0
4.40/4.42 c intshifting : 0.00 0 0
4.40/4.42 c twoopt : 0.00 0 0
4.40/4.42 c fixandinfer : 0.00 0 0
4.40/4.42 c intdiving : 0.00 0 0
4.40/4.42 c actconsdiving : 0.00 0 0
4.40/4.42 c octane : 0.00 0 0
4.40/4.42 c rens : 0.02 1 0
4.40/4.42 c rins : 0.00 0 0
4.40/4.42 c localbranching : 0.00 0 0
4.40/4.42 c mutation : 0.00 0 0
4.40/4.42 c dins : 0.00 0 0
4.40/4.42 c undercover : 0.02 1 0
4.40/4.42 c nlp : 0.00 0 0
4.40/4.42 c trysol : 0.00 0 0
4.40/4.42 c LP : Time Calls Iterations Iter/call Iter/sec
4.40/4.42 c primal LP : 0.05 0 0 0.00 0.00
4.40/4.42 c dual LP : 1.01 2537 10312 4.06 10230.39
4.40/4.42 c lex dual LP : 0.00 0 0 0.00 -
4.40/4.42 c barrier LP : 0.00 0 0 0.00 -
4.40/4.42 c diving/probing LP: 0.04 106 667 6.29 15511.63
4.40/4.42 c strong branching : 1.90 2037 18484 9.07 9744.04
4.40/4.42 c (at root node) : - 9 607 67.44 -
4.40/4.42 c conflict analysis: 0.00 0 0 0.00 -
4.40/4.42 c B&B Tree :
4.40/4.42 c number of runs : 1
4.40/4.42 c nodes : 1500
4.40/4.42 c nodes (total) : 1500
4.40/4.42 c nodes left : 0
4.40/4.42 c max depth : 54
4.40/4.42 c max depth (total): 54
4.40/4.42 c backtracks : 282 (18.8%)
4.40/4.42 c delayed cutoffs : 228
4.40/4.42 c repropagations : 811 (3070 domain reductions, 195 cutoffs)
4.40/4.42 c avg switch length: 3.82
4.40/4.42 c switching time : 0.13
4.40/4.42 c Solution :
4.40/4.42 c Solutions found : 2 (2 improvements)
4.40/4.42 c First Solution : +3.00000000000000e+00 (in run 1, after 1147 nodes, 3.85 seconds, depth 53, found by <relaxation>)
4.40/4.42 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1500 nodes, 4.40 seconds, depth 47, found by <relaxation>)
4.40/4.42 c Dual Bound : +2.00000000000000e+00
4.40/4.42 c Gap : 0.00 %
4.40/4.42 c Root Dual Bound : +2.00000000000000e+00
4.40/4.42 c Root Iterations : 462
4.40/4.43 c Time complete: 4.42.