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-2703037-1278564409.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.01/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.01/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.01/0.04 c (0.0s) probing: 189/309 (61.2%) - 0 fixings, 0 aggregations, 31 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 11 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 27 changed coefficients
0.01/0.04 c 1624 implications, 0 cliques
0.01/0.04 c presolved problem has 309 variables (309 bin, 0 int, 0 impl, 0 cont) and 217 constraints
0.01/0.04 c 199 constraints of type <and>
0.01/0.04 c 8 constraints of type <linear>
0.01/0.04 c 10 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.03
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 = 1789.99
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.05 c
0.01/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.01/0.05 c 0.0s| 1 | 0 | 21 | - |1342k| 0 | 11 | 309 | 217 | 309 | 413 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.01/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.16 c 0.2s| 1 | 0 | 223 | - |1361k| 0 | 23 | 309 | 217 | 309 | 419 | 6 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 242 | - |1422k| 0 | 35 | 309 | 217 | 309 | 457 | 44 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 288 | - |1460k| 0 | 40 | 309 | 217 | 309 | 483 | 70 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 306 | - |1523k| 0 | 54 | 309 | 217 | 309 | 511 | 98 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 321 | - |1544k| 0 | 65 | 309 | 217 | 309 | 522 | 109 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 369 | - |1566k| 0 | 77 | 309 | 217 | 309 | 535 | 122 | 0 | 0 | 2.000000e+00 | -- | Inf
0.40/0.46 c 0.4s| 1 | 2 | 369 | - |1567k| 0 | 77 | 309 | 217 | 309 | 535 | 122 | 0 | 10 | 2.000000e+00 | -- | Inf
2.49/2.52 o 3
2.49/2.52 c c 2.5s| 250 | 116 | 4291 | 15.8 |1832k| 37 | - | 309 | 412 | 309 | 231 |1060 | 195 |1446 | 2.000000e+00 | 3.000000e+00 | 50.00%
2.69/2.79 o 2
2.69/2.79 c * 2.8s| 446 | 0 | 5106 | 10.6 |1778k| 43 | - | 309 | 581 | 309 | 215 |1278 | 427 |1551 | 2.000000e+00 | 2.000000e+00 | 0.00%
2.69/2.79 c
2.69/2.79 c SCIP Status : problem is solved [optimal solution found]
2.69/2.79 c Solving Time (sec) : 2.78
2.69/2.79 c Solving Nodes : 446
2.69/2.79 c Primal Bound : +2.00000000000000e+00 (2 solutions)
2.69/2.79 c Dual Bound : +2.00000000000000e+00
2.69/2.79 c Gap : 0.00 %
2.69/2.79 s OPTIMUM FOUND
2.69/2.79 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 -x71
2.69/2.79 v -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
2.69/2.79 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 x43
2.69/2.79 v -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
2.69/2.79 v x14 x13 x12 x11 x10 x9 -x8 x7 x6 -x5 -x4 -x3 x2 -x1
2.69/2.79 c SCIP Status : problem is solved [optimal solution found]
2.69/2.79 c Solving Time : 2.78
2.69/2.79 c Original Problem :
2.69/2.79 c Problem name : HOME/instance-2703037-1278564409.opb
2.69/2.79 c Variables : 320 (320 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.79 c Constraints : 217 initial, 217 maximal
2.69/2.79 c Presolved Problem :
2.69/2.79 c Problem name : t_HOME/instance-2703037-1278564409.opb
2.69/2.79 c Variables : 309 (309 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.79 c Constraints : 217 initial, 581 maximal
2.69/2.79 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.69/2.79 c trivial : 0.00 0 0 0 0 0 0 0 0
2.69/2.79 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.69/2.79 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.69/2.79 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.69/2.79 c implics : 0.00 0 2 0 0 0 0 0 0
2.69/2.79 c probing : 0.02 0 0 0 0 0 0 0 0
2.69/2.79 c and : 0.01 0 0 0 0 0 0 0 0
2.69/2.79 c linear : 0.00 1 8 0 0 0 0 0 27
2.69/2.79 c logicor : 0.00 0 0 0 0 0 0 0 0
2.69/2.79 c root node : - 63 - - 63 - - - -
2.69/2.79 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.69/2.79 c integral : 0 0 0 375 0 0 27 0 0 718
2.69/2.79 c and : 199 766 2131 0 0 42 1896 1185 0 0
2.69/2.79 c linear : 8 6 2088 0 0 114 999 0 0 0
2.69/2.79 c logicor : 10+ 6 726 1 0 3 192 0 0 0
2.69/2.79 c countsols : 0 0 0 1 0 0 0 0 0 0
2.69/2.79 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.69/2.79 c integral : 1.62 0.00 0.00 1.62 0.00
2.69/2.79 c and : 0.04 0.02 0.02 0.00 0.00
2.69/2.79 c linear : 0.03 0.00 0.03 0.00 0.00
2.69/2.79 c logicor : 0.00 0.00 0.00 0.00 0.00
2.69/2.79 c countsols : 0.00 0.00 0.00 0.00 0.00
2.69/2.79 c Propagators : Time Calls Cutoffs DomReds
2.69/2.79 c vbounds : 0.00 2 0 0
2.69/2.79 c rootredcost : 0.00 1 0 4
2.69/2.79 c pseudoobj : 0.00 1737 0 1
2.69/2.79 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.69/2.79 c propagation : 0.01 159 158 1203 25.3 27 16.3 -
2.69/2.79 c infeasible LP : 0.00 8 8 39 30.1 3 19.7 0
2.69/2.79 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.79 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.79 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.79 c applied globally : - - - 427 17.0 - - -
2.69/2.79 c applied locally : - - - 0 0.0 - - -
2.69/2.79 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.69/2.79 c cut pool : 0.00 5 - - 40 - (maximal pool size: 203)
2.69/2.79 c redcost : 0.01 767 0 0 0 0
2.69/2.79 c impliedbounds : 0.00 6 0 0 84 0
2.69/2.79 c intobj : 0.00 0 0 0 0 0
2.69/2.79 c cgmip : 0.00 0 0 0 0 0
2.69/2.79 c gomory : 0.05 6 0 0 3 0
2.69/2.79 c strongcg : 0.04 6 0 0 122 0
2.69/2.79 c cmir : 0.03 6 0 0 54 0
2.69/2.79 c flowcover : 0.05 6 0 0 117 0
2.69/2.79 c clique : 0.00 6 0 0 0 0
2.69/2.79 c zerohalf : 0.00 0 0 0 0 0
2.69/2.79 c mcf : 0.00 1 0 0 0 0
2.69/2.79 c rapidlearning : 0.07 1 0 0 0 0
2.69/2.79 c Pricers : Time Calls Vars
2.69/2.79 c problem variables: 0.00 0 0
2.69/2.79 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.69/2.79 c relpscost : 1.62 374 0 27 0 0 718
2.69/2.79 c pscost : 0.00 0 0 0 0 0 0
2.69/2.79 c inference : 0.00 0 0 0 0 0 0
2.69/2.79 c mostinf : 0.00 0 0 0 0 0 0
2.69/2.79 c leastinf : 0.00 0 0 0 0 0 0
2.69/2.79 c fullstrong : 0.00 0 0 0 0 0 0
2.69/2.79 c allfullstrong : 0.00 0 0 0 0 0 0
2.69/2.79 c random : 0.00 0 0 0 0 0 0
2.69/2.79 c Primal Heuristics : Time Calls Found
2.69/2.79 c LP solutions : 0.00 - 1
2.69/2.79 c pseudo solutions : 0.00 - 0
2.69/2.79 c crossover : 0.00 0 0
2.69/2.79 c guideddiving : 0.00 0 0
2.69/2.79 c intshifting : 0.00 0 0
2.69/2.79 c oneopt : 0.00 1 0
2.69/2.79 c pscostdiving : 0.02 1 0
2.69/2.79 c fracdiving : 0.01 1 0
2.69/2.79 c veclendiving : 0.01 1 0
2.69/2.79 c linesearchdiving : 0.01 1 0
2.69/2.79 c feaspump : 0.01 1 0
2.69/2.79 c objpscostdiving : 0.05 1 0
2.69/2.79 c rootsoldiving : 0.01 1 0
2.69/2.79 c coefdiving : 0.01 2 1
2.69/2.79 c trivial : 0.00 2 0
2.69/2.79 c simplerounding : 0.00 0 0
2.69/2.79 c zirounding : 0.01 351 0
2.69/2.79 c rounding : 0.01 338 0
2.69/2.79 c shifting : 0.10 64 0
2.69/2.79 c twoopt : 0.00 0 0
2.69/2.79 c fixandinfer : 0.00 0 0
2.69/2.79 c intdiving : 0.00 0 0
2.69/2.79 c actconsdiving : 0.00 0 0
2.69/2.79 c octane : 0.00 0 0
2.69/2.79 c rens : 0.02 1 0
2.69/2.79 c rins : 0.00 0 0
2.69/2.79 c localbranching : 0.00 0 0
2.69/2.79 c mutation : 0.00 0 0
2.69/2.79 c dins : 0.00 0 0
2.69/2.79 c undercover : 0.02 1 0
2.69/2.79 c nlp : 0.00 0 0
2.69/2.79 c trysol : 0.00 0 0
2.69/2.79 c LP : Time Calls Iterations Iter/call Iter/sec
2.69/2.79 c primal LP : 0.01 0 0 0.00 0.00
2.69/2.79 c dual LP : 0.38 769 3888 5.06 10258.39
2.69/2.79 c lex dual LP : 0.00 0 0 0.00 -
2.69/2.79 c barrier LP : 0.00 0 0 0.00 -
2.69/2.79 c diving/probing LP: 0.10 278 1218 4.38 12687.50
2.69/2.79 c strong branching : 1.59 1551 14736 9.50 9261.97
2.69/2.79 c (at root node) : - 10 589 58.90 -
2.69/2.79 c conflict analysis: 0.00 0 0 0.00 -
2.69/2.79 c B&B Tree :
2.69/2.79 c number of runs : 1
2.69/2.79 c nodes : 446
2.69/2.79 c nodes (total) : 446
2.69/2.79 c nodes left : 0
2.69/2.79 c max depth : 43
2.69/2.79 c max depth (total): 43
2.69/2.79 c backtracks : 76 (17.0%)
2.69/2.79 c delayed cutoffs : 61
2.69/2.79 c repropagations : 220 (882 domain reductions, 58 cutoffs)
2.69/2.79 c avg switch length: 3.35
2.69/2.79 c switching time : 0.03
2.69/2.79 c Solution :
2.69/2.79 c Solutions found : 2 (2 improvements)
2.69/2.79 c First Solution : +3.00000000000000e+00 (in run 1, after 250 nodes, 2.51 seconds, depth 42, found by <coefdiving>)
2.69/2.79 c Primal Bound : +2.00000000000000e+00 (in run 1, after 446 nodes, 2.78 seconds, depth 43, found by <relaxation>)
2.69/2.79 c Dual Bound : +2.00000000000000e+00
2.69/2.79 c Gap : 0.00 %
2.69/2.79 c Root Dual Bound : +2.00000000000000e+00
2.69/2.79 c Root Iterations : 369
2.79/2.80 c Time complete: 2.79.