0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2663536-1276646653.opb>
0.00/0.01 c original problem has 490 variables (490 bin, 0 int, 0 impl, 0 cont) and 358 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.02 c presolving:
0.04/0.07 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 0 upgd conss, 2044 impls, 0 clqs
0.04/0.08 c (round 2) 21 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 8 upgd conss, 3052 impls, 0 clqs
0.04/0.08 c (round 3) 35 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 8 upgd conss, 3892 impls, 0 clqs
0.04/0.09 c (round 4) 49 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 8 upgd conss, 4564 impls, 0 clqs
0.04/0.09 c (round 5) 63 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 88 chg coeffs, 8 upgd conss, 5068 impls, 0 clqs
0.04/0.09 c (round 6) 77 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 100 chg coeffs, 8 upgd conss, 5404 impls, 0 clqs
0.09/0.10 c (round 7) 91 del vars, 72 del conss, 0 chg bounds, 0 chg sides, 112 chg coeffs, 8 upgd conss, 5572 impls, 0 clqs
0.09/0.10 c (round 8) 105 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 124 chg coeffs, 8 upgd conss, 5572 impls, 0 clqs
0.09/0.12 c (0.1s) probing: 180/385 (46.8%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.09/0.12 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.12 c presolving (9 rounds):
0.09/0.12 c 105 deleted vars, 84 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 124 changed coefficients
0.09/0.12 c 5600 implications, 0 cliques
0.09/0.12 c presolved problem has 385 variables (385 bin, 0 int, 0 impl, 0 cont) and 267 constraints
0.09/0.12 c 252 constraints of type <and>
0.09/0.12 c 7 constraints of type <linear>
0.09/0.12 c 8 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 2)
0.09/0.12 c Presolving Time: 0.07
0.09/0.12 c - non default parameters ----------------------------------------------------------------------
0.09/0.12 c # SCIP version 1.2.1.2
0.09/0.12 c
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = 10000
0.09/0.12 c
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = 1800
0.09/0.12 c
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = 1620
0.09/0.12 c
0.09/0.12 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c lp/solvefreq = -1
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c heuristics/undercover/freq = 0
0.09/0.12 c
0.09/0.12 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/rapidlearning/freq = 0
0.09/0.12 c
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving
0.09/0.12 c
0.09/0.12 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.12 c 0.1s| 1 | 2 | 0 | - |1305k| 0 | - | 385 | 267 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.59/0.69 o 5
0.59/0.69 c * 0.6s| 2957 | 2174 | 0 | 0.0 |2887k| 203 | - | 385 | 438 | 0 | 0 | 0 | 291 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
2.20/2.28 c 2.0s| 10000 | 7359 | 0 | 0.0 |6705k| 203 | - | 385 | 520 | 0 | 0 | 0 |1377 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
4.59/4.68 c 4.1s| 20000 | 13139 | 0 | 0.0 | 11M| 203 | - | 385 | 721 | 0 | 0 | 0 |3596 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
6.50/6.60 o 3
6.50/6.60 c * 5.8s| 27847 | 0 | 0 | 0.0 |1869k| 203 | - | 385 | 592 | 0 | 0 | 0 |5033 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
6.50/6.60 c
6.50/6.60 c SCIP Status : problem is solved [optimal solution found]
6.50/6.60 c Solving Time (sec) : 5.82
6.50/6.60 c Solving Nodes : 27847
6.50/6.60 c Primal Bound : +3.00000000000000e+00 (2 solutions)
6.50/6.60 c Dual Bound : +3.00000000000000e+00
6.50/6.60 c Gap : 0.00 %
6.50/6.60 s OPTIMUM FOUND
6.50/6.60 v -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x98 -x97 -x96 -x95 -x94 x93 x92 -x133 -x132
6.50/6.60 v -x131 -x130 -x129 -x128 x127 -x91 -x90 -x89 -x88 -x87 -x86 x85 -x126 -x125 -x124 -x123 -x122 -x121 x120 -x84 x83 -x82 x81 -x80
6.50/6.60 v x79 x78 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x77 -x76 x75 -x74 -x73 x72 x71 -x112 -x111 -x110 -x109 -x108 x107 x106
6.50/6.60 v -x70 -x69 -x68 -x67 -x66 -x65 x64 -x105 -x104 -x103 -x102 -x101 x100 -x99 -x63 -x62 -x61 -x60 x59 -x58 x57 x56 -x55 -x54 -x53
6.50/6.60 v -x52 -x51 x50 -x49 -x48 -x47 -x46 -x45 x44 x43 -x42 -x41 -x40 -x39 -x38 x37 x36 -x35 -x34 -x33 x32 -x31 -x30 x29 -x28 -x27 x26
6.50/6.60 v -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.50/6.60 c SCIP Status : problem is solved [optimal solution found]
6.50/6.60 c Solving Time : 5.82
6.50/6.60 c Original Problem :
6.50/6.60 c Problem name : HOME/instance-2663536-1276646653.opb
6.50/6.60 c Variables : 490 (490 binary, 0 integer, 0 implicit integer, 0 continuous)
6.50/6.60 c Constraints : 358 initial, 358 maximal
6.50/6.60 c Presolved Problem :
6.50/6.60 c Problem name : t_HOME/instance-2663536-1276646653.opb
6.50/6.60 c Variables : 385 (385 binary, 0 integer, 0 implicit integer, 0 continuous)
6.50/6.60 c Constraints : 267 initial, 805 maximal
6.50/6.60 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.50/6.60 c trivial : 0.00 0 0 0 0 0 0 0 0
6.50/6.60 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.50/6.60 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.50/6.60 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.50/6.60 c implics : 0.00 0 0 0 0 0 0 0 0
6.50/6.60 c probing : 0.02 0 0 0 0 0 0 0 0
6.50/6.60 c and : 0.04 14 84 0 0 0 84 0 84
6.50/6.60 c linear : 0.00 1 6 0 0 0 0 0 40
6.50/6.60 c logicor : 0.00 0 0 0 0 0 0 0 0
6.50/6.60 c root node : - 41 - - 41 - - - -
6.50/6.60 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.50/6.60 c integral : 0 0 0 0 0 0 0 0 0 0
6.50/6.60 c and : 252 0 69153 0 24962 691 120206 0 0 0
6.50/6.60 c linear : 7 0 68462 0 24962 3510 51052 0 0 0
6.50/6.60 c logicor : 8+ 0 29551 0 24949 278 9627 0 0 0
6.50/6.60 c countsols : 0 0 0 0 24964 0 0 0 0 0
6.50/6.60 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.50/6.60 c integral : 0.00 0.00 0.00 0.00 0.00
6.50/6.60 c and : 0.83 0.00 0.55 0.00 0.28
6.50/6.60 c linear : 1.58 0.00 1.58 0.00 0.00
6.50/6.60 c logicor : 0.34 0.00 0.33 0.00 0.01
6.50/6.60 c countsols : 0.01 0.00 0.00 0.00 0.01
6.50/6.60 c Propagators : Time Calls Cutoffs DomReds
6.50/6.60 c vbounds : 0.06 2 0 0
6.50/6.60 c rootredcost : 0.06 0 0 0
6.50/6.60 c pseudoobj : 0.06 68784 0 48
6.50/6.60 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.50/6.60 c propagation : 0.66 4479 4464 40377 46.0 322 43.0 -
6.50/6.60 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.50/6.60 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.50/6.60 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.50/6.60 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.50/6.60 c applied globally : - - - 4339 18.7 - - -
6.50/6.60 c applied locally : - - - 694 51.4 - - -
6.50/6.60 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.50/6.60 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
6.50/6.60 c redcost : 0.00 0 0 0 0 0
6.50/6.60 c impliedbounds : 0.00 0 0 0 0 0
6.50/6.60 c intobj : 0.00 0 0 0 0 0
6.50/6.60 c cgmip : 0.00 0 0 0 0 0
6.50/6.60 c gomory : 0.00 0 0 0 0 0
6.50/6.60 c strongcg : 0.00 0 0 0 0 0
6.50/6.60 c cmir : 0.00 0 0 0 0 0
6.50/6.60 c flowcover : 0.00 0 0 0 0 0
6.50/6.60 c clique : 0.00 0 0 0 0 0
6.50/6.60 c zerohalf : 0.00 0 0 0 0 0
6.50/6.60 c mcf : 0.00 0 0 0 0 0
6.50/6.60 c rapidlearning : 0.00 0 0 0 0 0
6.50/6.60 c Pricers : Time Calls Vars
6.50/6.60 c problem variables: 0.00 0 0
6.50/6.60 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.50/6.60 c relpscost : 0.00 0 0 0 0 0 0
6.50/6.60 c pscost : 0.00 0 0 0 0 0 0
6.50/6.60 c inference : 1.10 24962 0 0 0 0 49924
6.50/6.60 c mostinf : 0.00 0 0 0 0 0 0
6.50/6.60 c leastinf : 0.00 0 0 0 0 0 0
6.50/6.60 c fullstrong : 0.00 0 0 0 0 0 0
6.50/6.60 c allfullstrong : 0.00 0 0 0 0 0 0
6.50/6.60 c random : 0.00 0 0 0 0 0 0
6.50/6.60 c Primal Heuristics : Time Calls Found
6.50/6.60 c LP solutions : 0.00 - 0
6.50/6.60 c pseudo solutions : 0.04 - 2
6.50/6.60 c oneopt : 0.04 0 0
6.50/6.60 c trivial : 0.00 2 0
6.50/6.60 c simplerounding : 0.00 0 0
6.50/6.60 c zirounding : 0.00 0 0
6.50/6.60 c rounding : 0.00 0 0
6.50/6.60 c shifting : 0.00 0 0
6.50/6.60 c intshifting : 0.00 0 0
6.50/6.60 c twoopt : 0.00 0 0
6.50/6.60 c fixandinfer : 0.00 0 0
6.50/6.60 c feaspump : 0.00 0 0
6.50/6.60 c coefdiving : 0.00 0 0
6.50/6.60 c pscostdiving : 0.00 0 0
6.50/6.60 c fracdiving : 0.00 0 0
6.50/6.60 c veclendiving : 0.00 0 0
6.50/6.60 c intdiving : 0.00 0 0
6.50/6.60 c actconsdiving : 0.00 0 0
6.50/6.60 c objpscostdiving : 0.00 0 0
6.50/6.60 c rootsoldiving : 0.00 0 0
6.50/6.60 c linesearchdiving : 0.00 0 0
6.50/6.60 c guideddiving : 0.00 0 0
6.50/6.60 c octane : 0.00 0 0
6.50/6.60 c rens : 0.00 0 0
6.50/6.60 c rins : 0.00 0 0
6.50/6.60 c localbranching : 0.00 0 0
6.50/6.60 c mutation : 0.00 0 0
6.50/6.60 c crossover : 0.00 0 0
6.50/6.60 c dins : 0.00 0 0
6.50/6.60 c undercover : 0.00 0 0
6.50/6.60 c nlp : 0.01 0 0
6.50/6.60 c trysol : 0.01 0 0
6.50/6.60 c LP : Time Calls Iterations Iter/call Iter/sec
6.50/6.60 c primal LP : 0.00 0 0 0.00 -
6.50/6.60 c dual LP : 0.00 0 0 0.00 -
6.50/6.60 c lex dual LP : 0.00 0 0 0.00 -
6.50/6.60 c barrier LP : 0.00 0 0 0.00 -
6.50/6.60 c diving/probing LP: 0.00 0 0 0.00 -
6.50/6.60 c strong branching : 0.00 0 0 0.00 -
6.50/6.60 c (at root node) : - 0 0 0.00 -
6.50/6.60 c conflict analysis: 0.00 0 0 0.00 -
6.50/6.60 c B&B Tree :
6.50/6.60 c number of runs : 1
6.50/6.60 c nodes : 27847
6.50/6.60 c nodes (total) : 27847
6.50/6.60 c nodes left : 0
6.50/6.60 c max depth : 203
6.50/6.60 c max depth (total): 203
6.50/6.60 c backtracks : 2138 (7.7%)
6.50/6.60 c delayed cutoffs : 3322
6.50/6.60 c repropagations : 7021 (21706 domain reductions, 1596 cutoffs)
6.50/6.60 c avg switch length: 3.99
6.50/6.60 c switching time : 0.63
6.50/6.60 c Solution :
6.50/6.60 c Solutions found : 2 (2 improvements)
6.50/6.60 c First Solution : +5.00000000000000e+00 (in run 1, after 2957 nodes, 0.56 seconds, depth 122, found by <relaxation>)
6.50/6.60 c Primal Bound : +3.00000000000000e+00 (in run 1, after 27847 nodes, 5.78 seconds, depth 48, found by <relaxation>)
6.50/6.60 c Dual Bound : +3.00000000000000e+00
6.50/6.60 c Gap : 0.00 %
6.50/6.60 c Root Dual Bound : +1.00000000000000e+00
6.50/6.60 c Root Iterations : 0
6.59/6.61 c Time complete: 6.61.