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-2666541-1276649903.opb>
0.00/0.01 c original problem has 352 variables (352 bin, 0 int, 0 impl, 0 cont) and 265 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.05 c (round 1) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1240 impls, 0 clqs
0.01/0.06 c (round 2) 20 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 5 upgd conss, 1912 impls, 0 clqs
0.01/0.06 c (round 3) 36 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 5 upgd conss, 2360 impls, 0 clqs
0.01/0.06 c (round 4) 52 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 5 upgd conss, 2584 impls, 0 clqs
0.01/0.07 c (round 5) 68 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 5 upgd conss, 2584 impls, 0 clqs
0.01/0.08 c (0.1s) probing: 151/284 (53.2%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.01/0.08 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.01/0.08 c presolving (6 rounds):
0.01/0.08 c 68 deleted vars, 56 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 86 changed coefficients
0.01/0.08 c 2600 implications, 0 cliques
0.01/0.08 c presolved problem has 284 variables (284 bin, 0 int, 0 impl, 0 cont) and 205 constraints
0.01/0.08 c 196 constraints of type <and>
0.01/0.08 c 4 constraints of type <linear>
0.01/0.08 c 5 constraints of type <logicor>
0.01/0.08 c transformed objective value is always integral (scale: 2)
0.01/0.08 c Presolving Time: 0.04
0.01/0.08 c - non default parameters ----------------------------------------------------------------------
0.01/0.08 c # SCIP version 1.2.1.2
0.01/0.08 c
0.01/0.08 c # frequency for displaying node information lines
0.01/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.08 c display/freq = 10000
0.01/0.08 c
0.01/0.08 c # maximal time in seconds to run
0.01/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.08 c limits/time = 1800
0.01/0.08 c
0.01/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.08 c limits/memory = 1620
0.01/0.08 c
0.01/0.08 c # should presolving try to simplify inequalities
0.01/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.08 c constraints/linear/simplifyinequalities = TRUE
0.01/0.08 c
0.01/0.08 c # should presolving try to simplify knapsacks
0.01/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.08 c
0.01/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.08 c heuristics/undercover/freq = 0
0.01/0.08 c
0.01/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.08 c separating/rapidlearning/freq = 0
0.01/0.08 c
0.01/0.08 c -----------------------------------------------------------------------------------------------
0.01/0.08 c start solving
0.01/0.09 c
0.01/0.09 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.09 c 0.1s| 1 | 0 | 12 | - |1367k| 0 | 7 | 284 | 205 | 284 | 401 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.68 c 0.4s| 1 | 0 | 267 | - |1386k| 0 | 11 | 284 | 205 | 284 | 402 | 1 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.69 c 0.5s| 1 | 0 | 273 | - |1398k| 0 | 16 | 284 | 205 | 284 | 405 | 4 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.72 c 0.5s| 1 | 0 | 277 | - |1408k| 0 | 19 | 284 | 205 | 284 | 410 | 9 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.74 c 0.5s| 1 | 0 | 281 | - |1424k| 0 | 20 | 284 | 205 | 284 | 414 | 13 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.78 c 0.5s| 1 | 0 | 283 | - |1433k| 0 | 21 | 284 | 205 | 284 | 416 | 15 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.82 c 0.6s| 1 | 0 | 288 | - |1436k| 0 | 24 | 284 | 205 | 284 | 418 | 17 | 0 | 0 | 3.000000e+00 | -- | Inf
0.89/0.90 c 0.7s| 1 | 2 | 288 | - |1436k| 0 | 24 | 284 | 205 | 284 | 418 | 17 | 0 | 17 | 3.000000e+00 | -- | Inf
2.69/2.73 o 3
2.69/2.73 c * 2.4s| 846 | 0 | 4237 | 4.7 |1682k| 46 | - | 284 | 535 | 284 | 78 |2246 | 333 |1537 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.69/2.73 c
2.69/2.73 c SCIP Status : problem is solved [optimal solution found]
2.69/2.73 c Solving Time (sec) : 2.39
2.69/2.73 c Solving Nodes : 846
2.69/2.73 c Primal Bound : +3.00000000000000e+00 (1 solutions)
2.69/2.73 c Dual Bound : +3.00000000000000e+00
2.69/2.73 c Gap : 0.00 %
2.69/2.73 s OPTIMUM FOUND
2.69/2.73 v -x96 -x95 -x94 -x93 -x92 -x91 -x90 x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81 -x64 -x63 x62 x61 -x60 x59 -x58 x57 -x80 -x79 -x78
2.69/2.73 v -x77 -x76 x75 x74 -x73 -x56 -x55 -x54 -x53 -x52 -x51 x50 x49 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x48 -x47 -x46 -x45 x44
2.69/2.73 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
2.69/2.73 v -x15 -x14 -x13 -x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
2.69/2.73 c SCIP Status : problem is solved [optimal solution found]
2.69/2.73 c Solving Time : 2.39
2.69/2.73 c Original Problem :
2.69/2.73 c Problem name : HOME/instance-2666541-1276649903.opb
2.69/2.73 c Variables : 352 (352 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.73 c Constraints : 265 initial, 265 maximal
2.69/2.73 c Presolved Problem :
2.69/2.73 c Problem name : t_HOME/instance-2666541-1276649903.opb
2.69/2.73 c Variables : 284 (284 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.73 c Constraints : 205 initial, 535 maximal
2.69/2.73 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.69/2.73 c trivial : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c implics : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c probing : 0.02 0 0 0 0 0 0 0 0
2.69/2.73 c and : 0.01 8 56 0 0 0 56 0 56
2.69/2.73 c linear : 0.01 1 3 0 0 0 0 0 30
2.69/2.73 c logicor : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c root node : - 0 - - 0 - - - -
2.69/2.73 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.69/2.73 c integral : 0 0 0 701 0 1 52 0 0 1318
2.69/2.73 c and : 196 1705 2698 1 0 74 3855 2231 0 0
2.69/2.73 c linear : 4 6 2624 1 0 169 1497 0 0 0
2.69/2.73 c logicor : 5+ 6 737 1 0 2 142 0 0 0
2.69/2.73 c countsols : 0 0 0 1 0 0 0 0 0 0
2.69/2.73 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.69/2.73 c integral : 0.80 0.00 0.00 0.80 0.00
2.69/2.73 c and : 0.09 0.04 0.05 0.00 0.00
2.69/2.73 c linear : 0.03 0.00 0.03 0.00 0.00
2.69/2.73 c logicor : 0.01 0.00 0.01 0.00 0.00
2.69/2.73 c countsols : 0.00 0.00 0.00 0.00 0.00
2.69/2.73 c Propagators : Time Calls Cutoffs DomReds
2.69/2.73 c vbounds : 0.00 2 0 0
2.69/2.73 c rootredcost : 0.00 0 0 0
2.69/2.73 c pseudoobj : 0.00 2391 0 0
2.69/2.73 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.69/2.73 c propagation : 0.04 215 198 2670 43.7 74 23.6 -
2.69/2.73 c infeasible LP : 0.00 1 1 1 45.0 0 0.0 0
2.69/2.73 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.73 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.73 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.73 c applied globally : - - - 330 17.1 - - -
2.69/2.73 c applied locally : - - - 3 46.3 - - -
2.69/2.73 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.69/2.73 c cut pool : 0.01 5 - - 3 - (maximal pool size: 23)
2.69/2.73 c redcost : 0.00 1705 0 0 0 0
2.69/2.73 c impliedbounds : 0.00 6 0 0 1 0
2.69/2.73 c intobj : 0.00 0 0 0 0 0
2.69/2.73 c cgmip : 0.00 0 0 0 0 0
2.69/2.73 c gomory : 0.05 6 0 0 0 0
2.69/2.73 c strongcg : 0.01 6 0 0 13 0
2.69/2.73 c cmir : 0.03 6 0 0 15 0
2.69/2.73 c flowcover : 0.05 6 0 0 14 0
2.69/2.73 c clique : 0.00 1 0 0 0 0
2.69/2.73 c zerohalf : 0.00 0 0 0 0 0
2.69/2.73 c mcf : 0.00 1 0 0 0 0
2.69/2.73 c rapidlearning : 0.03 1 0 0 0 0
2.69/2.73 c Pricers : Time Calls Vars
2.69/2.73 c problem variables: 0.00 0 0
2.69/2.73 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.69/2.73 c relpscost : 0.80 700 1 52 0 0 1318
2.69/2.73 c pscost : 0.00 0 0 0 0 0 0
2.69/2.73 c inference : 0.00 0 0 0 0 0 0
2.69/2.73 c mostinf : 0.00 0 0 0 0 0 0
2.69/2.73 c leastinf : 0.00 0 0 0 0 0 0
2.69/2.73 c fullstrong : 0.00 0 0 0 0 0 0
2.69/2.73 c allfullstrong : 0.00 0 0 0 0 0 0
2.69/2.73 c random : 0.00 0 0 0 0 0 0
2.69/2.73 c Primal Heuristics : Time Calls Found
2.69/2.73 c LP solutions : 0.01 - 1
2.69/2.73 c pseudo solutions : 0.00 - 0
2.69/2.73 c oneopt : 0.00 0 0
2.69/2.73 c crossover : 0.00 0 0
2.69/2.73 c veclendiving : 0.00 0 0
2.69/2.73 c objpscostdiving : 0.00 0 0
2.69/2.73 c rootsoldiving : 0.00 0 0
2.69/2.73 c linesearchdiving : 0.00 0 0
2.69/2.73 c guideddiving : 0.00 0 0
2.69/2.73 c coefdiving : 0.00 1 0
2.69/2.73 c pscostdiving : 0.01 1 0
2.69/2.73 c fracdiving : 0.00 1 0
2.69/2.73 c feaspump : 0.01 1 0
2.69/2.73 c trivial : 0.00 2 0
2.69/2.73 c simplerounding : 0.00 0 0
2.69/2.73 c zirounding : 0.02 655 0
2.69/2.73 c rounding : 0.07 544 0
2.69/2.73 c shifting : 0.17 143 0
2.69/2.73 c intshifting : 0.00 0 0
2.69/2.73 c twoopt : 0.00 0 0
2.69/2.73 c fixandinfer : 0.00 0 0
2.69/2.73 c intdiving : 0.00 0 0
2.69/2.73 c actconsdiving : 0.00 0 0
2.69/2.73 c octane : 0.00 0 0
2.69/2.73 c rens : 0.01 1 0
2.69/2.73 c rins : 0.00 0 0
2.69/2.73 c localbranching : 0.00 0 0
2.69/2.73 c mutation : 0.00 0 0
2.69/2.73 c dins : 0.00 0 0
2.69/2.73 c undercover : 0.34 1 0
2.69/2.73 c nlp : 0.00 0 0
2.69/2.73 c trysol : 0.00 0 0
2.69/2.73 c LP : Time Calls Iterations Iter/call Iter/sec
2.69/2.73 c primal LP : 0.02 0 0 0.00 0.00
2.69/2.73 c dual LP : 0.32 1784 3902 2.19 12193.75
2.69/2.73 c lex dual LP : 0.00 0 0 0.00 -
2.69/2.73 c barrier LP : 0.00 0 0 0.00 -
2.69/2.73 c diving/probing LP: 0.00 56 335 5.98 -
2.69/2.73 c strong branching : 0.78 1537 9243 6.01 11850.00
2.69/2.73 c (at root node) : - 17 546 32.12 -
2.69/2.73 c conflict analysis: 0.00 0 0 0.00 -
2.69/2.73 c B&B Tree :
2.69/2.73 c number of runs : 1
2.69/2.73 c nodes : 846
2.69/2.73 c nodes (total) : 846
2.69/2.73 c nodes left : 0
2.69/2.73 c max depth : 46
2.69/2.73 c max depth (total): 46
2.69/2.73 c backtracks : 90 (10.6%)
2.69/2.73 c delayed cutoffs : 55
2.69/2.73 c repropagations : 222 (656 domain reductions, 53 cutoffs)
2.69/2.73 c avg switch length: 3.11
2.69/2.73 c switching time : 0.04
2.69/2.73 c Solution :
2.69/2.73 c Solutions found : 1 (1 improvements)
2.69/2.73 c First Solution : +3.00000000000000e+00 (in run 1, after 846 nodes, 2.38 seconds, depth 39, found by <relaxation>)
2.69/2.73 c Primal Bound : +3.00000000000000e+00 (in run 1, after 846 nodes, 2.38 seconds, depth 39, found by <relaxation>)
2.69/2.73 c Dual Bound : +3.00000000000000e+00
2.69/2.73 c Gap : 0.00 %
2.69/2.73 c Root Dual Bound : +3.00000000000000e+00
2.69/2.73 c Root Iterations : 288
2.69/2.74 c Time complete: 2.73.