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-2665225-1276658762.opb>
0.00/0.01 c original problem has 353 variables (353 bin, 0 int, 0 impl, 0 cont) and 353 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 0
0.00/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.02 c presolving:
0.00/0.06 c (round 1) 303 del vars, 50 del conss, 303 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1212 impls, 0 clqs
0.00/0.07 c presolving (2 rounds):
0.00/0.07 c 303 deleted vars, 50 deleted constraints, 303 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.07 c 1818 implications, 0 cliques
0.00/0.07 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 303 constraints
0.00/0.07 c 303 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.04
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c conflict/interconss = 0
0.00/0.07 c
0.00/0.07 c # should binary conflicts be preferred?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c conflict/preferbinary = TRUE
0.00/0.07 c
0.00/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c constraints/agelimit = 1
0.00/0.07 c
0.00/0.07 c # should enforcement of pseudo solution be disabled?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/disableenfops = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c lp/solvefreq = 0
0.00/0.07 c
0.00/0.07 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.07 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.07 c lp/pricing = a
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # priority of node selection rule <dfs> in standard mode
0.00/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.07 c nodeselection/dfs/stdpriority = 1000000
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.07/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.08 c t 0.0s| 1 | 0 | 53 | - |1060k| 0 | 50 | 50 | 303 | 50 | 303 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.07/0.08 o -1
0.07/0.08 c R 0.0s| 1 | 0 | 53 | - |1061k| 0 | 50 | 50 | 303 | 50 | 303 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.07/0.08 o -2
0.07/0.08 c s 0.0s| 1 | 0 | 53 | - |1062k| 0 | 50 | 50 | 303 | 50 | 303 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.07/0.09 c 0.1s| 1 | 0 | 72 | - |1066k| 0 | 45 | 50 | 303 | 50 | 309 | 6 | 0 | 0 |-2.250000e+01 |-2.000000e+00 | 91.11%
0.07/0.09 o -8
0.07/0.09 c b 0.1s| 1 | 0 | 72 | - |1068k| 0 | 45 | 50 | 303 | 50 | 309 | 6 | 0 | 0 |-2.250000e+01 |-8.000000e+00 | 64.44%
0.09/0.10 c 0.1s| 1 | 0 | 96 | - |1071k| 0 | 41 | 50 | 303 | 50 | 315 | 12 | 0 | 0 |-2.050000e+01 |-8.000000e+00 | 60.98%
0.09/0.11 c 0.1s| 1 | 0 | 122 | - |1075k| 0 | 37 | 50 | 303 | 50 | 320 | 17 | 0 | 0 |-1.850000e+01 |-8.000000e+00 | 56.76%
0.09/0.13 c 0.1s| 1 | 0 | 159 | - |1083k| 0 | 43 | 50 | 303 | 50 | 328 | 25 | 0 | 0 |-1.700000e+01 |-8.000000e+00 | 52.94%
0.09/0.15 c 0.1s| 1 | 0 | 171 | - |1091k| 0 | 34 | 50 | 303 | 50 | 336 | 33 | 0 | 0 |-1.700000e+01 |-8.000000e+00 | 52.94%
0.09/0.17 c 0.1s| 1 | 0 | 247 | - |1096k| 0 | 42 | 50 | 303 | 50 | 343 | 40 | 0 | 0 |-1.630000e+01 |-8.000000e+00 | 50.92%
0.19/0.21 c 0.2s| 1 | 0 | 280 | - |1122k| 0 | 42 | 50 | 303 | 50 | 351 | 48 | 0 | 0 |-1.566667e+01 |-8.000000e+00 | 48.94%
0.19/0.24 c 0.2s| 1 | 0 | 302 | - |1156k| 0 | 44 | 50 | 303 | 50 | 359 | 56 | 0 | 0 |-1.500000e+01 |-8.000000e+00 | 46.67%
0.19/0.27 c 0.2s| 1 | 0 | 332 | - |1251k| 0 | 48 | 50 | 303 | 50 | 366 | 63 | 0 | 0 |-1.485088e+01 |-8.000000e+00 | 46.13%
0.30/0.32 c 0.3s| 1 | 0 | 354 | - |1705k| 0 | 40 | 50 | 303 | 50 | 376 | 73 | 0 | 0 |-1.466667e+01 |-8.000000e+00 | 45.45%
0.30/0.37 c 0.3s| 1 | 0 | 383 | - |1842k| 0 | 46 | 50 | 303 | 50 | 145 | 81 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.30/0.39 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.30/0.39 c 0.3s| 1 | 0 | 403 | - |2065k| 0 | 47 | 50 | 303 | 50 | 152 | 88 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.39/0.41 c 0.4s| 1 | 0 | 428 | - |2146k| 0 | 48 | 50 | 303 | 50 | 156 | 92 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.39/0.43 c 0.4s| 1 | 0 | 451 | - |2250k| 0 | 49 | 50 | 303 | 50 | 165 | 101 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.39/0.45 c 0.4s| 1 | 0 | 473 | - |2383k| 0 | 46 | 50 | 303 | 50 | 170 | 106 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.39/0.47 c 0.4s| 1 | 0 | 495 | - |2499k| 0 | 47 | 50 | 303 | 50 | 178 | 114 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.59/0.60 c 0.5s| 1 | 2 | 495 | - |2500k| 0 | 47 | 50 | 303 | 50 | 178 | 114 | 0 | 25 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.59/0.60 o -9
0.59/0.60 c * 0.5s| 9 | 7 | 495 | 0.0 |2505k| 8 | - | 50 | 303 | 0 | 0 | 114 | 0 | 25 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.59/0.60 o -10
0.59/0.60 c * 0.5s| 26 | 6 | 495 | 0.0 |2506k| 9 | - | 50 | 304 | 0 | 0 | 114 | 4 | 25 |-1.400000e+01 |-1.000000e+01 | 28.57%
0.59/0.62 o -11
0.59/0.62 c * 0.6s| 293 | 7 | 495 | 0.0 |2507k| 16 | - | 50 | 303 | 0 | 0 | 114 | 6 | 25 |-1.400000e+01 |-1.100000e+01 | 21.43%
0.69/0.77 o -12
0.69/0.77 c * 0.7s| 1985 | 4 | 495 | 0.0 |2523k| 27 | - | 50 | 359 | 0 | 0 | 114 | 142 | 25 |-1.400000e+01 |-1.200000e+01 | 14.29%
0.79/0.87 o -13
0.79/0.87 c * 0.8s| 2732 | 3 | 495 | 0.0 |2532k| 27 | - | 50 | 381 | 0 | 0 | 114 | 575 | 25 |-1.400000e+01 |-1.300000e+01 | 7.14%
1.39/1.40 c
1.39/1.40 c SCIP Status : problem is solved [optimal solution found]
1.39/1.40 c Solving Time (sec) : 1.20
1.39/1.40 c Solving Nodes : 6748
1.39/1.40 c Primal Bound : -1.30000000000000e+01 (13 solutions)
1.39/1.40 c Dual Bound : -1.30000000000000e+01
1.39/1.40 c Gap : 0.00 %
1.39/1.40 s OPTIMUM FOUND
1.39/1.40 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 -x23
1.39/1.40 v -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.39/1.40 c SCIP Status : problem is solved [optimal solution found]
1.39/1.40 c Solving Time : 1.20
1.39/1.40 c Original Problem :
1.39/1.40 c Problem name : HOME/instance-2665225-1276658762.opb
1.39/1.40 c Variables : 353 (353 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.40 c Constraints : 353 initial, 353 maximal
1.39/1.40 c Presolved Problem :
1.39/1.40 c Problem name : t_HOME/instance-2665225-1276658762.opb
1.39/1.40 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.40 c Constraints : 303 initial, 486 maximal
1.39/1.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.39/1.40 c trivial : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c implics : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c probing : 0.01 0 0 0 0 0 0 0 0
1.39/1.40 c linear : 0.01 303 0 0 303 0 50 0 0
1.39/1.40 c logicor : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c root node : - 50 - - 50 - - - -
1.39/1.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.39/1.40 c integral : 0 0 0 1 0 0 0 0 0 2
1.39/1.40 c logicor : 303+ 16 9384 0 5 1906 17986 0 0 0
1.39/1.40 c countsols : 0 0 0 0 5 0 0 0 0 0
1.39/1.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.39/1.40 c integral : 0.11 0.00 0.00 0.11 0.00
1.39/1.40 c logicor : 0.08 0.00 0.08 0.00 0.00
1.39/1.40 c countsols : 0.00 0.00 0.00 0.00 0.00
1.39/1.40 c Propagators : Time Calls Cutoffs DomReds
1.39/1.40 c vbounds : 0.00 2 0 0
1.39/1.40 c rootredcost : 0.00 5 0 0
1.39/1.40 c pseudoobj : 0.19 22831 1898 18699
1.39/1.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.39/1.40 c propagation : 0.08 3804 2939 2939 3.7 0 0.0 -
1.39/1.40 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.39/1.40 c applied globally : - - - 2939 3.7 - - -
1.39/1.41 c applied locally : - - - 0 0.0 - - -
1.39/1.41 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.39/1.41 c cut pool : 0.00 15 - - 176 - (maximal pool size: 946)
1.39/1.41 c redcost : 0.00 16 0 0 0 0
1.39/1.41 c impliedbounds : 0.00 16 0 0 0 0
1.39/1.41 c intobj : 0.00 0 0 0 0 0
1.39/1.41 c cgmip : 0.00 0 0 0 0 0
1.39/1.41 c gomory : 0.14 16 0 0 2784 0
1.39/1.41 c strongcg : 0.11 16 0 0 3020 0
1.39/1.41 c cmir : 0.03 10 0 0 0 0
1.39/1.41 c flowcover : 0.05 10 0 0 0 0
1.39/1.41 c clique : 0.00 16 0 0 116 0
1.39/1.41 c zerohalf : 0.00 0 0 0 0 0
1.39/1.41 c mcf : 0.00 1 0 0 0 0
1.39/1.41 c rapidlearning : 0.00 0 0 0 0 0
1.39/1.41 c Pricers : Time Calls Vars
1.39/1.41 c problem variables: 0.00 0 0
1.39/1.41 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.39/1.41 c relpscost : 0.11 1 0 0 0 0 2
1.39/1.41 c pscost : 0.00 0 0 0 0 0 0
1.39/1.41 c inference : 0.06 3855 0 0 0 0 7710
1.39/1.41 c mostinf : 0.00 0 0 0 0 0 0
1.39/1.41 c leastinf : 0.00 0 0 0 0 0 0
1.39/1.41 c fullstrong : 0.00 0 0 0 0 0 0
1.39/1.41 c allfullstrong : 0.00 0 0 0 0 0 0
1.39/1.41 c random : 0.00 0 0 0 0 0 0
1.39/1.41 c Primal Heuristics : Time Calls Found
1.39/1.41 c LP solutions : 0.00 - 0
1.39/1.41 c pseudo solutions : 0.00 - 5
1.39/1.41 c crossover : 0.00 0 0
1.39/1.41 c oneopt : 0.02 2 1
1.39/1.41 c trivial : 0.00 2 2
1.39/1.41 c simplerounding : 0.00 17 0
1.39/1.41 c zirounding : 0.00 1 1
1.39/1.41 c rounding : 0.00 17 1
1.39/1.41 c shifting : 0.01 17 3
1.39/1.41 c intshifting : 0.00 0 0
1.39/1.41 c twoopt : 0.00 0 0
1.39/1.41 c fixandinfer : 0.00 0 0
1.39/1.41 c feaspump : 0.00 0 0
1.39/1.41 c coefdiving : 0.00 0 0
1.39/1.41 c pscostdiving : 0.00 0 0
1.39/1.41 c fracdiving : 0.00 0 0
1.39/1.41 c veclendiving : 0.00 0 0
1.39/1.41 c intdiving : 0.00 0 0
1.39/1.41 c actconsdiving : 0.00 0 0
1.39/1.41 c objpscostdiving : 0.00 0 0
1.39/1.41 c rootsoldiving : 0.00 0 0
1.39/1.41 c linesearchdiving : 0.00 0 0
1.39/1.41 c guideddiving : 0.00 0 0
1.39/1.41 c octane : 0.00 0 0
1.39/1.41 c rens : 0.00 0 0
1.39/1.41 c rins : 0.00 0 0
1.39/1.41 c localbranching : 0.00 0 0
1.39/1.41 c mutation : 0.00 0 0
1.39/1.41 c dins : 0.00 0 0
1.39/1.41 c undercover : 0.00 0 0
1.39/1.41 c nlp : 0.00 0 0
1.39/1.41 c trysol : 0.00 0 0
1.39/1.41 c LP : Time Calls Iterations Iter/call Iter/sec
1.39/1.41 c primal LP : 0.00 0 0 0.00 -
1.39/1.41 c dual LP : 0.04 17 495 29.12 12375.00
1.39/1.41 c lex dual LP : 0.00 0 0 0.00 -
1.39/1.41 c barrier LP : 0.00 0 0 0.00 -
1.39/1.41 c diving/probing LP: 0.00 0 0 0.00 -
1.39/1.41 c strong branching : 0.11 25 1963 78.52 17845.45
1.39/1.41 c (at root node) : - 25 1963 78.52 -
1.39/1.41 c conflict analysis: 0.00 0 0 0.00 -
1.39/1.41 c B&B Tree :
1.39/1.41 c number of runs : 1
1.39/1.41 c nodes : 6748
1.39/1.41 c nodes (total) : 6748
1.39/1.41 c nodes left : 0
1.39/1.41 c max depth : 36
1.39/1.41 c max depth (total): 36
1.39/1.41 c backtracks : 1203 (17.8%)
1.39/1.41 c delayed cutoffs : 959
1.39/1.41 c repropagations : 9307 (12525 domain reductions, 917 cutoffs)
1.39/1.41 c avg switch length: 3.89
1.39/1.41 c switching time : 0.14
1.39/1.41 c Solution :
1.39/1.41 c Solutions found : 13 (9 improvements)
1.39/1.41 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.39/1.41 c Primal Bound : -1.30000000000000e+01 (in run 1, after 2732 nodes, 0.76 seconds, depth 18, found by <relaxation>)
1.39/1.41 c Dual Bound : -1.30000000000000e+01
1.39/1.41 c Gap : 0.00 %
1.39/1.41 c Root Dual Bound : -1.40000000000000e+01
1.39/1.41 c Root Iterations : 495
1.39/1.41 c Time complete: 1.4.