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-2666372-1276646012.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.00/0.07 c (0.0s) probing: 142/267 (53.2%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.00/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (5 rounds):
0.00/0.07 c 57 deleted vars, 48 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 76 changed coefficients
0.00/0.07 c 1968 implications, 0 cliques
0.00/0.07 c presolved problem has 267 variables (267 bin, 0 int, 0 impl, 0 cont) and 199 constraints
0.00/0.07 c 192 constraints of type <and>
0.00/0.07 c 3 constraints of type <linear>
0.00/0.07 c 4 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 2)
0.00/0.07 c Presolving Time: 0.04
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c heuristics/undercover/freq = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.08 c
0.07/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.07/0.08 c 0.0s| 1 | 0 | 10 | - |1291k| 0 | 6 | 267 | 199 | 267 | 391 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.58 c 0.4s| 1 | 0 | 248 | - |1315k| 0 | 10 | 267 | 199 | 267 | 393 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.61 c 0.4s| 1 | 0 | 264 | - |1342k| 0 | 20 | 267 | 199 | 267 | 398 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.67 c 0.5s| 1 | 0 | 288 | - |1391k| 0 | 25 | 267 | 199 | 267 | 406 | 15 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.74 c 0.5s| 1 | 0 | 308 | - |1413k| 0 | 29 | 267 | 199 | 267 | 412 | 21 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.82 c 0.6s| 1 | 0 | 321 | - |1430k| 0 | 34 | 267 | 199 | 267 | 420 | 29 | 0 | 0 | 3.000000e+00 | -- | Inf
0.89/0.91 c 0.7s| 1 | 0 | 334 | - |1454k| 0 | 44 | 267 | 199 | 267 | 428 | 37 | 0 | 0 | 3.000000e+00 | -- | Inf
1.29/1.31 c 1.1s| 1 | 2 | 334 | - |1455k| 0 | 44 | 267 | 199 | 267 | 428 | 37 | 0 | 24 | 3.000000e+00 | -- | Inf
4.99/5.01 o 27
4.99/5.01 c * 4.6s| 998 | 354 | 8520 | 8.2 |2016k| 41 | - | 267 | 463 | 267 | 149 |2638 | 271 |1802 | 3.000000e+00 | 2.700000e+01 | 800.00%
4.99/5.02 o 9
4.99/5.02 c * 4.6s| 1001 | 285 | 8534 | 8.2 |1945k| 41 | - | 267 | 418 | 267 | 155 |2644 | 271 |1806 | 3.000000e+00 | 9.000000e+00 | 200.00%
6.39/6.47 o 3
6.39/6.47 c * 6.0s| 2446 | 0 | 15119 | 6.0 |1876k| 43 | - | 267 | 949 | 267 | 122 |5050 | 826 |1896 | 3.000000e+00 | 3.000000e+00 | 0.00%
6.39/6.47 c
6.39/6.47 c SCIP Status : problem is solved [optimal solution found]
6.39/6.47 c Solving Time (sec) : 5.95
6.39/6.47 c Solving Nodes : 2446
6.39/6.47 c Primal Bound : +3.00000000000000e+00 (3 solutions)
6.39/6.47 c Dual Bound : +3.00000000000000e+00
6.39/6.47 c Gap : 0.00 %
6.39/6.47 s OPTIMUM FOUND
6.39/6.47 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 x46 -x63
6.39/6.47 v -x62 -x61 -x60 -x59 -x58 -x57 -x56 x55 x45 -x44 -x43 -x42 -x41 x40 x39 x38 x37 -x36 -x35 x34 -x33 -x32 x31 -x30 -x29 x28 -x27
6.39/6.47 v 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
6.39/6.47 c SCIP Status : problem is solved [optimal solution found]
6.39/6.47 c Solving Time : 5.95
6.39/6.47 c Original Problem :
6.39/6.47 c Problem name : HOME/instance-2666372-1276646012.opb
6.39/6.47 c Variables : 324 (324 binary, 0 integer, 0 implicit integer, 0 continuous)
6.39/6.47 c Constraints : 250 initial, 250 maximal
6.39/6.47 c Presolved Problem :
6.39/6.47 c Problem name : t_HOME/instance-2666372-1276646012.opb
6.39/6.47 c Variables : 267 (267 binary, 0 integer, 0 implicit integer, 0 continuous)
6.39/6.47 c Constraints : 199 initial, 949 maximal
6.39/6.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.39/6.47 c trivial : 0.00 0 0 0 0 0 0 0 0
6.39/6.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.39/6.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.39/6.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.39/6.47 c implics : 0.00 0 0 0 0 0 0 0 0
6.39/6.47 c probing : 0.02 0 0 0 0 0 0 0 0
6.39/6.47 c and : 0.02 6 48 0 0 0 48 0 48
6.39/6.47 c linear : 0.00 1 2 0 0 0 0 0 28
6.39/6.47 c logicor : 0.00 0 0 0 0 0 0 0 0
6.39/6.47 c root node : - 60 - - 60 - - - -
6.39/6.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.39/6.47 c integral : 0 0 0 1805 0 0 74 0 0 3518
6.39/6.47 c and : 192 3890 6901 1 0 153 11592 5030 0 0
6.39/6.47 c linear : 3 6 6747 1 0 666 5085 0 0 0
6.39/6.47 c logicor : 4+ 6 2541 1 0 17 583 0 0 0
6.39/6.47 c countsols : 0 0 0 3 0 0 0 0 0 0
6.39/6.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.39/6.47 c integral : 2.67 0.00 0.00 2.67 0.00
6.39/6.47 c and : 0.11 0.03 0.08 0.00 0.00
6.39/6.47 c linear : 0.23 0.00 0.23 0.00 0.00
6.39/6.47 c logicor : 0.03 0.00 0.03 0.00 0.00
6.39/6.47 c countsols : 0.00 0.00 0.00 0.00 0.00
6.39/6.47 c Propagators : Time Calls Cutoffs DomReds
6.39/6.47 c vbounds : 0.01 2 0 0
6.39/6.47 c rootredcost : 0.00 2 0 6
6.39/6.47 c pseudoobj : 0.02 6615 0 0
6.39/6.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.39/6.47 c propagation : 0.14 413 412 4487 46.2 315 21.4 -
6.39/6.47 c infeasible LP : 0.00 33 25 172 35.3 7 3.3 0
6.39/6.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.39/6.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.39/6.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.39/6.47 c applied globally : - - - 819 16.6 - - -
6.39/6.47 c applied locally : - - - 7 33.1 - - -
6.39/6.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.39/6.47 c cut pool : 0.00 5 - - 21 - (maximal pool size: 81)
6.39/6.47 c redcost : 0.02 3892 0 0 0 0
6.39/6.47 c impliedbounds : 0.00 6 0 0 15 0
6.39/6.47 c intobj : 0.00 0 0 0 0 0
6.39/6.47 c cgmip : 0.00 0 0 0 0 0
6.39/6.47 c gomory : 0.05 6 0 0 0 0
6.39/6.47 c strongcg : 0.03 6 0 0 65 0
6.39/6.47 c cmir : 0.04 6 0 0 35 0
6.39/6.47 c flowcover : 0.21 6 0 0 68 0
6.39/6.47 c clique : 0.00 1 0 0 0 0
6.39/6.47 c zerohalf : 0.00 0 0 0 0 0
6.39/6.47 c mcf : 0.00 1 0 0 0 0
6.39/6.47 c rapidlearning : 0.03 1 0 0 0 0
6.39/6.47 c Pricers : Time Calls Vars
6.39/6.47 c problem variables: 0.00 0 0
6.39/6.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.39/6.47 c relpscost : 2.67 1802 0 74 0 0 3518
6.39/6.47 c pscost : 0.00 0 0 0 0 0 0
6.39/6.47 c inference : 0.00 0 0 0 0 0 0
6.39/6.47 c mostinf : 0.00 0 0 0 0 0 0
6.39/6.47 c leastinf : 0.00 0 0 0 0 0 0
6.39/6.47 c fullstrong : 0.00 0 0 0 0 0 0
6.39/6.47 c allfullstrong : 0.00 0 0 0 0 0 0
6.39/6.47 c random : 0.00 0 0 0 0 0 0
6.39/6.47 c Primal Heuristics : Time Calls Found
6.39/6.47 c LP solutions : 0.00 - 3
6.39/6.47 c pseudo solutions : 0.00 - 0
6.39/6.47 c crossover : 0.00 0 0
6.39/6.47 c guideddiving : 0.00 0 0
6.39/6.47 c oneopt : 0.01 2 0
6.39/6.47 c linesearchdiving : 0.01 1 0
6.39/6.47 c feaspump : 0.01 1 0
6.39/6.47 c objpscostdiving : 0.01 1 0
6.39/6.47 c rootsoldiving : 0.07 1 0
6.39/6.47 c coefdiving : 0.02 2 0
6.39/6.47 c pscostdiving : 0.01 2 0
6.39/6.47 c fracdiving : 0.00 2 0
6.39/6.47 c veclendiving : 0.01 2 0
6.39/6.47 c trivial : 0.00 2 0
6.39/6.47 c simplerounding : 0.00 0 0
6.39/6.47 c zirounding : 0.02 1000 0
6.39/6.47 c rounding : 0.02 858 0
6.39/6.47 c shifting : 0.34 233 0
6.39/6.47 c intshifting : 0.00 0 0
6.39/6.47 c twoopt : 0.00 0 0
6.39/6.47 c fixandinfer : 0.00 0 0
6.39/6.47 c intdiving : 0.00 0 0
6.39/6.47 c actconsdiving : 0.00 0 0
6.39/6.47 c octane : 0.00 0 0
6.39/6.47 c rens : 0.01 1 0
6.39/6.47 c rins : 0.00 0 0
6.39/6.47 c localbranching : 0.00 0 0
6.39/6.47 c mutation : 0.00 0 0
6.39/6.47 c dins : 0.00 0 0
6.39/6.47 c undercover : 0.28 1 0
6.39/6.47 c nlp : 0.00 0 0
6.39/6.47 c trysol : 0.01 0 0
6.39/6.47 c LP : Time Calls Iterations Iter/call Iter/sec
6.39/6.47 c primal LP : 0.04 0 0 0.00 0.00
6.39/6.47 c dual LP : 1.16 3959 13864 3.50 11951.72
6.39/6.47 c lex dual LP : 0.00 0 0 0.00 -
6.39/6.47 c barrier LP : 0.00 0 0 0.00 -
6.39/6.47 c diving/probing LP: 0.09 214 1255 5.86 13944.44
6.39/6.47 c strong branching : 2.64 1896 33508 17.67 12692.42
6.39/6.47 c (at root node) : - 24 3058 127.42 -
6.39/6.47 c conflict analysis: 0.00 0 0 0.00 -
6.39/6.47 c B&B Tree :
6.39/6.47 c number of runs : 1
6.39/6.47 c nodes : 2446
6.39/6.47 c nodes (total) : 2446
6.39/6.47 c nodes left : 0
6.39/6.47 c max depth : 43
6.39/6.47 c max depth (total): 43
6.39/6.47 c backtracks : 337 (13.8%)
6.39/6.47 c delayed cutoffs : 145
6.39/6.47 c repropagations : 699 (2070 domain reductions, 138 cutoffs)
6.39/6.47 c avg switch length: 3.87
6.39/6.47 c switching time : 0.10
6.39/6.47 c Solution :
6.39/6.47 c Solutions found : 3 (3 improvements)
6.39/6.47 c First Solution : +2.70000000000000e+01 (in run 1, after 998 nodes, 4.58 seconds, depth 37, found by <relaxation>)
6.39/6.47 c Primal Bound : +3.00000000000000e+00 (in run 1, after 2446 nodes, 5.95 seconds, depth 36, found by <relaxation>)
6.39/6.47 c Dual Bound : +3.00000000000000e+00
6.39/6.47 c Gap : 0.00 %
6.39/6.47 c Root Dual Bound : +3.00000000000000e+00
6.39/6.47 c Root Iterations : 334
6.39/6.48 c Time complete: 6.47.