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-2663705-1276650554.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.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.02/0.04 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.02/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.02/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.02/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.02/0.07 c (0.0s) probing: 142/267 (53.2%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.02/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.07 c presolving (5 rounds):
0.02/0.07 c 57 deleted vars, 48 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 76 changed coefficients
0.02/0.07 c 1968 implications, 0 cliques
0.02/0.07 c presolved problem has 267 variables (267 bin, 0 int, 0 impl, 0 cont) and 199 constraints
0.02/0.07 c 192 constraints of type <and>
0.02/0.07 c 3 constraints of type <linear>
0.02/0.07 c 4 constraints of type <logicor>
0.02/0.07 c transformed objective value is always integral (scale: 2)
0.02/0.07 c Presolving Time: 0.04
0.02/0.07 c - non default parameters ----------------------------------------------------------------------
0.02/0.07 c # SCIP version 1.2.1.2
0.02/0.07 c
0.02/0.07 c # frequency for displaying node information lines
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.07 c display/freq = 10000
0.02/0.07 c
0.02/0.07 c # maximal time in seconds to run
0.02/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07 c limits/time = 1800
0.02/0.07 c
0.02/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07 c limits/memory = 1620
0.02/0.07 c
0.02/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07 c lp/solvefreq = -1
0.02/0.07 c
0.02/0.07 c # should presolving try to simplify inequalities
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/linear/simplifyinequalities = TRUE
0.02/0.07 c
0.02/0.07 c # should presolving try to simplify knapsacks
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.07 c
0.02/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07 c heuristics/undercover/freq = 0
0.02/0.07 c
0.02/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07 c separating/rapidlearning/freq = 0
0.02/0.07 c
0.02/0.07 c -----------------------------------------------------------------------------------------------
0.02/0.07 c start solving
0.02/0.07 c
0.02/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.07 c 0.0s| 1 | 2 | 0 | - | 896k| 0 | - | 267 | 199 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.39/0.48 o 171
0.39/0.48 c * 0.4s| 2471 | 1815 | 0 | 0.0 |2272k| 134 | - | 267 | 294 | 0 | 0 | 0 | 154 | 0 | 1.000000e+00 | 1.710000e+02 | Large
1.79/1.89 c 1.6s| 10000 | 6670 | 0 | 0.0 |5721k| 134 | - | 267 | 341 | 0 | 0 | 0 | 824 | 0 | 1.000000e+00 | 1.710000e+02 | Large
2.59/2.66 o 9
2.59/2.66 c * 2.3s| 14291 | 7609 | 0 | 0.0 |6438k| 134 | - | 267 | 466 | 0 | 0 | 0 |1199 | 0 | 1.000000e+00 | 9.000000e+00 | 800.00%
3.20/3.26 o 5
3.20/3.26 c * 2.9s| 17308 | 8186 | 0 | 0.0 |6933k| 134 | - | 267 | 593 | 0 | 0 | 0 |1503 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
3.79/3.81 c 3.4s| 20000 | 9976 | 0 | 0.0 |8360k| 134 | - | 267 | 375 | 0 | 0 | 0 |1862 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
5.40/5.47 o 3
5.40/5.47 c * 4.8s| 27395 | 4227 | 0 | 0.0 |5301k| 134 | - | 267 | 632 | 0 | 0 | 0 |2888 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
5.40/5.50 c
5.40/5.50 c SCIP Status : problem is solved [optimal solution found]
5.40/5.50 c Solving Time (sec) : 4.85
5.40/5.50 c Solving Nodes : 27396
5.40/5.50 c Primal Bound : +3.00000000000000e+00 (4 solutions)
5.40/5.50 c Dual Bound : +3.00000000000000e+00
5.40/5.50 c Gap : 0.00 %
5.40/5.50 s OPTIMUM FOUND
5.40/5.50 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
5.40/5.50 v x46 -x63 -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
5.40/5.50 v x28 -x27 -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
5.40/5.50 c SCIP Status : problem is solved [optimal solution found]
5.40/5.50 c Solving Time : 4.85
5.40/5.50 c Original Problem :
5.40/5.50 c Problem name : HOME/instance-2663705-1276650554.opb
5.40/5.50 c Variables : 324 (324 binary, 0 integer, 0 implicit integer, 0 continuous)
5.40/5.50 c Constraints : 250 initial, 250 maximal
5.40/5.50 c Presolved Problem :
5.40/5.50 c Problem name : t_HOME/instance-2663705-1276650554.opb
5.40/5.50 c Variables : 267 (267 binary, 0 integer, 0 implicit integer, 0 continuous)
5.40/5.50 c Constraints : 199 initial, 638 maximal
5.40/5.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.40/5.50 c trivial : 0.00 0 0 0 0 0 0 0 0
5.40/5.50 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.40/5.50 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.40/5.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.40/5.50 c implics : 0.00 0 0 0 0 0 0 0 0
5.40/5.50 c probing : 0.01 0 0 0 0 0 0 0 0
5.40/5.50 c and : 0.02 6 48 0 0 0 48 0 48
5.40/5.50 c linear : 0.00 1 2 0 0 0 0 0 28
5.40/5.50 c logicor : 0.00 0 0 0 0 0 0 0 0
5.40/5.50 c root node : - 71 - - 71 - - - -
5.40/5.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.40/5.50 c integral : 0 0 0 0 0 0 0 0 0 0
5.40/5.50 c and : 192 0 62528 0 22824 730 131728 0 0 0
5.40/5.50 c linear : 3 0 61797 0 22824 4364 46861 0 0 0
5.40/5.50 c logicor : 4+ 0 23391 0 22364 240 4197 0 0 0
5.40/5.50 c countsols : 0 0 0 0 22828 0 0 0 0 0
5.40/5.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.40/5.50 c integral : 0.00 0.00 0.00 0.00 0.00
5.40/5.50 c and : 0.70 0.00 0.54 0.00 0.16
5.40/5.50 c linear : 1.53 0.00 1.52 0.00 0.01
5.40/5.50 c logicor : 0.29 0.00 0.24 0.00 0.05
5.40/5.50 c countsols : 0.01 0.00 0.00 0.00 0.01
5.40/5.50 c Propagators : Time Calls Cutoffs DomReds
5.40/5.50 c vbounds : 0.03 2 0 0
5.40/5.50 c rootredcost : 0.01 0 0 0
5.40/5.50 c pseudoobj : 0.11 62288 44 552
5.40/5.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.40/5.50 c propagation : 0.30 2135 2118 17781 42.2 244 48.5 -
5.40/5.50 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.40/5.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.40/5.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.40/5.50 c pseudo solution : 0.00 1 1 1 0.0 0 0.0 -
5.40/5.50 c applied globally : - - - 2785 14.5 - - -
5.40/5.50 c applied locally : - - - 103 46.6 - - -
5.40/5.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.40/5.50 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
5.40/5.50 c redcost : 0.00 0 0 0 0 0
5.40/5.50 c impliedbounds : 0.00 0 0 0 0 0
5.40/5.50 c intobj : 0.00 0 0 0 0 0
5.40/5.50 c cgmip : 0.00 0 0 0 0 0
5.40/5.50 c gomory : 0.00 0 0 0 0 0
5.40/5.50 c strongcg : 0.00 0 0 0 0 0
5.40/5.50 c cmir : 0.00 0 0 0 0 0
5.40/5.50 c flowcover : 0.00 0 0 0 0 0
5.40/5.50 c clique : 0.00 0 0 0 0 0
5.40/5.50 c zerohalf : 0.00 0 0 0 0 0
5.40/5.50 c mcf : 0.00 0 0 0 0 0
5.40/5.50 c rapidlearning : 0.00 0 0 0 0 0
5.40/5.50 c Pricers : Time Calls Vars
5.40/5.50 c problem variables: 0.00 0 0
5.40/5.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.40/5.50 c relpscost : 0.00 0 0 0 0 0 0
5.40/5.50 c pscost : 0.00 0 0 0 0 0 0
5.40/5.50 c inference : 0.41 22824 0 0 0 0 45648
5.40/5.50 c mostinf : 0.00 0 0 0 0 0 0
5.40/5.50 c leastinf : 0.00 0 0 0 0 0 0
5.40/5.50 c fullstrong : 0.00 0 0 0 0 0 0
5.40/5.50 c allfullstrong : 0.00 0 0 0 0 0 0
5.40/5.50 c random : 0.00 0 0 0 0 0 0
5.40/5.50 c Primal Heuristics : Time Calls Found
5.40/5.50 c LP solutions : 0.00 - 0
5.40/5.50 c pseudo solutions : 0.01 - 4
5.40/5.50 c oneopt : 0.04 0 0
5.40/5.50 c trivial : 0.00 2 0
5.40/5.50 c simplerounding : 0.00 0 0
5.40/5.50 c zirounding : 0.00 0 0
5.40/5.50 c rounding : 0.00 0 0
5.40/5.50 c shifting : 0.00 0 0
5.40/5.50 c intshifting : 0.00 0 0
5.40/5.50 c twoopt : 0.00 0 0
5.40/5.50 c fixandinfer : 0.00 0 0
5.40/5.50 c feaspump : 0.00 0 0
5.40/5.50 c coefdiving : 0.00 0 0
5.40/5.50 c pscostdiving : 0.00 0 0
5.40/5.50 c fracdiving : 0.00 0 0
5.40/5.50 c veclendiving : 0.00 0 0
5.40/5.50 c intdiving : 0.00 0 0
5.40/5.50 c actconsdiving : 0.00 0 0
5.40/5.50 c objpscostdiving : 0.00 0 0
5.40/5.50 c rootsoldiving : 0.00 0 0
5.40/5.50 c linesearchdiving : 0.00 0 0
5.40/5.50 c guideddiving : 0.00 0 0
5.40/5.50 c octane : 0.00 0 0
5.40/5.50 c rens : 0.00 0 0
5.40/5.50 c rins : 0.00 0 0
5.40/5.50 c localbranching : 0.00 0 0
5.40/5.50 c mutation : 0.00 0 0
5.40/5.50 c crossover : 0.00 0 0
5.40/5.50 c dins : 0.00 0 0
5.40/5.50 c undercover : 0.00 0 0
5.40/5.50 c nlp : 0.03 0 0
5.40/5.50 c trysol : 0.02 0 0
5.40/5.50 c LP : Time Calls Iterations Iter/call Iter/sec
5.40/5.50 c primal LP : 0.00 0 0 0.00 -
5.40/5.50 c dual LP : 0.00 0 0 0.00 -
5.40/5.50 c lex dual LP : 0.00 0 0 0.00 -
5.40/5.50 c barrier LP : 0.00 0 0 0.00 -
5.40/5.50 c diving/probing LP: 0.00 0 0 0.00 -
5.40/5.50 c strong branching : 0.00 0 0 0.00 -
5.40/5.50 c (at root node) : - 0 0 0.00 -
5.40/5.50 c conflict analysis: 0.00 0 0 0.00 -
5.40/5.50 c B&B Tree :
5.40/5.50 c number of runs : 1
5.40/5.50 c nodes : 27396
5.40/5.50 c nodes (total) : 27396
5.40/5.50 c nodes left : 0
5.40/5.50 c max depth : 134
5.40/5.50 c max depth (total): 134
5.40/5.50 c backtracks : 3109 (11.3%)
5.40/5.50 c delayed cutoffs : 7873
5.40/5.50 c repropagations : 5754 (20930 domain reductions, 811 cutoffs)
5.40/5.50 c avg switch length: 4.67
5.40/5.50 c switching time : 0.86
5.40/5.50 c Solution :
5.40/5.50 c Solutions found : 4 (4 improvements)
5.40/5.50 c First Solution : +1.71000000000000e+02 (in run 1, after 2471 nodes, 0.40 seconds, depth 124, found by <relaxation>)
5.40/5.50 c Primal Bound : +3.00000000000000e+00 (in run 1, after 27395 nodes, 4.81 seconds, depth 48, found by <relaxation>)
5.40/5.50 c Dual Bound : +3.00000000000000e+00
5.40/5.50 c Gap : 0.00 %
5.40/5.50 c Root Dual Bound : +1.00000000000000e+00
5.40/5.50 c Root Iterations : 0
5.49/5.51 c Time complete: 5.51.