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-2702979-1278564369.opb>
0.00/0.01 c original problem has 320 variables (320 bin, 0 int, 0 impl, 0 cont) and 217 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) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 0 upgd conss, 1540 impls, 0 clqs
0.00/0.03 c (round 2) 11 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 9 upgd conss, 1562 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 189/309 (61.2%) - 0 fixings, 0 aggregations, 31 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 11 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 27 changed coefficients
0.00/0.04 c 1624 implications, 0 cliques
0.00/0.04 c presolved problem has 309 variables (309 bin, 0 int, 0 impl, 0 cont) and 217 constraints
0.00/0.04 c 199 constraints of type <and>
0.00/0.04 c 8 constraints of type <linear>
0.00/0.04 c 10 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.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 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 | 21 | - |1342k| 0 | 11 | 309 | 217 | 309 | 413 | 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.19 c 0.2s| 1 | 0 | 394 | - |1371k| 0 | 18 | 309 | 217 | 309 | 419 | 6 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 416 | - |1396k| 0 | 30 | 309 | 217 | 309 | 444 | 31 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 452 | - |1451k| 0 | 35 | 309 | 217 | 309 | 484 | 71 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 486 | - |1494k| 0 | 64 | 309 | 217 | 309 | 499 | 86 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 532 | - |1543k| 0 | 73 | 309 | 217 | 309 | 534 | 121 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.39 c 0.4s| 1 | 0 | 601 | - |1574k| 0 | 81 | 309 | 217 | 309 | 551 | 138 | 0 | 0 | 2.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 2 | 601 | - |1574k| 0 | 81 | 309 | 217 | 309 | 551 | 138 | 0 | 11 | 2.000000e+00 | -- | Inf
3.20/3.20 o 2
3.20/3.20 c * 3.2s| 335 | 0 | 4812 | 12.6 |1830k| 56 | - | 309 | 472 | 309 | 241 |1111 | 255 |1469 | 2.000000e+00 | 2.000000e+00 | 0.00%
3.20/3.20 c
3.20/3.20 c SCIP Status : problem is solved [optimal solution found]
3.20/3.20 c Solving Time (sec) : 3.19
3.20/3.20 c Solving Nodes : 335
3.20/3.20 c Primal Bound : +2.00000000000000e+00 (1 solutions)
3.20/3.20 c Dual Bound : +2.00000000000000e+00
3.20/3.20 c Gap : 0.00 %
3.20/3.20 s OPTIMUM FOUND
3.20/3.20 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x80 -x79 -x78 x77 -x76 -x110 -x109 x108 x107 x106 -x75 x74 -x73 x72
3.20/3.20 v -x71 x105 -x104 x103 x102 x101 x70 -x69 -x68 x67 -x66 -x100 -x99 -x98 -x97 -x96 x65 x64 -x63 x62 -x61 -x95 -x94 x93 -x92 x91
3.20/3.20 v -x60 -x59 -x58 x57 -x56 -x90 -x89 x88 x87 x86 x55 -x54 -x53 x52 -x51 -x85 -x84 -x83 -x82 x81 x50 -x49 x48 x47 -x46 -x45 x44
3.20/3.20 v x43 x42 x41 -x40 x39 x38 -x37 x36 -x35 x34 x33 -x32 x31 x30 x29 x28 -x27 x26 -x25 x24 x23 -x22 x21 -x20 x19 -x18 -x17 x16 -x15
3.20/3.20 v x14 -x13 x12 x11 x10 x9 -x8 x7 x6 -x5 -x4 -x3 x2 -x1
3.20/3.20 c SCIP Status : problem is solved [optimal solution found]
3.20/3.20 c Solving Time : 3.19
3.20/3.20 c Original Problem :
3.20/3.20 c Problem name : HOME/instance-2702979-1278564369.opb
3.20/3.20 c Variables : 320 (320 binary, 0 integer, 0 implicit integer, 0 continuous)
3.20/3.20 c Constraints : 217 initial, 217 maximal
3.20/3.20 c Presolved Problem :
3.20/3.20 c Problem name : t_HOME/instance-2702979-1278564369.opb
3.20/3.20 c Variables : 309 (309 binary, 0 integer, 0 implicit integer, 0 continuous)
3.20/3.20 c Constraints : 217 initial, 472 maximal
3.20/3.20 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.20/3.20 c trivial : 0.00 0 0 0 0 0 0 0 0
3.20/3.20 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.20/3.20 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.20/3.20 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.20/3.20 c implics : 0.00 0 2 0 0 0 0 0 0
3.20/3.20 c probing : 0.02 0 0 0 0 0 0 0 0
3.20/3.20 c and : 0.01 0 0 0 0 0 0 0 0
3.20/3.20 c linear : 0.00 1 8 0 0 0 0 0 27
3.20/3.20 c logicor : 0.00 0 0 0 0 0 0 0 0
3.20/3.20 c root node : - 0 - - 0 - - - -
3.20/3.20 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.20/3.20 c integral : 0 0 0 316 0 1 53 0 0 572
3.20/3.20 c and : 199 642 1530 1 0 36 1436 1006 0 0
3.20/3.20 c linear : 8 6 1494 1 0 37 571 0 0 0
3.20/3.20 c logicor : 10+ 6 372 1 0 0 43 0 0 0
3.20/3.20 c countsols : 0 0 0 1 0 0 0 0 0 0
3.20/3.20 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.20/3.20 c integral : 2.02 0.00 0.00 2.02 0.00
3.20/3.20 c and : 0.04 0.02 0.02 0.00 0.00
3.20/3.20 c linear : 0.02 0.00 0.02 0.00 0.00
3.20/3.20 c logicor : 0.00 0.00 0.00 0.00 0.00
3.20/3.20 c countsols : 0.00 0.00 0.00 0.00 0.00
3.20/3.20 c Propagators : Time Calls Cutoffs DomReds
3.20/3.20 c vbounds : 0.00 2 0 0
3.20/3.20 c rootredcost : 0.00 0 0 0
3.20/3.20 c pseudoobj : 0.00 1135 0 0
3.20/3.20 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.20/3.20 c propagation : 0.01 73 68 457 24.2 17 19.9 -
3.20/3.20 c infeasible LP : 0.00 19 19 40 14.3 0 0.0 0
3.20/3.20 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.20/3.20 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.20/3.20 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.20/3.20 c applied globally : - - - 255 17.7 - - -
3.20/3.20 c applied locally : - - - 0 0.0 - - -
3.20/3.20 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.20/3.20 c cut pool : 0.00 5 - - 50 - (maximal pool size: 256)
3.20/3.20 c redcost : 0.01 642 0 0 0 0
3.20/3.20 c impliedbounds : 0.00 6 0 0 96 0
3.20/3.20 c intobj : 0.00 0 0 0 0 0
3.20/3.20 c cgmip : 0.00 0 0 0 0 0
3.20/3.20 c gomory : 0.06 6 0 0 121 0
3.20/3.20 c strongcg : 0.04 6 0 0 148 0
3.20/3.20 c cmir : 0.03 6 0 0 75 0
3.20/3.20 c flowcover : 0.04 6 0 0 152 0
3.20/3.20 c clique : 0.00 6 0 0 0 0
3.20/3.20 c zerohalf : 0.00 0 0 0 0 0
3.20/3.20 c mcf : 0.00 1 0 0 0 0
3.20/3.20 c rapidlearning : 0.10 1 0 0 0 0
3.20/3.20 c Pricers : Time Calls Vars
3.20/3.20 c problem variables: 0.00 0 0
3.20/3.20 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.20/3.20 c relpscost : 2.02 315 1 53 0 0 572
3.20/3.20 c pscost : 0.00 0 0 0 0 0 0
3.20/3.20 c inference : 0.00 0 0 0 0 0 0
3.20/3.20 c mostinf : 0.00 0 0 0 0 0 0
3.20/3.20 c leastinf : 0.00 0 0 0 0 0 0
3.20/3.20 c fullstrong : 0.00 0 0 0 0 0 0
3.20/3.20 c allfullstrong : 0.00 0 0 0 0 0 0
3.20/3.20 c random : 0.00 0 0 0 0 0 0
3.20/3.20 c Primal Heuristics : Time Calls Found
3.20/3.20 c LP solutions : 0.00 - 1
3.20/3.20 c pseudo solutions : 0.00 - 0
3.20/3.20 c oneopt : 0.00 0 0
3.20/3.20 c crossover : 0.00 0 0
3.20/3.20 c linesearchdiving : 0.00 0 0
3.20/3.20 c guideddiving : 0.00 0 0
3.20/3.20 c intshifting : 0.00 0 0
3.20/3.20 c coefdiving : 0.01 1 0
3.20/3.20 c pscostdiving : 0.01 1 0
3.20/3.20 c fracdiving : 0.01 1 0
3.20/3.20 c veclendiving : 0.01 1 0
3.20/3.20 c feaspump : 0.01 1 0
3.20/3.20 c objpscostdiving : 0.01 1 0
3.20/3.20 c rootsoldiving : 0.05 1 0
3.20/3.20 c trivial : 0.00 2 0
3.20/3.20 c simplerounding : 0.00 0 0
3.20/3.20 c zirounding : 0.01 284 0
3.20/3.20 c rounding : 0.02 309 0
3.20/3.20 c shifting : 0.10 69 0
3.20/3.20 c twoopt : 0.00 0 0
3.20/3.20 c fixandinfer : 0.00 0 0
3.20/3.20 c intdiving : 0.00 0 0
3.20/3.20 c actconsdiving : 0.00 0 0
3.20/3.20 c octane : 0.00 0 0
3.20/3.20 c rens : 0.02 1 0
3.20/3.20 c rins : 0.00 0 0
3.20/3.20 c localbranching : 0.00 0 0
3.20/3.20 c mutation : 0.00 0 0
3.20/3.21 c dins : 0.00 0 0
3.20/3.21 c undercover : 0.02 1 0
3.20/3.21 c nlp : 0.00 0 0
3.20/3.21 c trysol : 0.00 0 0
3.20/3.21 c LP : Time Calls Iterations Iter/call Iter/sec
3.20/3.21 c primal LP : 0.01 0 0 0.00 0.00
3.20/3.21 c dual LP : 0.38 658 3870 5.88 10265.44
3.20/3.21 c lex dual LP : 0.00 0 0 0.00 -
3.20/3.21 c barrier LP : 0.00 0 0 0.00 -
3.20/3.21 c diving/probing LP: 0.08 220 942 4.28 11775.29
3.20/3.21 c strong branching : 2.01 1469 18981 12.92 9429.43
3.20/3.21 c (at root node) : - 11 1003 91.18 -
3.20/3.21 c conflict analysis: 0.00 0 0 0.00 -
3.20/3.21 c B&B Tree :
3.20/3.21 c number of runs : 1
3.20/3.21 c nodes : 335
3.20/3.21 c nodes (total) : 335
3.20/3.21 c nodes left : 0
3.20/3.21 c max depth : 56
3.20/3.21 c max depth (total): 56
3.20/3.21 c backtracks : 29 (8.7%)
3.20/3.21 c delayed cutoffs : 19
3.20/3.21 c repropagations : 69 (252 domain reductions, 17 cutoffs)
3.20/3.21 c avg switch length: 2.47
3.20/3.21 c switching time : 0.03
3.20/3.21 c Solution :
3.20/3.21 c Solutions found : 1 (1 improvements)
3.20/3.21 c First Solution : +2.00000000000000e+00 (in run 1, after 335 nodes, 3.19 seconds, depth 56, found by <relaxation>)
3.20/3.21 c Primal Bound : +2.00000000000000e+00 (in run 1, after 335 nodes, 3.19 seconds, depth 56, found by <relaxation>)
3.20/3.21 c Dual Bound : +2.00000000000000e+00
3.20/3.21 c Gap : 0.00 %
3.20/3.21 c Root Dual Bound : +2.00000000000000e+00
3.20/3.21 c Root Iterations : 601
3.20/3.21 c Time complete: 3.2.