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-2663514-1276646069.opb>
0.00/0.01 c original problem has 360 variables (360 bin, 0 int, 0 impl, 0 cont) and 244 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.01 c presolving:
0.03/0.04 c (round 1) 10 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1840 impls, 0 clqs
0.03/0.04 c (round 2) 22 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 0 upgd conss, 2543 impls, 0 clqs
0.03/0.05 c (round 3) 33 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 10 upgd conss, 3103 impls, 0 clqs
0.03/0.05 c (round 4) 43 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 55 chg coeffs, 10 upgd conss, 3583 impls, 0 clqs
0.03/0.05 c (round 5) 53 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 63 chg coeffs, 10 upgd conss, 3983 impls, 0 clqs
0.03/0.06 c (round 6) 63 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 71 chg coeffs, 10 upgd conss, 4303 impls, 0 clqs
0.03/0.06 c (round 7) 73 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 79 chg coeffs, 10 upgd conss, 4543 impls, 0 clqs
0.03/0.06 c (round 8) 83 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 87 chg coeffs, 10 upgd conss, 4703 impls, 0 clqs
0.03/0.07 c (round 9) 93 del vars, 65 del conss, 0 chg bounds, 0 chg sides, 95 chg coeffs, 10 upgd conss, 4783 impls, 0 clqs
0.03/0.07 c (round 10) 103 del vars, 73 del conss, 0 chg bounds, 0 chg sides, 103 chg coeffs, 10 upgd conss, 4783 impls, 0 clqs
0.03/0.09 c (0.0s) probing: 169/257 (65.8%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.03/0.09 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.03/0.09 c presolving (11 rounds):
0.03/0.09 c 103 deleted vars, 73 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 103 changed coefficients
0.03/0.09 c 4819 implications, 0 cliques
0.03/0.09 c presolved problem has 257 variables (257 bin, 0 int, 0 impl, 0 cont) and 162 constraints
0.03/0.09 c 142 constraints of type <and>
0.03/0.09 c 9 constraints of type <linear>
0.03/0.09 c 11 constraints of type <logicor>
0.03/0.09 c transformed objective value is always integral (scale: 2)
0.03/0.09 c Presolving Time: 0.04
0.03/0.09 c - non default parameters ----------------------------------------------------------------------
0.03/0.09 c # SCIP version 1.2.1.2
0.03/0.09 c
0.03/0.09 c # frequency for displaying node information lines
0.03/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.09 c display/freq = 10000
0.03/0.09 c
0.03/0.09 c # maximal time in seconds to run
0.03/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.09 c limits/time = 1800
0.03/0.09 c
0.03/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.09 c limits/memory = 1620
0.03/0.09 c
0.03/0.09 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.09 c lp/solvefreq = -1
0.03/0.09 c
0.03/0.09 c # should presolving try to simplify inequalities
0.03/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.09 c constraints/linear/simplifyinequalities = TRUE
0.03/0.09 c
0.03/0.09 c # should presolving try to simplify knapsacks
0.03/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.09 c
0.03/0.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09 c heuristics/undercover/freq = 0
0.03/0.09 c
0.03/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09 c separating/rapidlearning/freq = 0
0.03/0.09 c
0.03/0.09 c -----------------------------------------------------------------------------------------------
0.03/0.09 c start solving
0.03/0.09 c
0.03/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.03/0.09 c 0.0s| 1 | 2 | 0 | - | 971k| 0 | - | 257 | 162 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.39/0.42 o 13
0.39/0.42 c * 0.3s| 2101 | 1612 | 0 | 0.0 |2113k| 86 | - | 257 | 416 | 0 | 0 | 0 | 412 | 0 | 1.000000e+00 | 1.300000e+01 |1200.00%
0.99/1.09 o 5
0.99/1.09 c * 0.9s| 5834 | 4196 | 0 | 0.0 |4032k| 86 | - | 257 | 859 | 0 | 0 | 0 |1440 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.59/1.67 o 3
1.59/1.67 c * 1.4s| 8799 | 3720 | 0 | 0.0 |4041k| 86 | - | 257 | 970 | 0 | 0 | 0 |2224 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
1.59/1.69 c
1.59/1.69 c SCIP Status : problem is solved [optimal solution found]
1.59/1.69 c Solving Time (sec) : 1.45
1.59/1.69 c Solving Nodes : 8800
1.59/1.69 c Primal Bound : +3.00000000000000e+00 (3 solutions)
1.59/1.69 c Dual Bound : +3.00000000000000e+00
1.59/1.69 c Gap : 0.00 %
1.59/1.69 s OPTIMUM FOUND
1.59/1.69 v -x135 -x134 -x133 x132 -x131 -x130 -x129 -x128 -x127 -x126 -x90 -x89 -x88 x87 x86 x125 -x124 -x123 -x122 -x121 -x85 -x84 -x83 -x82
1.59/1.69 v x81 -x120 -x119 -x118 -x117 x116 x80 -x79 -x78 x77 x76 -x115 -x114 -x113 -x112 -x111 x75 -x74 -x73 -x72 x71 -x110 -x109 -x108
1.59/1.69 v -x107 x106 -x70 -x69 -x68 -x67 x66 -x105 -x104 -x103 -x102 -x101 -x65 -x64 -x63 x62 x61 -x100 -x99 -x98 -x97 x96 -x60 -x59
1.59/1.69 v -x58 -x57 x56 -x95 -x94 -x93 x92 -x91 -x55 x54 -x53 x52 x51 x50 x49 -x48 -x47 x46 -x45 -x44 -x43 x42 x41 x40 x39 -x38 x37
1.59/1.69 v x36 -x35 -x34 -x33 x32 x31 x30 -x29 -x28 -x27 x26 -x25 x24 -x23 x22 x21 -x20 -x19 -x18 x17 x16 -x15 -x14 -x13 x12 x11 x10 x9
1.59/1.69 v -x8 -x7 x6 -x5 -x4 -x3 x2 x1
1.59/1.69 c SCIP Status : problem is solved [optimal solution found]
1.59/1.69 c Solving Time : 1.45
1.59/1.69 c Original Problem :
1.59/1.69 c Problem name : HOME/instance-2663514-1276646069.opb
1.59/1.69 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.69 c Constraints : 244 initial, 244 maximal
1.59/1.69 c Presolved Problem :
1.59/1.69 c Problem name : t_HOME/instance-2663514-1276646069.opb
1.59/1.69 c Variables : 257 (257 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.69 c Constraints : 162 initial, 980 maximal
1.59/1.69 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.69 c trivial : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c probing : 0.01 0 0 0 0 0 0 0 0
1.59/1.69 c and : 0.02 18 73 0 0 0 73 0 73
1.59/1.69 c linear : 0.01 2 10 0 0 0 0 0 30
1.59/1.69 c logicor : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c root node : - 25 - - 25 - - - -
1.59/1.69 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.69 c integral : 0 0 0 0 0 0 0 0 0 0
1.59/1.69 c and : 142 0 22895 0 7867 288 27129 0 0 0
1.59/1.69 c linear : 9 0 22605 0 7867 932 15679 0 0 0
1.59/1.69 c logicor : 11+ 0 11014 0 7869 115 3870 0 0 0
1.59/1.69 c countsols : 0 0 0 0 7870 0 0 0 0 0
1.59/1.69 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.69 c integral : 0.00 0.00 0.00 0.00 0.00
1.59/1.69 c and : 0.15 0.00 0.11 0.00 0.04
1.59/1.69 c linear : 0.25 0.00 0.24 0.00 0.01
1.59/1.69 c logicor : 0.07 0.00 0.06 0.00 0.01
1.59/1.69 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.69 c Propagators : Time Calls Cutoffs DomReds
1.59/1.69 c vbounds : 0.00 2 0 0
1.59/1.69 c rootredcost : 0.00 0 0 0
1.59/1.69 c pseudoobj : 0.05 22543 0 242
1.59/1.69 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.69 c propagation : 0.05 1335 1331 8431 23.0 159 18.1 -
1.59/1.69 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.69 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.69 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.69 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.69 c applied globally : - - - 2216 16.3 - - -
1.59/1.69 c applied locally : - - - 9 36.8 - - -
1.59/1.69 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.69 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.59/1.69 c redcost : 0.00 0 0 0 0 0
1.59/1.69 c impliedbounds : 0.00 0 0 0 0 0
1.59/1.69 c intobj : 0.00 0 0 0 0 0
1.59/1.69 c cgmip : 0.00 0 0 0 0 0
1.59/1.69 c gomory : 0.00 0 0 0 0 0
1.59/1.69 c strongcg : 0.00 0 0 0 0 0
1.59/1.69 c cmir : 0.00 0 0 0 0 0
1.59/1.69 c flowcover : 0.00 0 0 0 0 0
1.59/1.69 c clique : 0.00 0 0 0 0 0
1.59/1.69 c zerohalf : 0.00 0 0 0 0 0
1.59/1.69 c mcf : 0.00 0 0 0 0 0
1.59/1.69 c rapidlearning : 0.00 0 0 0 0 0
1.59/1.69 c Pricers : Time Calls Vars
1.59/1.69 c problem variables: 0.00 0 0
1.59/1.69 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.69 c relpscost : 0.00 0 0 0 0 0 0
1.59/1.69 c pscost : 0.00 0 0 0 0 0 0
1.59/1.69 c inference : 0.24 7867 0 0 0 0 15734
1.59/1.69 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.69 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.69 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.69 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.69 c random : 0.00 0 0 0 0 0 0
1.59/1.69 c Primal Heuristics : Time Calls Found
1.59/1.69 c LP solutions : 0.00 - 0
1.59/1.69 c pseudo solutions : 0.01 - 3
1.59/1.69 c oneopt : 0.00 0 0
1.59/1.69 c trivial : 0.00 2 0
1.59/1.69 c simplerounding : 0.00 0 0
1.59/1.69 c zirounding : 0.00 0 0
1.59/1.69 c rounding : 0.00 0 0
1.59/1.69 c shifting : 0.00 0 0
1.59/1.69 c intshifting : 0.00 0 0
1.59/1.69 c twoopt : 0.00 0 0
1.59/1.69 c fixandinfer : 0.00 0 0
1.59/1.69 c feaspump : 0.00 0 0
1.59/1.69 c coefdiving : 0.00 0 0
1.59/1.69 c pscostdiving : 0.00 0 0
1.59/1.69 c fracdiving : 0.00 0 0
1.59/1.69 c veclendiving : 0.00 0 0
1.59/1.69 c intdiving : 0.00 0 0
1.59/1.69 c actconsdiving : 0.00 0 0
1.59/1.69 c objpscostdiving : 0.00 0 0
1.59/1.69 c rootsoldiving : 0.00 0 0
1.59/1.69 c linesearchdiving : 0.00 0 0
1.59/1.69 c guideddiving : 0.00 0 0
1.59/1.69 c octane : 0.00 0 0
1.59/1.69 c rens : 0.00 0 0
1.59/1.69 c rins : 0.00 0 0
1.59/1.69 c localbranching : 0.00 0 0
1.59/1.69 c mutation : 0.00 0 0
1.59/1.69 c crossover : 0.00 0 0
1.59/1.69 c dins : 0.00 0 0
1.59/1.69 c undercover : 0.00 0 0
1.59/1.69 c nlp : 0.01 0 0
1.59/1.69 c trysol : 0.01 0 0
1.59/1.69 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.69 c primal LP : 0.00 0 0 0.00 -
1.59/1.69 c dual LP : 0.00 0 0 0.00 -
1.59/1.69 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.69 c barrier LP : 0.00 0 0 0.00 -
1.59/1.69 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.69 c strong branching : 0.00 0 0 0.00 -
1.59/1.69 c (at root node) : - 0 0 0.00 -
1.59/1.69 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.69 c B&B Tree :
1.59/1.69 c number of runs : 1
1.59/1.69 c nodes : 8800
1.59/1.69 c nodes (total) : 8800
1.59/1.69 c nodes left : 0
1.59/1.69 c max depth : 86
1.59/1.69 c max depth (total): 86
1.59/1.69 c backtracks : 835 (9.5%)
1.59/1.69 c delayed cutoffs : 4362
1.59/1.69 c repropagations : 2828 (5596 domain reductions, 405 cutoffs)
1.59/1.69 c avg switch length: 4.74
1.59/1.69 c switching time : 0.23
1.59/1.69 c Solution :
1.59/1.69 c Solutions found : 3 (3 improvements)
1.59/1.69 c First Solution : +1.30000000000000e+01 (in run 1, after 2101 nodes, 0.34 seconds, depth 56, found by <relaxation>)
1.59/1.69 c Primal Bound : +3.00000000000000e+00 (in run 1, after 8799 nodes, 1.43 seconds, depth 62, found by <relaxation>)
1.59/1.69 c Dual Bound : +3.00000000000000e+00
1.59/1.69 c Gap : 0.00 %
1.59/1.69 c Root Dual Bound : +1.00000000000000e+00
1.59/1.69 c Root Iterations : 0
1.59/1.70 c Time complete: 1.69.