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-2663982-1276643838.opb>
0.00/0.01 c original problem has 194 variables (194 bin, 0 int, 0 impl, 0 cont) and 292 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 o 111
0.00/0.02 c feasible solution found by trivial heuristic, objective value 1.110000e+02
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 72 del vars, 137 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.02 c (round 2) 73 del vars, 140 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.03 c (round 3) 73 del vars, 140 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 115 upgd conss, 406 impls, 0 clqs
0.00/0.03 c (round 4) 73 del vars, 140 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 152 upgd conss, 406 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 101/121 (83.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (5 rounds):
0.00/0.04 c 73 deleted vars, 140 deleted constraints, 3 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 406 implications, 0 cliques
0.00/0.04 c presolved problem has 121 variables (121 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.04 c 152 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.01
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1799.99
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = -1
0.00/0.04 c
0.00/0.04 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 o 110
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c t 0.0s| 1 | 0 | 0 | - | 712k| 0 | - | 121 | 152 | 0 | 0 | 0 | 0 | 0 | -- | 1.100000e+02 | Inf
0.00/0.04 c 0.0s| 1 | 2 | 0 | - | 707k| 0 | - | 121 | 152 | 0 | 0 | 0 | 0 | 0 | 4.000000e+00 | 1.100000e+02 |2650.00%
0.00/0.04 o 13
0.00/0.04 c * 0.0s| 34 | 32 | 0 | 0.0 | 725k| 33 | - | 121 | 152 | 0 | 0 | 0 | 0 | 0 | 5.000000e+00 | 1.300000e+01 | 160.00%
0.00/0.04 o 12
0.00/0.04 c * 0.0s| 49 | 33 | 0 | 0.0 | 730k| 37 | - | 121 | 154 | 0 | 0 | 0 | 5 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
2.39/2.42 c 2.1s| 10000 | 17 | 0 | 0.0 | 751k| 45 | - | 121 | 168 | 0 | 0 | 0 |6523 | 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
4.69/4.70 c 4.1s| 20000 | 30 | 0 | 0.0 | 762k| 61 | - | 121 | 166 | 0 | 0 | 0 | 12k| 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
6.89/6.94 c 6.1s| 30000 | 19 | 0 | 0.0 | 764k| 61 | - | 121 | 172 | 0 | 0 | 0 | 18k| 0 | 5.000000e+00 | 1.200000e+01 | 140.00%
8.49/8.51 o 11
8.49/8.51 c * 7.5s| 36060 | 28 | 0 | 0.0 | 770k| 61 | - | 121 | 155 | 0 | 0 | 0 | 22k| 0 | 5.000000e+00 | 1.100000e+01 | 120.00%
9.39/9.41 c 8.2s| 40000 | 16 | 0 | 0.0 | 768k| 61 | - | 121 | 163 | 0 | 0 | 0 | 24k| 0 | 5.000000e+00 | 1.100000e+01 | 120.00%
11.10/11.16 o 10
11.10/11.16 c * 9.8s| 47295 | 13 | 0 | 0.0 | 773k| 61 | - | 121 | 154 | 0 | 0 | 0 | 29k| 0 | 5.000000e+00 | 1.000000e+01 | 100.00%
11.59/11.65 c
11.59/11.65 c SCIP Status : problem is solved [optimal solution found]
11.59/11.65 c Solving Time (sec) : 10.25
11.59/11.65 c Solving Nodes : 49194
11.59/11.65 c Primal Bound : +1.00000000000000e+01 (6 solutions)
11.59/11.65 c Dual Bound : +1.00000000000000e+01
11.59/11.65 c Gap : 0.00 %
11.59/11.65 s OPTIMUM FOUND
11.59/11.65 v -x18 -x174 -x17 -x16 -x170 -x15 -x166 -x163 -x160 -x14 -x156 -x13 -x152 -x12 -x150 -x147 -x11 -x144 -x10 -x141 -x139 -x137 -x135
11.59/11.65 v -x132 -x130 -x128 -x126 -x123 -x120 -x118 -x9 -x116 -x8 -x113 -x111 -x7 -x6 -x107 -x104 -x5 -x102 -x100 -x97 -x95 -x93 -x4
11.59/11.65 v -x91 -x88 -x86 -x84 -x82 -x79 -x76 -x3 -x74 -x72 -x69 -x67 -x65 -x63 -x2 -x61 -x59 -x57 -x55 -x53 -x50 -x1 -x48 -x46 -x44 -x42
11.59/11.65 v -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 x194 x193 -x192 x191 x190 -x189 x188 -x187 x186 -x185 -x184 -x183 x182
11.59/11.65 v -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x173 -x172 -x171 -x169 -x168 -x167 -x165 -x164 -x162 -x161 -x159 -x158 -x157 -x155
11.59/11.65 v -x154 -x153 -x151 -x149 -x148 -x146 -x145 -x143 -x142 -x140 -x138 -x136 x134 -x133 -x131 -x129 -x127 -x125 -x124 -x122 -x121
11.59/11.65 v -x119 -x117 -x115 -x114 -x112 -x110 -x109 -x108 -x106 -x105 -x103 -x101 -x99 -x98 -x96 -x94 -x92 x90 -x89 -x87 -x85 -x83
11.59/11.65 v -x81 -x80 -x78 -x77 -x75 -x73 -x71 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x51 -x49 -x47 -x45 -x43 x41 -x40 -x38 -x36
11.59/11.65 v -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20
11.59/11.65 c SCIP Status : problem is solved [optimal solution found]
11.59/11.65 c Solving Time : 10.25
11.59/11.65 c Original Problem :
11.59/11.65 c Problem name : HOME/instance-2663982-1276643838.opb
11.59/11.65 c Variables : 194 (194 binary, 0 integer, 0 implicit integer, 0 continuous)
11.59/11.65 c Constraints : 292 initial, 292 maximal
11.59/11.65 c Presolved Problem :
11.59/11.65 c Problem name : t_HOME/instance-2663982-1276643838.opb
11.59/11.65 c Variables : 121 (121 binary, 0 integer, 0 implicit integer, 0 continuous)
11.59/11.65 c Constraints : 152 initial, 253 maximal
11.59/11.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
11.59/11.65 c trivial : 0.00 0 0 0 0 0 0 0 0
11.59/11.65 c dualfix : 0.00 1 0 0 0 0 0 0 0
11.59/11.65 c boundshift : 0.00 0 0 0 0 0 0 0 0
11.59/11.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0
11.59/11.65 c implics : 0.00 0 0 0 0 0 0 0 0
11.59/11.65 c probing : 0.01 0 0 0 0 0 0 0 0
11.59/11.65 c linear : 0.00 3 69 0 3 0 140 0 0
11.59/11.65 c logicor : 0.00 0 0 0 0 0 0 0 0
11.59/11.65 c root node : - 113 - - 113 - - - -
11.59/11.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
11.59/11.65 c integral : 0 0 0 0 0 0 0 0 0 0
11.59/11.65 c logicor : 152+ 0 110824 0 2 28472 202377 0 0 0
11.59/11.65 c countsols : 0 0 0 0 4 0 0 0 0 0
11.59/11.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
11.59/11.65 c integral : 0.00 0.00 0.00 0.00 0.00
11.59/11.65 c logicor : 1.52 0.00 1.52 0.00 0.00
11.59/11.65 c countsols : 0.00 0.00 0.00 0.00 0.00
11.59/11.65 c Propagators : Time Calls Cutoffs DomReds
11.59/11.65 c vbounds : 0.14 2 0 0
11.59/11.65 c rootredcost : 0.15 0 0 0
11.59/11.65 c pseudoobj : 3.41 217559 646 1514760
11.59/11.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
11.59/11.65 c propagation : 0.59 29118 29092 29092 10.6 1820 15.1 -
11.59/11.65 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
11.59/11.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
11.59/11.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
11.59/11.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
11.59/11.65 c applied globally : - - - 30912 10.8 - - -
11.59/11.65 c applied locally : - - - 0 0.0 - - -
11.59/11.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
11.59/11.65 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
11.59/11.65 c redcost : 0.00 0 0 0 0 0
11.59/11.65 c impliedbounds : 0.00 0 0 0 0 0
11.59/11.65 c intobj : 0.00 0 0 0 0 0
11.59/11.65 c cgmip : 0.00 0 0 0 0 0
11.59/11.65 c gomory : 0.00 0 0 0 0 0
11.59/11.65 c strongcg : 0.00 0 0 0 0 0
11.59/11.65 c cmir : 0.00 0 0 0 0 0
11.59/11.65 c flowcover : 0.00 0 0 0 0 0
11.59/11.65 c clique : 0.00 0 0 0 0 0
11.59/11.65 c zerohalf : 0.00 0 0 0 0 0
11.59/11.65 c mcf : 0.00 0 0 0 0 0
11.59/11.65 c rapidlearning : 0.00 0 0 0 0 0
11.59/11.65 c Pricers : Time Calls Vars
11.59/11.65 c problem variables: 0.00 0 0
11.59/11.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
11.59/11.65 c relpscost : 0.00 0 0 0 0 0 0
11.59/11.65 c pscost : 0.00 0 0 0 0 0 0
11.59/11.65 c inference : 0.72 40361 0 0 0 0 80722
11.59/11.65 c mostinf : 0.00 0 0 0 0 0 0
11.59/11.65 c leastinf : 0.00 0 0 0 0 0 0
11.59/11.65 c fullstrong : 0.00 0 0 0 0 0 0
11.59/11.65 c allfullstrong : 0.00 0 0 0 0 0 0
11.59/11.65 c random : 0.00 0 0 0 0 0 0
11.59/11.65 c Primal Heuristics : Time Calls Found
11.59/11.65 c LP solutions : 0.00 - 0
11.59/11.65 c pseudo solutions : 0.00 - 4
11.59/11.65 c oneopt : 0.05 0 0
11.59/11.65 c trivial : 0.00 2 2
11.59/11.65 c simplerounding : 0.00 0 0
11.59/11.65 c zirounding : 0.00 0 0
11.59/11.65 c rounding : 0.00 0 0
11.59/11.65 c shifting : 0.00 0 0
11.59/11.65 c intshifting : 0.00 0 0
11.59/11.65 c twoopt : 0.00 0 0
11.59/11.65 c fixandinfer : 0.00 0 0
11.59/11.65 c feaspump : 0.00 0 0
11.59/11.65 c coefdiving : 0.00 0 0
11.59/11.65 c pscostdiving : 0.00 0 0
11.59/11.65 c fracdiving : 0.00 0 0
11.59/11.65 c veclendiving : 0.00 0 0
11.59/11.65 c intdiving : 0.00 0 0
11.59/11.65 c actconsdiving : 0.00 0 0
11.59/11.65 c objpscostdiving : 0.00 0 0
11.59/11.65 c rootsoldiving : 0.00 0 0
11.59/11.65 c linesearchdiving : 0.00 0 0
11.59/11.65 c guideddiving : 0.00 0 0
11.59/11.65 c octane : 0.00 0 0
11.59/11.65 c rens : 0.00 0 0
11.59/11.65 c rins : 0.00 0 0
11.59/11.65 c localbranching : 0.00 0 0
11.59/11.65 c mutation : 0.00 0 0
11.59/11.65 c crossover : 0.00 0 0
11.59/11.65 c dins : 0.00 0 0
11.59/11.65 c undercover : 0.00 0 0
11.59/11.65 c nlp : 0.02 0 0
11.59/11.65 c trysol : 0.03 0 0
11.59/11.65 c LP : Time Calls Iterations Iter/call Iter/sec
11.59/11.65 c primal LP : 0.00 0 0 0.00 -
11.59/11.65 c dual LP : 0.00 0 0 0.00 -
11.59/11.65 c lex dual LP : 0.00 0 0 0.00 -
11.59/11.65 c barrier LP : 0.00 0 0 0.00 -
11.59/11.65 c diving/probing LP: 0.00 0 0 0.00 -
11.59/11.65 c strong branching : 0.00 0 0 0.00 -
11.59/11.65 c (at root node) : - 0 0 0.00 -
11.59/11.65 c conflict analysis: 0.00 0 0 0.00 -
11.59/11.65 c B&B Tree :
11.59/11.65 c number of runs : 1
11.59/11.65 c nodes : 49194
11.59/11.65 c nodes (total) : 49194
11.59/11.65 c nodes left : 0
11.59/11.65 c max depth : 61
11.59/11.65 c max depth (total): 61
11.59/11.65 c backtracks : 22191 (45.1%)
11.59/11.65 c delayed cutoffs : 31517
11.59/11.65 c repropagations : 110052 (1185790 domain reductions, 20289 cutoffs)
11.59/11.65 c avg switch length: 5.35
11.59/11.65 c switching time : 2.00
11.59/11.65 c Solution :
11.59/11.65 c Solutions found : 6 (6 improvements)
11.59/11.65 c First Solution : +1.11000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
11.59/11.65 c Primal Bound : +1.00000000000000e+01 (in run 1, after 47295 nodes, 9.80 seconds, depth 23, found by <relaxation>)
11.59/11.65 c Dual Bound : +1.00000000000000e+01
11.59/11.65 c Gap : 0.00 %
11.59/11.65 c Root Dual Bound : +4.00000000000000e+00
11.59/11.65 c Root Iterations : 0
11.59/11.65 c Time complete: 11.65.