0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
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-2666393-1276646545.opb>
0.00/0.01 c original problem has 324 variables (324 bin, 0 int, 0 impl, 0 cont) and 250 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.05 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 0 upgd conss, 1092 impls, 0 clqs
0.00/0.05 c (round 2) 21 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 4 upgd conss, 1668 impls, 0 clqs
0.00/0.05 c (round 3) 39 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 4 upgd conss, 1956 impls, 0 clqs
0.00/0.06 c (round 4) 57 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 4 upgd conss, 1956 impls, 0 clqs
0.06/0.07 c (0.0s) probing: 142/267 (53.2%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.06/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.06/0.07 c presolving (5 rounds):
0.06/0.07 c 57 deleted vars, 48 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 76 changed coefficients
0.06/0.07 c 1968 implications, 0 cliques
0.06/0.07 c presolved problem has 267 variables (267 bin, 0 int, 0 impl, 0 cont) and 199 constraints
0.06/0.07 c 192 constraints of type <and>
0.06/0.07 c 3 constraints of type <linear>
0.06/0.07 c 4 constraints of type <logicor>
0.06/0.07 c transformed objective value is always integral (scale: 2)
0.06/0.07 c Presolving Time: 0.03
0.06/0.07 c - non default parameters ----------------------------------------------------------------------
0.06/0.07 c # SCIP version 1.2.1.2
0.06/0.07 c
0.06/0.07 c # frequency for displaying node information lines
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.06/0.07 c display/freq = 10000
0.06/0.07 c
0.06/0.07 c # maximal time in seconds to run
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.07 c limits/time = 1800
0.06/0.07 c
0.06/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.07 c limits/memory = 1620
0.06/0.07 c
0.06/0.07 c # should presolving try to simplify inequalities
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/linear/simplifyinequalities = TRUE
0.06/0.07 c
0.06/0.07 c # should presolving try to simplify knapsacks
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c heuristics/undercover/freq = 0
0.06/0.07 c
0.06/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c separating/rapidlearning/freq = 0
0.06/0.07 c
0.06/0.07 c -----------------------------------------------------------------------------------------------
0.06/0.07 c start solving
0.06/0.08 c
0.06/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.06/0.08 c 0.1s| 1 | 0 | 10 | - |1291k| 0 | 6 | 267 | 199 | 267 | 391 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.59 c 0.4s| 1 | 0 | 256 | - |1315k| 0 | 11 | 267 | 199 | 267 | 393 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.62 c 0.4s| 1 | 0 | 266 | - |1340k| 0 | 19 | 267 | 199 | 267 | 399 | 8 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.67 c 0.5s| 1 | 0 | 276 | - |1361k| 0 | 26 | 267 | 199 | 267 | 405 | 14 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.73 c 0.5s| 1 | 0 | 283 | - |1373k| 0 | 25 | 267 | 199 | 267 | 411 | 20 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.80 c 0.6s| 1 | 0 | 291 | - |1396k| 0 | 29 | 267 | 199 | 267 | 415 | 24 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.86 c 0.6s| 1 | 0 | 310 | - |1407k| 0 | 31 | 267 | 199 | 267 | 421 | 30 | 0 | 0 | 3.000000e+00 | -- | Inf
1.00/1.01 c 0.8s| 1 | 2 | 310 | - |1407k| 0 | 31 | 267 | 199 | 267 | 421 | 30 | 0 | 24 | 3.000000e+00 | -- | Inf
2.69/2.76 o 3
2.69/2.76 c * 2.4s| 406 | 0 | 5394 | 12.6 |1520k| 44 | - | 267 | 272 | 267 | 86 |1984 | 73 |1395 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.69/2.76 c
2.69/2.76 c SCIP Status : problem is solved [optimal solution found]
2.69/2.76 c Solving Time (sec) : 2.42
2.69/2.76 c Solving Nodes : 406
2.69/2.76 c Primal Bound : +3.00000000000000e+00 (1 solutions)
2.69/2.76 c Dual Bound : +3.00000000000000e+00
2.69/2.76 c Gap : 0.00 %
2.69/2.76 s OPTIMUM FOUND
2.69/2.76 v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 x66 -x65 -x64 -x54 -x53 -x52 -x51 -x50 x49 x48 -x47
2.69/2.76 v x46 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x45 -x44 -x43 -x42 -x41 x40 -x39 -x38 x37 -x36 -x35 -x34 x33 -x32 -x31 x30
2.69/2.76 v -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 -x4 -x3 x2 x1
2.69/2.76 c SCIP Status : problem is solved [optimal solution found]
2.69/2.76 c Solving Time : 2.42
2.69/2.76 c Original Problem :
2.69/2.76 c Problem name : HOME/instance-2666393-1276646545.opb
2.69/2.76 c Variables : 324 (324 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.76 c Constraints : 250 initial, 250 maximal
2.69/2.76 c Presolved Problem :
2.69/2.76 c Problem name : t_HOME/instance-2666393-1276646545.opb
2.69/2.76 c Variables : 267 (267 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.76 c Constraints : 199 initial, 272 maximal
2.69/2.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.69/2.76 c trivial : 0.00 0 0 0 0 0 0 0 0
2.69/2.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.69/2.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.69/2.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.69/2.76 c implics : 0.00 0 0 0 0 0 0 0 0
2.69/2.76 c probing : 0.01 0 0 0 0 0 0 0 0
2.69/2.76 c and : 0.01 6 48 0 0 0 48 0 48
2.69/2.76 c linear : 0.00 1 2 0 0 0 0 0 28
2.69/2.76 c logicor : 0.00 0 0 0 0 0 0 0 0
2.69/2.76 c root node : - 0 - - 0 - - - -
2.69/2.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.69/2.76 c integral : 0 0 0 364 0 0 25 0 0 692
2.69/2.76 c and : 192 828 1441 1 0 15 1807 1968 0 0
2.69/2.76 c linear : 3 6 1426 1 0 59 733 0 0 0
2.69/2.76 c logicor : 4+ 6 260 1 0 3 36 0 0 0
2.69/2.76 c countsols : 0 0 0 1 0 0 0 0 0 0
2.69/2.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.69/2.76 c integral : 1.12 0.00 0.00 1.12 0.00
2.69/2.76 c and : 0.06 0.04 0.02 0.00 0.00
2.69/2.76 c linear : 0.03 0.00 0.03 0.00 0.00
2.69/2.76 c logicor : 0.00 0.00 0.00 0.00 0.00
2.69/2.76 c countsols : 0.00 0.00 0.00 0.00 0.00
2.69/2.76 c Propagators : Time Calls Cutoffs DomReds
2.69/2.76 c vbounds : 0.00 2 0 0
2.69/2.76 c rootredcost : 0.00 0 0 0
2.69/2.76 c pseudoobj : 0.00 1154 0 0
2.69/2.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.69/2.76 c propagation : 0.01 33 33 370 44.5 8 23.4 -
2.69/2.76 c infeasible LP : 0.00 7 7 32 28.3 0 0.0 0
2.69/2.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.76 c applied globally : - - - 73 18.4 - - -
2.69/2.76 c applied locally : - - - 0 0.0 - - -
2.69/2.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.69/2.76 c cut pool : 0.00 5 - - 2 - (maximal pool size: 42)
2.69/2.76 c redcost : 0.02 828 0 0 0 0
2.69/2.76 c impliedbounds : 0.00 6 0 0 11 0
2.69/2.76 c intobj : 0.00 0 0 0 0 0
2.69/2.76 c cgmip : 0.00 0 0 0 0 0
2.69/2.76 c gomory : 0.04 6 0 0 0 0
2.69/2.76 c strongcg : 0.03 6 0 0 1 0
2.69/2.76 c cmir : 0.03 6 0 0 21 0
2.69/2.76 c flowcover : 0.16 6 0 0 35 0
2.69/2.76 c clique : 0.00 1 0 0 0 0
2.69/2.76 c zerohalf : 0.00 0 0 0 0 0
2.69/2.76 c mcf : 0.00 1 0 0 0 0
2.69/2.76 c rapidlearning : 0.03 1 0 0 0 0
2.69/2.76 c Pricers : Time Calls Vars
2.69/2.76 c problem variables: 0.00 0 0
2.69/2.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.69/2.76 c relpscost : 1.12 363 0 25 0 0 692
2.69/2.76 c pscost : 0.00 0 0 0 0 0 0
2.69/2.76 c inference : 0.00 0 0 0 0 0 0
2.69/2.76 c mostinf : 0.00 0 0 0 0 0 0
2.69/2.76 c leastinf : 0.00 0 0 0 0 0 0
2.69/2.76 c fullstrong : 0.00 0 0 0 0 0 0
2.69/2.76 c allfullstrong : 0.00 0 0 0 0 0 0
2.69/2.76 c random : 0.00 0 0 0 0 0 0
2.69/2.76 c Primal Heuristics : Time Calls Found
2.69/2.76 c LP solutions : 0.00 - 1
2.69/2.76 c pseudo solutions : 0.00 - 0
2.69/2.76 c oneopt : 0.00 0 0
2.69/2.76 c crossover : 0.00 0 0
2.69/2.76 c guideddiving : 0.00 0 0
2.69/2.76 c intshifting : 0.00 0 0
2.69/2.76 c pscostdiving : 0.01 1 0
2.69/2.76 c fracdiving : 0.01 1 0
2.69/2.76 c veclendiving : 0.00 1 0
2.69/2.76 c linesearchdiving : 0.01 1 0
2.69/2.76 c feaspump : 0.01 1 0
2.69/2.76 c objpscostdiving : 0.00 1 0
2.69/2.76 c rootsoldiving : 0.02 1 0
2.69/2.76 c coefdiving : 0.01 2 0
2.69/2.76 c trivial : 0.00 2 0
2.69/2.76 c simplerounding : 0.00 0 0
2.69/2.76 c zirounding : 0.00 346 0
2.69/2.76 c rounding : 0.01 373 0
2.69/2.76 c shifting : 0.07 81 0
2.69/2.76 c twoopt : 0.00 0 0
2.69/2.76 c fixandinfer : 0.00 0 0
2.69/2.76 c intdiving : 0.00 0 0
2.69/2.76 c actconsdiving : 0.00 0 0
2.69/2.76 c octane : 0.00 0 0
2.69/2.76 c rens : 0.01 1 0
2.69/2.76 c rins : 0.00 0 0
2.69/2.76 c localbranching : 0.00 0 0
2.69/2.76 c mutation : 0.00 0 0
2.69/2.76 c dins : 0.00 0 0
2.69/2.76 c undercover : 0.28 1 0
2.69/2.76 c nlp : 0.00 0 0
2.69/2.76 c trysol : 0.01 0 0
2.69/2.76 c LP : Time Calls Iterations Iter/call Iter/sec
2.69/2.76 c primal LP : 0.01 0 0 0.00 0.00
2.69/2.76 c dual LP : 0.35 877 4489 5.12 12825.71
2.69/2.76 c lex dual LP : 0.00 0 0 0.00 -
2.69/2.76 c barrier LP : 0.00 0 0 0.00 -
2.69/2.76 c diving/probing LP: 0.03 115 905 7.87 30166.67
2.69/2.76 c strong branching : 1.09 1395 14852 10.65 13625.69
2.69/2.76 c (at root node) : - 24 1217 50.71 -
2.69/2.76 c conflict analysis: 0.00 0 0 0.00 -
2.69/2.76 c B&B Tree :
2.69/2.76 c number of runs : 1
2.69/2.76 c nodes : 406
2.69/2.76 c nodes (total) : 406
2.69/2.76 c nodes left : 0
2.69/2.76 c max depth : 44
2.69/2.76 c max depth (total): 44
2.69/2.76 c backtracks : 34 (8.4%)
2.69/2.76 c delayed cutoffs : 8
2.69/2.76 c repropagations : 40 (136 domain reductions, 8 cutoffs)
2.69/2.76 c avg switch length: 2.57
2.69/2.76 c switching time : 0.01
2.69/2.76 c Solution :
2.69/2.76 c Solutions found : 1 (1 improvements)
2.69/2.76 c First Solution : +3.00000000000000e+00 (in run 1, after 406 nodes, 2.42 seconds, depth 32, found by <relaxation>)
2.69/2.76 c Primal Bound : +3.00000000000000e+00 (in run 1, after 406 nodes, 2.42 seconds, depth 32, found by <relaxation>)
2.69/2.76 c Dual Bound : +3.00000000000000e+00
2.69/2.76 c Gap : 0.00 %
2.69/2.76 c Root Dual Bound : +3.00000000000000e+00
2.69/2.76 c Root Iterations : 310
2.69/2.77 c Time complete: 2.76.