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-2666212-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.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.01
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 = 0
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.03 c
0.03/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.03/0.03 c t 0.0s| 1 | 0 | 77 | - | 493k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 2.500000e+00 | 5.000000e+01 |1900.00%
0.03/0.03 o 49
0.03/0.03 c R 0.0s| 1 | 0 | 77 | - | 495k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 2.500000e+00 | 4.900000e+01 |1860.00%
0.03/0.03 o 48
0.03/0.03 c s 0.0s| 1 | 0 | 77 | - | 496k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 2.500000e+00 | 4.800000e+01 |1820.00%
0.03/0.05 c 0.0s| 1 | 0 | 135 | - | 524k| 0 | 46 | 50 | 100 | 50 | 101 | 1 | 0 | 0 | 2.544700e+00 | 4.800000e+01 |1786.27%
0.03/0.05 o 7
0.03/0.05 c b 0.0s| 1 | 0 | 135 | - | 526k| 0 | 46 | 50 | 100 | 50 | 101 | 1 | 0 | 0 | 2.544700e+00 | 7.000000e+00 | 175.08%
0.03/0.07 c 0.1s| 1 | 0 | 201 | - | 599k| 0 | 42 | 50 | 100 | 50 | 102 | 2 | 0 | 0 | 3.000000e+00 | 7.000000e+00 | 133.33%
0.03/0.07 o 7
0.03/0.07 c s 0.1s| 1 | 0 | 201 | - | 601k| 0 | 42 | 50 | 100 | 50 | 102 | 2 | 0 | 0 | 3.000000e+00 | 7.000000e+00 | 133.33%
0.03/0.07 o 5
0.03/0.07 c b 0.1s| 1 | 0 | 201 | - | 602k| 0 | 42 | 50 | 100 | 50 | 102 | 2 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.03/0.09 c 0.1s| 1 | 0 | 226 | - | 740k| 0 | 44 | 50 | 100 | 50 | 103 | 3 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.11 c 0.1s| 1 | 0 | 246 | - | 808k| 0 | 46 | 50 | 100 | 50 | 104 | 4 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.13 c 0.1s| 1 | 0 | 258 | - | 874k| 0 | 45 | 50 | 100 | 50 | 105 | 5 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.16 c 0.1s| 1 | 0 | 277 | - | 936k| 0 | 39 | 50 | 100 | 50 | 106 | 6 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.18 c 0.2s| 1 | 0 | 295 | - |1025k| 0 | 36 | 50 | 100 | 50 | 107 | 7 | 0 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.49/0.56 c 0.5s| 1 | 2 | 295 | - |1028k| 0 | 36 | 50 | 100 | 50 | 107 | 7 | 0 | 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
1.60/1.61 c 1.4s| 10000 | 25 | 295 | 0.0 |1079k| 44 | - | 50 | 104 | 0 | 0 | 7 |5687 | 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
2.69/2.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.69/2.71 c 2.4s| 20000 | 29 | 295 | 0.0 |1086k| 45 | - | 50 | 111 | 0 | 0 | 7 | 11k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
3.79/3.81 c 3.3s| 30000 | 33 | 295 | 0.0 |1089k| 46 | - | 50 | 113 | 0 | 0 | 7 | 17k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
4.79/4.90 c 4.2s| 40000 | 37 | 295 | 0.0 |1090k| 46 | - | 50 | 108 | 0 | 0 | 7 | 23k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
5.99/6.00 c 5.1s| 50000 | 29 | 295 | 0.0 |1091k| 46 | - | 50 | 113 | 0 | 0 | 7 | 29k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
6.99/7.10 c 6.0s| 60000 | 36 | 295 | 0.0 |1092k| 46 | - | 50 | 108 | 0 | 0 | 7 | 35k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
8.09/8.19 c 7.0s| 70000 | 27 | 295 | 0.0 |1091k| 46 | - | 50 | 112 | 0 | 0 | 7 | 41k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
9.19/9.29 c 7.9s| 80000 | 29 | 295 | 0.0 |1092k| 46 | - | 50 | 110 | 0 | 0 | 7 | 47k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
10.28/10.35 c 8.8s| 90000 | 30 | 295 | 0.0 |1093k| 46 | - | 50 | 111 | 0 | 0 | 7 | 53k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
11.38/11.44 c 9.8s|100000 | 24 | 295 | 0.0 |1092k| 46 | - | 50 | 112 | 0 | 0 | 7 | 59k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
12.49/12.51 c 10.7s|110000 | 25 | 295 | 0.0 |1091k| 46 | - | 50 | 109 | 0 | 0 | 7 | 64k| 33 | 3.000000e+00 | 5.000000e+00 | 66.67%
13.49/13.52 c
13.49/13.52 c SCIP Status : problem is solved [optimal solution found]
13.49/13.52 c Solving Time (sec) : 11.54
13.49/13.52 c Solving Nodes : 119478
13.49/13.52 c Primal Bound : +5.00000000000000e+00 (16 solutions)
13.49/13.52 c Dual Bound : +5.00000000000000e+00
13.49/13.52 c Gap : 0.00 %
13.49/13.52 s OPTIMUM FOUND
13.49/13.52 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 -x24
13.49/13.52 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 -x1
13.49/13.52 c SCIP Status : problem is solved [optimal solution found]
13.49/13.52 c Solving Time : 11.54
13.49/13.52 c Original Problem :
13.49/13.52 c Problem name : HOME/instance-2666212-1276593551.opb
13.49/13.52 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
13.49/13.52 c Constraints : 100 initial, 100 maximal
13.49/13.52 c Presolved Problem :
13.49/13.52 c Problem name : t_HOME/instance-2666212-1276593551.opb
13.49/13.52 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
13.49/13.52 c Constraints : 100 initial, 135 maximal
13.49/13.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
13.49/13.52 c trivial : 0.00 0 0 0 0 0 0 0 0
13.49/13.52 c dualfix : 0.00 0 0 0 0 0 0 0 0
13.49/13.52 c boundshift : 0.00 0 0 0 0 0 0 0 0
13.49/13.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0
13.49/13.52 c implics : 0.00 0 0 0 0 0 0 0 0
13.49/13.52 c probing : 0.00 0 0 0 0 0 0 0 0
13.49/13.52 c logicor : 0.00 0 0 0 0 0 0 0 0
13.49/13.52 c root node : - 50 - - 50 - - - -
13.49/13.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
13.49/13.52 c integral : 0 0 0 1 0 0 0 0 0 2
13.49/13.52 c logicor : 100+ 7 171122 0 0 68510 68805 0 0 0
13.49/13.52 c countsols : 0 0 0 0 0 0 0 0 0 0
13.49/13.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
13.49/13.52 c integral : 0.36 0.00 0.00 0.36 0.00
13.49/13.52 c logicor : 2.58 0.00 2.58 0.00 0.00
13.49/13.52 c countsols : 0.00 0.00 0.00 0.00 0.00
13.49/13.52 c Propagators : Time Calls Cutoffs DomReds
13.49/13.52 c vbounds : 0.14 2 0 0
13.49/13.52 c rootredcost : 0.08 1 0 0
13.49/13.52 c pseudoobj : 2.69 248172 2026 1212170
13.49/13.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
13.49/13.52 c propagation : 1.46 70536 70446 70446 20.9 38 31.4 -
13.49/13.52 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
13.49/13.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
13.49/13.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
13.49/13.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
13.49/13.52 c applied globally : - - - 62111 19.2 - - -
13.49/13.52 c applied locally : - - - 8354 33.5 - - -
13.49/13.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
13.49/13.52 c cut pool : 0.00 6 - - 0 - (maximal pool size: 295)
13.49/13.52 c redcost : 0.00 7 0 0 0 0
13.49/13.52 c impliedbounds : 0.00 7 0 0 0 0
13.49/13.52 c intobj : 0.00 0 0 0 0 0
13.49/13.52 c cgmip : 0.00 0 0 0 0 0
13.49/13.52 c gomory : 0.02 7 0 0 0 0
13.49/13.52 c strongcg : 0.02 7 0 0 292 0
13.49/13.52 c cmir : 0.04 7 0 0 2 0
13.49/13.52 c flowcover : 0.01 7 0 0 1 0
13.49/13.52 c clique : 0.00 1 0 0 0 0
13.49/13.52 c zerohalf : 0.00 0 0 0 0 0
13.49/13.52 c mcf : 0.00 1 0 0 0 0
13.49/13.52 c rapidlearning : 0.00 0 0 0 0 0
13.49/13.52 c Pricers : Time Calls Vars
13.49/13.52 c problem variables: 0.00 0 0
13.49/13.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
13.49/13.52 c relpscost : 0.36 1 0 0 0 0 2
13.49/13.52 c pscost : 0.00 0 0 0 0 0 0
13.49/13.52 c inference : 0.49 76432 0 0 0 0 152864
13.49/13.52 c mostinf : 0.00 0 0 0 0 0 0
13.49/13.52 c leastinf : 0.00 0 0 0 0 0 0
13.49/13.52 c fullstrong : 0.00 0 0 0 0 0 0
13.49/13.52 c allfullstrong : 0.00 0 0 0 0 0 0
13.49/13.52 c random : 0.00 0 0 0 0 0 0
13.49/13.52 c Primal Heuristics : Time Calls Found
13.49/13.52 c LP solutions : 0.00 - 0
13.49/13.52 c pseudo solutions : 0.00 - 0
13.49/13.52 c crossover : 0.00 0 0
13.49/13.52 c oneopt : 0.05 3 2
13.49/13.52 c trivial : 0.00 2 3
13.49/13.52 c simplerounding : 0.00 8 7
13.49/13.52 c zirounding : 0.00 1 1
13.49/13.52 c rounding : 0.00 8 1
13.49/13.52 c shifting : 0.00 8 2
13.49/13.52 c intshifting : 0.00 0 0
13.49/13.52 c twoopt : 0.00 0 0
13.49/13.52 c fixandinfer : 0.00 0 0
13.49/13.52 c feaspump : 0.00 0 0
13.49/13.52 c coefdiving : 0.00 0 0
13.49/13.52 c pscostdiving : 0.00 0 0
13.49/13.52 c fracdiving : 0.00 0 0
13.49/13.52 c veclendiving : 0.00 0 0
13.49/13.52 c intdiving : 0.00 0 0
13.49/13.52 c actconsdiving : 0.00 0 0
13.49/13.52 c objpscostdiving : 0.00 0 0
13.49/13.52 c rootsoldiving : 0.00 0 0
13.49/13.52 c linesearchdiving : 0.00 0 0
13.49/13.52 c guideddiving : 0.00 0 0
13.49/13.52 c octane : 0.00 0 0
13.49/13.52 c rens : 0.00 0 0
13.49/13.52 c rins : 0.00 0 0
13.49/13.52 c localbranching : 0.00 0 0
13.49/13.52 c mutation : 0.00 0 0
13.49/13.52 c dins : 0.00 0 0
13.49/13.52 c undercover : 0.00 0 0
13.49/13.52 c nlp : 0.08 0 0
13.49/13.52 c trysol : 0.03 0 0
13.49/13.52 c LP : Time Calls Iterations Iter/call Iter/sec
13.49/13.52 c primal LP : 0.00 0 0 0.00 -
13.49/13.52 c dual LP : 0.06 8 295 36.88 4916.67
13.49/13.52 c lex dual LP : 0.00 0 0 0.00 -
13.49/13.52 c barrier LP : 0.00 0 0 0.00 -
13.49/13.52 c diving/probing LP: 0.00 0 0 0.00 -
13.49/13.52 c strong branching : 0.36 33 4590 139.09 12750.00
13.49/13.52 c (at root node) : - 33 4590 139.09 -
13.49/13.52 c conflict analysis: 0.00 0 0 0.00 -
13.49/13.52 c B&B Tree :
13.49/13.52 c number of runs : 1
13.49/13.52 c nodes : 119478
13.49/13.52 c nodes (total) : 119478
13.49/13.52 c nodes left : 0
13.49/13.52 c max depth : 46
13.49/13.52 c max depth (total): 46
13.49/13.52 c backtracks : 63082 (52.8%)
13.49/13.52 c delayed cutoffs : 33389
13.49/13.52 c repropagations : 70455 (462463 domain reductions, 27491 cutoffs)
13.49/13.52 c avg switch length: 2.38
13.49/13.52 c switching time : 1.53
13.49/13.52 c Solution :
13.49/13.52 c Solutions found : 16 (6 improvements)
13.49/13.52 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
13.49/13.52 c Primal Bound : +5.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <oneopt>)
13.49/13.52 c Dual Bound : +5.00000000000000e+00
13.49/13.52 c Gap : 0.00 %
13.49/13.52 c Root Dual Bound : +3.00000000000000e+00
13.49/13.52 c Root Iterations : 295
13.49/13.52 c Time complete: 13.51.