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-2664782-1276593551.opb>
0.00/0.01 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 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 50
0.00/0.02 c feasible solution found by trivial heuristic, objective value 5.000000e+01
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 100 upgd conss, 0 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.02 c 100 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.00
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.2
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1800
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = -1
0.00/0.02 c
0.00/0.02 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.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c t 0.0s| 1 | 2 | 0 | - | 348k| 0 | - | 50 | 100 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 5.000000e+01 | Inf
0.00/0.03 o 7
0.00/0.03 c * 0.0s| 44 | 39 | 0 | 0.0 | 359k| 43 | - | 50 | 100 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | 7.000000e+00 | 600.00%
0.00/0.03 o 6
0.00/0.03 c * 0.0s| 90 | 40 | 0 | 0.0 | 370k| 45 | - | 50 | 100 | 0 | 0 | 0 | 25 | 0 | 1.000000e+00 | 6.000000e+00 | 500.00%
0.00/0.05 o 5
0.00/0.05 c * 0.0s| 257 | 35 | 0 | 0.0 | 374k| 46 | - | 50 | 104 | 0 | 0 | 0 | 119 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.10/1.11 c 0.9s| 10000 | 31 | 0 | 0.0 | 392k| 46 | - | 50 | 113 | 0 | 0 | 0 |6021 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
2.09/2.16 c 1.8s| 20000 | 33 | 0 | 0.0 | 397k| 46 | - | 50 | 111 | 0 | 0 | 0 | 11k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
3.19/3.21 c 2.7s| 30000 | 31 | 0 | 0.0 | 399k| 46 | - | 50 | 113 | 0 | 0 | 0 | 17k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
4.19/4.28 c 3.6s| 40000 | 28 | 0 | 0.0 | 401k| 46 | - | 50 | 111 | 0 | 0 | 0 | 23k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
5.29/5.33 c 4.5s| 50000 | 21 | 0 | 0.0 | 399k| 46 | - | 50 | 109 | 0 | 0 | 0 | 29k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
6.29/6.40 c 5.4s| 60000 | 19 | 0 | 0.0 | 401k| 46 | - | 50 | 107 | 0 | 0 | 0 | 35k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
7.39/7.44 c 6.3s| 70000 | 21 | 0 | 0.0 | 402k| 46 | - | 50 | 102 | 0 | 0 | 0 | 40k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
8.39/8.47 c 7.2s| 80000 | 31 | 0 | 0.0 | 410k| 46 | - | 50 | 112 | 0 | 0 | 0 | 46k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
9.49/9.53 c 8.1s| 90000 | 14 | 0 | 0.0 | 403k| 46 | - | 50 | 104 | 0 | 0 | 0 | 52k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
10.49/10.57 c 9.0s|100000 | 33 | 0 | 0.0 | 410k| 46 | - | 50 | 109 | 0 | 0 | 0 | 57k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
11.59/11.64 c 9.9s|110000 | 29 | 0 | 0.0 | 410k| 46 | - | 50 | 108 | 0 | 0 | 0 | 63k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
12.58/12.69 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
12.58/12.69 c 10.8s|120000 | 29 | 0 | 0.0 | 411k| 46 | - | 50 | 108 | 0 | 0 | 0 | 69k| 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
13.48/13.55 c
13.48/13.55 c SCIP Status : problem is solved [optimal solution found]
13.48/13.55 c Solving Time (sec) : 11.47
13.48/13.55 c Solving Nodes : 128178
13.48/13.55 c Primal Bound : +5.00000000000000e+00 (6 solutions)
13.48/13.55 c Dual Bound : +5.00000000000000e+00
13.48/13.55 c Gap : 0.00 %
13.48/13.55 s OPTIMUM FOUND
13.48/13.55 v -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 -x25
13.48/13.55 v -x24 -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
13.48/13.55 c SCIP Status : problem is solved [optimal solution found]
13.48/13.55 c Solving Time : 11.47
13.48/13.55 c Original Problem :
13.48/13.55 c Problem name : HOME/instance-2664782-1276593551.opb
13.48/13.55 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
13.48/13.55 c Constraints : 100 initial, 100 maximal
13.48/13.55 c Presolved Problem :
13.48/13.55 c Problem name : t_HOME/instance-2664782-1276593551.opb
13.48/13.55 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
13.48/13.55 c Constraints : 100 initial, 129 maximal
13.48/13.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
13.48/13.55 c trivial : 0.00 0 0 0 0 0 0 0 0
13.48/13.55 c dualfix : 0.00 0 0 0 0 0 0 0 0
13.48/13.55 c boundshift : 0.00 0 0 0 0 0 0 0 0
13.48/13.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0
13.48/13.55 c implics : 0.00 0 0 0 0 0 0 0 0
13.48/13.55 c probing : 0.00 0 0 0 0 0 0 0 0
13.48/13.55 c logicor : 0.00 0 0 0 0 0 0 0 0
13.48/13.55 c root node : - 50 - - 50 - - - -
13.48/13.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
13.48/13.55 c integral : 0 0 0 0 0 0 0 0 0 0
13.48/13.55 c logicor : 100+ 0 182042 0 1 72640 70580 0 0 0
13.48/13.55 c countsols : 0 0 0 0 3 0 0 0 0 0
13.48/13.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
13.48/13.55 c integral : 0.00 0.00 0.00 0.00 0.00
13.48/13.55 c logicor : 2.56 0.00 2.56 0.00 0.00
13.48/13.55 c countsols : 0.00 0.00 0.00 0.00 0.00
13.48/13.55 c Propagators : Time Calls Cutoffs DomReds
13.48/13.55 c vbounds : 0.11 2 0 0
13.48/13.55 c rootredcost : 0.16 0 0 0
13.48/13.55 c pseudoobj : 2.42 261934 1921 1255653
13.48/13.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
13.48/13.55 c propagation : 1.45 74561 73803 73803 21.1 36 32.6 -
13.48/13.55 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
13.48/13.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
13.48/13.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
13.48/13.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
13.48/13.55 c applied globally : - - - 63927 19.2 - - -
13.48/13.55 c applied locally : - - - 9889 33.7 - - -
13.48/13.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
13.48/13.55 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
13.48/13.55 c redcost : 0.00 0 0 0 0 0
13.48/13.55 c impliedbounds : 0.00 0 0 0 0 0
13.48/13.55 c intobj : 0.00 0 0 0 0 0
13.48/13.55 c cgmip : 0.00 0 0 0 0 0
13.48/13.55 c gomory : 0.00 0 0 0 0 0
13.48/13.55 c strongcg : 0.00 0 0 0 0 0
13.48/13.55 c cmir : 0.00 0 0 0 0 0
13.48/13.55 c flowcover : 0.00 0 0 0 0 0
13.48/13.55 c clique : 0.00 0 0 0 0 0
13.48/13.55 c zerohalf : 0.00 0 0 0 0 0
13.48/13.55 c mcf : 0.00 0 0 0 0 0
13.48/13.55 c rapidlearning : 0.00 0 0 0 0 0
13.48/13.55 c Pricers : Time Calls Vars
13.48/13.55 c problem variables: 0.00 0 0
13.48/13.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
13.48/13.55 c relpscost : 0.00 0 0 0 0 0 0
13.48/13.55 c pscost : 0.00 0 0 0 0 0 0
13.48/13.55 c inference : 0.45 80779 0 0 0 0 161558
13.48/13.55 c mostinf : 0.00 0 0 0 0 0 0
13.48/13.55 c leastinf : 0.00 0 0 0 0 0 0
13.48/13.55 c fullstrong : 0.00 0 0 0 0 0 0
13.48/13.55 c allfullstrong : 0.00 0 0 0 0 0 0
13.48/13.55 c random : 0.00 0 0 0 0 0 0
13.48/13.55 c Primal Heuristics : Time Calls Found
13.48/13.55 c LP solutions : 0.00 - 0
13.48/13.55 c pseudo solutions : 0.00 - 3
13.48/13.55 c oneopt : 0.10 0 0
13.48/13.55 c trivial : 0.00 2 3
13.48/13.55 c simplerounding : 0.00 0 0
13.48/13.55 c zirounding : 0.00 0 0
13.48/13.55 c rounding : 0.00 0 0
13.48/13.55 c shifting : 0.00 0 0
13.48/13.55 c intshifting : 0.00 0 0
13.48/13.55 c twoopt : 0.00 0 0
13.48/13.55 c fixandinfer : 0.00 0 0
13.48/13.55 c feaspump : 0.00 0 0
13.48/13.55 c coefdiving : 0.00 0 0
13.48/13.55 c pscostdiving : 0.00 0 0
13.48/13.55 c fracdiving : 0.00 0 0
13.48/13.55 c veclendiving : 0.00 0 0
13.48/13.55 c intdiving : 0.00 0 0
13.48/13.55 c actconsdiving : 0.00 0 0
13.48/13.55 c objpscostdiving : 0.00 0 0
13.48/13.55 c rootsoldiving : 0.00 0 0
13.48/13.55 c linesearchdiving : 0.00 0 0
13.48/13.55 c guideddiving : 0.00 0 0
13.48/13.55 c octane : 0.00 0 0
13.48/13.55 c rens : 0.00 0 0
13.48/13.55 c rins : 0.00 0 0
13.48/13.55 c localbranching : 0.00 0 0
13.48/13.55 c mutation : 0.00 0 0
13.48/13.55 c crossover : 0.00 0 0
13.48/13.55 c dins : 0.00 0 0
13.48/13.55 c undercover : 0.00 0 0
13.48/13.55 c nlp : 0.04 0 0
13.48/13.55 c trysol : 0.09 0 0
13.48/13.55 c LP : Time Calls Iterations Iter/call Iter/sec
13.48/13.55 c primal LP : 0.00 0 0 0.00 -
13.48/13.55 c dual LP : 0.00 0 0 0.00 -
13.48/13.55 c lex dual LP : 0.00 0 0 0.00 -
13.48/13.55 c barrier LP : 0.00 0 0 0.00 -
13.48/13.55 c diving/probing LP: 0.00 0 0 0.00 -
13.48/13.55 c strong branching : 0.00 0 0 0.00 -
13.48/13.55 c (at root node) : - 0 0 0.00 -
13.48/13.55 c conflict analysis: 0.00 0 0 0.00 -
13.48/13.55 c B&B Tree :
13.48/13.55 c number of runs : 1
13.48/13.55 c nodes : 128178
13.48/13.55 c nodes (total) : 128178
13.48/13.55 c nodes left : 0
13.48/13.55 c max depth : 46
13.48/13.55 c max depth (total): 46
13.48/13.55 c backtracks : 66434 (51.8%)
13.48/13.55 c delayed cutoffs : 33370
13.48/13.55 c repropagations : 73350 (438075 domain reductions, 27165 cutoffs)
13.48/13.55 c avg switch length: 2.38
13.48/13.55 c switching time : 1.56
13.48/13.55 c Solution :
13.48/13.55 c Solutions found : 6 (4 improvements)
13.48/13.55 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
13.48/13.55 c Primal Bound : +5.00000000000000e+00 (in run 1, after 257 nodes, 0.03 seconds, depth 46, found by <relaxation>)
13.48/13.55 c Dual Bound : +5.00000000000000e+00
13.48/13.55 c Gap : 0.00 %
13.48/13.55 c Root Dual Bound : +0.00000000000000e+00
13.48/13.55 c Root Iterations : 0
13.48/13.55 c Time complete: 13.54.