0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666194-1276592016.opb>
0.01/0.01 c original problem has 67 variables (67 bin, 0 int, 0 impl, 0 cont) and 105 constraints
0.01/0.01 c problem read
0.01/0.01 c presolving settings loaded
0.01/0.02 o 67
0.01/0.02 c feasible solution found by trivial heuristic, objective value 6.700000e+01
0.01/0.02 c presolving:
0.01/0.02 c (round 1) 0 del vars, 55 del conss, 0 chg bounds, 55 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.01/0.02 c (round 2) 0 del vars, 55 del conss, 0 chg bounds, 55 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.01/0.03 c presolving (3 rounds):
0.01/0.03 c 0 deleted vars, 55 deleted constraints, 0 tightened bounds, 0 added holes, 55 changed sides, 0 changed coefficients
0.01/0.03 c 0 implications, 0 cliques
0.01/0.03 c presolved problem has 67 variables (67 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.01/0.03 c 50 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.00
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c conflict/interconss = 0
0.01/0.03 c
0.01/0.03 c # should binary conflicts be preferred?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c conflict/preferbinary = TRUE
0.01/0.03 c
0.01/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c constraints/agelimit = 1
0.01/0.03 c
0.01/0.03 c # should enforcement of pseudo solution be disabled?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/disableenfops = TRUE
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1799.99
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c lp/solvefreq = 0
0.01/0.03 c
0.01/0.03 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.01/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.03 c lp/pricing = a
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # priority of node selection rule <dfs> in standard mode
0.01/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.03 c nodeselection/dfs/stdpriority = 1000000
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.03 c
0.01/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.03 c t 0.0s| 1 | 0 | 27 | - | 463k| 0 | 10 | 67 | 50 | 67 | 50 | 0 | 0 | 0 | 6.000000e+00 | 6.700000e+01 |1016.67%
0.01/0.03 o 11
0.01/0.03 c r 0.0s| 1 | 0 | 27 | - | 464k| 0 | 10 | 67 | 50 | 67 | 50 | 0 | 0 | 0 | 6.000000e+00 | 1.100000e+01 | 83.33%
0.01/0.03 o 10
0.01/0.03 c R 0.0s| 1 | 0 | 27 | - | 466k| 0 | 10 | 67 | 50 | 67 | 50 | 0 | 0 | 0 | 6.000000e+00 | 1.000000e+01 | 66.67%
0.01/0.03 o 9
0.01/0.03 c s 0.0s| 1 | 0 | 27 | - | 467k| 0 | 10 | 67 | 50 | 67 | 50 | 0 | 0 | 0 | 6.000000e+00 | 9.000000e+00 | 50.00%
0.01/0.03 c 0.0s| 1 | 0 | 32 | - | 478k| 0 | 9 | 67 | 50 | 67 | 52 | 2 | 0 | 0 | 6.500000e+00 | 9.000000e+00 | 38.46%
0.01/0.03 o 8
0.01/0.03 c b 0.0s| 1 | 0 | 32 | - | 479k| 0 | 9 | 67 | 50 | 67 | 52 | 2 | 0 | 0 | 6.500000e+00 | 8.000000e+00 | 23.08%
0.01/0.04 c 0.0s| 1 | 0 | 37 | - | 490k| 0 | 16 | 67 | 50 | 67 | 54 | 4 | 0 | 0 | 6.500000e+00 | 8.000000e+00 | 23.08%
0.01/0.04 c 0.0s| 1 | 0 | 43 | - | 510k| 0 | 18 | 67 | 50 | 67 | 56 | 6 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.01/0.05 c 0.0s| 1 | 0 | 50 | - | 567k| 0 | 14 | 67 | 50 | 67 | 58 | 8 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.01/0.06 c 0.0s| 1 | 0 | 56 | - | 577k| 0 | 10 | 67 | 50 | 67 | 60 | 10 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.01/0.06 c 0.0s| 1 | 0 | 59 | - | 581k| 0 | 14 | 67 | 50 | 67 | 61 | 11 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.01/0.07 c 0.1s| 1 | 0 | 61 | - | 590k| 0 | 12 | 67 | 50 | 67 | 62 | 12 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.01/0.08 c 0.1s| 1 | 0 | 63 | - | 597k| 0 | 0 | 67 | 50 | 67 | 63 | 13 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.01/0.08 c (run 1, node 1) restarting after 16 global fixings of integer variables
0.01/0.08 c
0.01/0.08 c (restart) converted 13 cuts from the global cut pool into linear constraints
0.01/0.08 c
0.01/0.08 c presolving:
0.01/0.09 c (round 1) 16 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 0 impls, 0 clqs
0.01/0.09 c presolving (2 rounds):
0.01/0.09 c 16 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.09 c 0 implications, 0 cliques
0.01/0.09 c presolved problem has 51 variables (51 bin, 0 int, 0 impl, 0 cont) and 63 constraints
0.01/0.09 c 13 constraints of type <knapsack>
0.01/0.09 c 50 constraints of type <logicor>
0.01/0.09 c transformed objective value is always integral (scale: 1)
0.01/0.09 c Presolving Time: 0.01
0.01/0.09 c
0.01/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.01/0.09 c 0.1s| 1 | 0 | 91 | - | 551k| 0 | 12 | 51 | 63 | 51 | 63 | 0 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.09/0.10 c 0.1s| 1 | 0 | 100 | - | 558k| 0 | 14 | 51 | 63 | 51 | 65 | 2 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.09/0.13 o 7
0.09/0.13 c E 0.1s| 1 | 0 | 100 | - | 561k| 0 | - | 51 | 63 | 51 | 65 | 2 | 0 | 14 | 7.000000e+00 | 7.000000e+00 | 0.00%
0.09/0.14 c
0.09/0.14 c SCIP Status : problem is solved [optimal solution found]
0.09/0.14 c Solving Time (sec) : 0.09
0.09/0.14 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.09/0.14 c Primal Bound : +7.00000000000000e+00 (20 solutions)
0.09/0.14 c Dual Bound : +7.00000000000000e+00
0.09/0.14 c Gap : 0.00 %
0.09/0.14 s OPTIMUM FOUND
0.09/0.14 v -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42
0.09/0.14 v -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 x32 -x31 -x30 -x29 x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16
0.09/0.14 v x15 -x14 -x13 -x12 x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 -x1
0.09/0.14 c SCIP Status : problem is solved [optimal solution found]
0.09/0.14 c Solving Time : 0.09
0.09/0.14 c Original Problem :
0.09/0.14 c Problem name : HOME/instance-2666194-1276592016.opb
0.09/0.14 c Variables : 67 (67 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.14 c Constraints : 105 initial, 105 maximal
0.09/0.14 c Presolved Problem :
0.09/0.14 c Problem name : t_HOME/instance-2666194-1276592016.opb
0.09/0.14 c Variables : 51 (51 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.14 c Constraints : 63 initial, 63 maximal
0.09/0.14 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.14 c trivial : 0.00 16 0 0 0 0 0 0 0
0.09/0.14 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.14 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.14 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.14 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.14 c probing : 0.00 0 0 0 0 0 0 0 0
0.09/0.14 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.09/0.14 c linear : 0.00 0 0 0 0 0 55 55 0
0.09/0.14 c logicor : 0.00 0 0 0 0 0 0 0 0
0.09/0.14 c root node : - 16 - - 16 - - - -
0.09/0.14 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.14 c integral : 0 0 0 2 0 0 0 0 0 2
0.09/0.14 c knapsack : 13 1 1 0 0 0 0 0 0 0
0.09/0.14 c logicor : 50 10 55 1 0 0 0 0 0 0
0.09/0.14 c countsols : 0 0 0 1 0 0 0 0 0 0
0.09/0.14 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.14 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c Propagators : Time Calls Cutoffs DomReds
0.09/0.14 c vbounds : 0.00 3 0 0
0.09/0.14 c rootredcost : 0.00 0 0 0
0.09/0.14 c pseudoobj : 0.00 7 0 0
0.09/0.14 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.14 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.14 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.14 c applied globally : - - - 0 0.0 - - -
0.09/0.14 c applied locally : - - - 0 0.0 - - -
0.09/0.14 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.14 c cut pool : 0.00 0 - - 0 - (maximal pool size: 4)
0.09/0.14 c redcost : 0.00 10 0 16 0 0
0.09/0.14 c impliedbounds : 0.00 9 0 0 0 0
0.09/0.14 c intobj : 0.00 0 0 0 0 0
0.09/0.14 c cgmip : 0.00 0 0 0 0 0
0.09/0.14 c gomory : 0.00 9 0 0 319 0
0.09/0.14 c strongcg : 0.02 9 0 0 319 0
0.09/0.14 c cmir : 0.00 9 0 0 0 0
0.09/0.14 c flowcover : 0.03 9 0 0 0 0
0.09/0.14 c clique : 0.00 2 0 0 0 0
0.09/0.14 c zerohalf : 0.00 0 0 0 0 0
0.09/0.14 c mcf : 0.00 2 0 0 0 0
0.09/0.14 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.14 c Pricers : Time Calls Vars
0.09/0.14 c problem variables: 0.00 0 0
0.09/0.14 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.14 c relpscost : 0.00 1 0 0 0 0 2
0.09/0.14 c pscost : 0.00 0 0 0 0 0 0
0.09/0.14 c inference : 0.00 0 0 0 0 0 0
0.09/0.14 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.14 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.14 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.14 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.14 c random : 0.00 0 0 0 0 0 0
0.09/0.14 c Primal Heuristics : Time Calls Found
0.09/0.14 c LP solutions : 0.00 - 0
0.09/0.14 c pseudo solutions : 0.00 - 0
0.09/0.14 c crossover : 0.00 0 0
0.09/0.14 c oneopt : 0.00 2 1
0.09/0.14 c trivial : 0.00 2 3
0.09/0.14 c simplerounding : 0.00 10 10
0.09/0.14 c zirounding : 0.00 1 1
0.09/0.14 c rounding : 0.00 10 1
0.09/0.14 c shifting : 0.00 10 3
0.09/0.14 c intshifting : 0.00 0 0
0.09/0.14 c twoopt : 0.00 0 0
0.09/0.14 c fixandinfer : 0.00 0 0
0.09/0.14 c feaspump : 0.00 0 0
0.09/0.14 c coefdiving : 0.00 0 0
0.09/0.14 c pscostdiving : 0.00 0 0
0.09/0.14 c fracdiving : 0.00 0 0
0.09/0.14 c veclendiving : 0.00 0 0
0.09/0.14 c intdiving : 0.00 0 0
0.09/0.14 c actconsdiving : 0.00 0 0
0.09/0.14 c objpscostdiving : 0.00 0 0
0.09/0.14 c rootsoldiving : 0.00 0 0
0.09/0.14 c linesearchdiving : 0.00 0 0
0.09/0.14 c guideddiving : 0.00 0 0
0.09/0.14 c octane : 0.00 0 0
0.09/0.14 c rens : 0.02 1 1
0.09/0.14 c rins : 0.00 0 0
0.09/0.14 c localbranching : 0.00 0 0
0.09/0.14 c mutation : 0.00 0 0
0.09/0.14 c dins : 0.00 0 0
0.09/0.14 c undercover : 0.00 0 0
0.09/0.14 c nlp : 0.00 0 0
0.09/0.14 c trysol : 0.00 0 0
0.09/0.14 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.14 c primal LP : 0.00 0 0 0.00 -
0.09/0.14 c dual LP : 0.01 11 100 9.09 10000.00
0.09/0.14 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.14 c barrier LP : 0.00 0 0 0.00 -
0.09/0.14 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.14 c strong branching : 0.00 14 95 6.79 -
0.09/0.14 c (at root node) : - 14 95 6.79 -
0.09/0.14 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.14 c B&B Tree :
0.09/0.14 c number of runs : 2
0.09/0.14 c nodes : 1
0.09/0.14 c nodes (total) : 2
0.09/0.14 c nodes left : 0
0.09/0.14 c max depth : 0
0.09/0.14 c max depth (total): 0
0.09/0.14 c backtracks : 0 (0.0%)
0.09/0.14 c delayed cutoffs : 0
0.09/0.14 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.14 c avg switch length: 2.00
0.09/0.14 c switching time : 0.00
0.09/0.14 c Solution :
0.09/0.14 c Solutions found : 20 (6 improvements)
0.09/0.14 c First Solution : +6.70000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.09/0.14 c Primal Bound : +7.00000000000000e+00 (in run 2, after 1 nodes, 0.08 seconds, depth 0, found by <rens>)
0.09/0.14 c Dual Bound : +7.00000000000000e+00
0.09/0.14 c Gap : 0.00 %
0.09/0.14 c Root Dual Bound : +7.00000000000000e+00
0.09/0.14 c Root Iterations : 100
0.09/0.15 c Time complete: 0.14.