0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703224-1278568193.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.01/0.02 o 0
0.01/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.01/0.02 c presolving:
0.01/0.04 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.01/0.04 c presolving (2 rounds):
0.01/0.04 c 303 deleted vars, 50 deleted constraints, 303 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 1818 implications, 0 cliques
0.01/0.04 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 303 constraints
0.01/0.04 c 303 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.03
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.3
0.01/0.04 c
0.01/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c conflict/interconss = 0
0.01/0.04 c
0.01/0.04 c # should binary conflicts be preferred?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c conflict/preferbinary = TRUE
0.01/0.04 c
0.01/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c constraints/agelimit = 1
0.01/0.04 c
0.01/0.04 c # should enforcement of pseudo solution be disabled?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/disableenfops = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1790
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c lp/solvefreq = 0
0.01/0.04 c
0.01/0.04 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.04 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.04 c lp/pricing = a
0.01/0.04 c
0.01/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.04 c # [type: int, range: [1,2], default: 1]
0.01/0.04 c timing/clocktype = 2
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/indicator/addCouplingCons = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # priority of node selection rule <dfs> in standard mode
0.01/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.04 c nodeselection/dfs/stdpriority = 1000000
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/0.05 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.05 c t 0.0s| 1 | 0 | 53 | - |1061k| 0 | 50 | 50 | 303 | 50 | 303 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.01/0.05 o -1
0.01/0.05 c R 0.0s| 1 | 0 | 53 | - |1062k| 0 | 50 | 50 | 303 | 50 | 303 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.01/0.05 o -2
0.01/0.05 c s 0.0s| 1 | 0 | 53 | - |1063k| 0 | 50 | 50 | 303 | 50 | 303 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.01/0.06 c 0.0s| 1 | 0 | 68 | - |1066k| 0 | 47 | 50 | 303 | 50 | 308 | 5 | 0 | 0 |-2.350000e+01 |-2.000000e+00 | 91.49%
0.01/0.06 o -8
0.01/0.06 c b 0.0s| 1 | 0 | 68 | - |1068k| 0 | 47 | 50 | 303 | 50 | 308 | 5 | 0 | 0 |-2.350000e+01 |-8.000000e+00 | 65.96%
0.01/0.07 c 0.1s| 1 | 0 | 100 | - |1073k| 0 | 42 | 50 | 303 | 50 | 315 | 12 | 0 | 0 |-2.100000e+01 |-8.000000e+00 | 61.90%
0.01/0.09 c 0.1s| 1 | 0 | 127 | - |1078k| 0 | 39 | 50 | 303 | 50 | 320 | 17 | 0 | 0 |-1.950000e+01 |-8.000000e+00 | 58.97%
0.09/0.10 c 0.1s| 1 | 0 | 160 | - |1083k| 0 | 37 | 50 | 303 | 50 | 326 | 23 | 0 | 0 |-1.850000e+01 |-8.000000e+00 | 56.76%
0.09/0.12 c 0.1s| 1 | 0 | 182 | - |1086k| 0 | 40 | 50 | 303 | 50 | 333 | 30 | 0 | 0 |-1.725000e+01 |-8.000000e+00 | 53.62%
0.09/0.14 c 0.1s| 1 | 0 | 222 | - |1096k| 0 | 39 | 50 | 303 | 50 | 341 | 38 | 0 | 0 |-1.650000e+01 |-8.000000e+00 | 51.52%
0.09/0.18 c 0.2s| 1 | 0 | 271 | - |1110k| 0 | 45 | 50 | 303 | 50 | 349 | 46 | 0 | 0 |-1.612500e+01 |-8.000000e+00 | 50.39%
0.19/0.22 c 0.2s| 1 | 0 | 316 | - |1274k| 0 | 46 | 50 | 303 | 50 | 358 | 55 | 0 | 0 |-1.554321e+01 |-8.000000e+00 | 48.53%
0.19/0.26 c 0.3s| 1 | 0 | 362 | - |1403k| 0 | 45 | 50 | 303 | 50 | 369 | 66 | 0 | 0 |-1.519861e+01 |-8.000000e+00 | 47.36%
0.29/0.32 c 0.3s| 1 | 0 | 401 | - |1731k| 0 | 44 | 50 | 303 | 50 | 378 | 75 | 0 | 0 |-1.489620e+01 |-8.000000e+00 | 46.30%
0.29/0.38 c 0.4s| 1 | 0 | 494 | - |1788k| 0 | 46 | 50 | 303 | 50 | 149 | 84 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.29/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.29/0.39 c 0.4s| 1 | 0 | 512 | - |1873k| 0 | 45 | 50 | 303 | 50 | 155 | 90 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.39/0.41 c 0.4s| 1 | 0 | 526 | - |2003k| 0 | 47 | 50 | 303 | 50 | 161 | 96 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.39/0.43 c 0.4s| 1 | 0 | 544 | - |2090k| 0 | 48 | 50 | 303 | 50 | 168 | 103 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.39/0.45 c 0.4s| 1 | 0 | 553 | - |2123k| 0 | 48 | 50 | 303 | 50 | 174 | 109 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.39/0.47 c 0.5s| 1 | 0 | 560 | - |2168k| 0 | 47 | 50 | 303 | 50 | 177 | 112 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.59/0.61 c 0.6s| 1 | 2 | 560 | - |2169k| 0 | 47 | 50 | 303 | 50 | 177 | 112 | 0 | 20 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.59/0.61 o -9
0.59/0.61 c * 0.6s| 9 | 6 | 560 | 0.0 |2174k| 7 | - | 50 | 303 | 0 | 0 | 112 | 0 | 20 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.59/0.61 o -10
0.59/0.61 c * 0.6s| 45 | 5 | 560 | 0.0 |2175k| 9 | - | 50 | 303 | 0 | 0 | 112 | 0 | 20 |-1.400000e+01 |-1.000000e+01 | 28.57%
0.59/0.61 o -11
0.59/0.61 c * 0.6s| 101 | 4 | 560 | 0.0 |2175k| 10 | - | 50 | 303 | 0 | 0 | 112 | 0 | 20 |-1.400000e+01 |-1.100000e+01 | 21.43%
0.59/0.61 o -12
0.59/0.61 c * 0.6s| 111 | 5 | 560 | 0.0 |2176k| 10 | - | 50 | 303 | 0 | 0 | 112 | 0 | 20 |-1.400000e+01 |-1.200000e+01 | 14.29%
0.79/0.89 o -13
0.79/0.89 c * 0.9s| 3442 | 4 | 560 | 0.0 |2178k| 27 | - | 50 | 291 | 0 | 0 | 112 |1183 | 20 |-1.400000e+01 |-1.300000e+01 | 7.14%
1.10/1.17 c
1.10/1.17 c SCIP Status : problem is solved [optimal solution found]
1.10/1.17 c Solving Time (sec) : 1.15
1.10/1.17 c Solving Nodes : 6409
1.10/1.17 c Primal Bound : -1.30000000000000e+01 (14 solutions)
1.10/1.17 c Dual Bound : -1.30000000000000e+01
1.10/1.17 c Gap : 0.00 %
1.10/1.17 s OPTIMUM FOUND
1.10/1.17 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.10/1.17 v -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.10/1.17 c SCIP Status : problem is solved [optimal solution found]
1.10/1.17 c Solving Time : 1.15
1.10/1.17 c Original Problem :
1.10/1.17 c Problem name : HOME/instance-2703224-1278568193.opb
1.10/1.17 c Variables : 353 (353 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.17 c Constraints : 353 initial, 353 maximal
1.10/1.17 c Presolved Problem :
1.10/1.17 c Problem name : t_HOME/instance-2703224-1278568193.opb
1.10/1.17 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.17 c Constraints : 303 initial, 493 maximal
1.10/1.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.10/1.17 c trivial : 0.00 0 0 0 0 0 0 0 0
1.10/1.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.10/1.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.10/1.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.10/1.17 c implics : 0.00 0 0 0 0 0 0 0 0
1.10/1.17 c probing : 0.00 0 0 0 0 0 0 0 0
1.10/1.17 c linear : 0.00 303 0 0 303 0 50 0 0
1.10/1.17 c logicor : 0.00 0 0 0 0 0 0 0 0
1.10/1.17 c root node : - 50 - - 50 - - - -
1.10/1.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.10/1.17 c integral : 0 0 0 1 0 0 0 0 0 2
1.10/1.17 c logicor : 303+ 16 9135 0 5 1934 16922 0 0 0
1.10/1.17 c countsols : 0 0 0 0 5 0 0 0 0 0
1.10/1.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.10/1.17 c integral : 0.13 0.00 0.00 0.13 0.00
1.10/1.17 c logicor : 0.10 0.00 0.10 0.00 0.00
1.10/1.17 c countsols : 0.00 0.00 0.00 0.00 0.00
1.10/1.17 c Propagators : Time Calls Cutoffs DomReds
1.10/1.17 c vbounds : 0.01 2 0 0
1.10/1.17 c rootredcost : 0.01 5 0 0
1.10/1.17 c pseudoobj : 0.15 22088 1703 19174
1.10/1.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.10/1.17 c propagation : 0.06 3637 2913 2913 3.6 0 0.0 -
1.10/1.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.17 c applied globally : - - - 2913 3.6 - - -
1.10/1.17 c applied locally : - - - 0 0.0 - - -
1.10/1.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.10/1.17 c cut pool : 0.01 15 - - 115 - (maximal pool size: 804)
1.10/1.17 c redcost : 0.00 16 0 0 0 0
1.10/1.17 c impliedbounds : 0.00 16 0 0 0 0
1.10/1.17 c intobj : 0.00 0 0 0 0 0
1.10/1.17 c cgmip : 0.00 0 0 0 0 0
1.10/1.17 c gomory : 0.16 16 0 0 2383 0
1.10/1.17 c strongcg : 0.13 16 0 0 2587 0
1.10/1.17 c cmir : 0.02 10 0 0 0 0
1.10/1.17 c flowcover : 0.02 10 0 0 0 0
1.10/1.17 c clique : 0.01 16 0 0 112 0
1.10/1.17 c zerohalf : 0.00 0 0 0 0 0
1.10/1.17 c mcf : 0.00 1 0 0 0 0
1.10/1.17 c rapidlearning : 0.00 0 0 0 0 0
1.10/1.17 c Pricers : Time Calls Vars
1.10/1.17 c problem variables: 0.00 0 0
1.10/1.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.10/1.17 c relpscost : 0.13 1 0 0 0 0 2
1.10/1.17 c pscost : 0.00 0 0 0 0 0 0
1.10/1.17 c inference : 0.03 3731 0 0 0 0 7462
1.10/1.17 c mostinf : 0.00 0 0 0 0 0 0
1.10/1.17 c leastinf : 0.00 0 0 0 0 0 0
1.10/1.17 c fullstrong : 0.00 0 0 0 0 0 0
1.10/1.17 c allfullstrong : 0.00 0 0 0 0 0 0
1.10/1.17 c random : 0.00 0 0 0 0 0 0
1.10/1.17 c Primal Heuristics : Time Calls Found
1.10/1.17 c LP solutions : 0.00 - 0
1.10/1.17 c pseudo solutions : 0.00 - 5
1.10/1.17 c crossover : 0.00 0 0
1.10/1.17 c oneopt : 0.00 2 1
1.10/1.17 c trivial : 0.00 2 2
1.10/1.17 c simplerounding : 0.00 17 0
1.10/1.17 c zirounding : 0.00 1 1
1.10/1.17 c rounding : 0.00 17 1
1.10/1.17 c shifting : 0.01 17 4
1.10/1.17 c intshifting : 0.00 0 0
1.10/1.17 c twoopt : 0.00 0 0
1.10/1.17 c fixandinfer : 0.00 0 0
1.10/1.17 c feaspump : 0.00 0 0
1.10/1.17 c coefdiving : 0.00 0 0
1.10/1.17 c pscostdiving : 0.00 0 0
1.10/1.17 c fracdiving : 0.00 0 0
1.10/1.17 c veclendiving : 0.00 0 0
1.10/1.17 c intdiving : 0.00 0 0
1.10/1.17 c actconsdiving : 0.00 0 0
1.10/1.17 c objpscostdiving : 0.00 0 0
1.10/1.17 c rootsoldiving : 0.00 0 0
1.10/1.17 c linesearchdiving : 0.00 0 0
1.10/1.17 c guideddiving : 0.00 0 0
1.10/1.17 c octane : 0.00 0 0
1.10/1.17 c rens : 0.01 0 0
1.10/1.17 c rins : 0.00 0 0
1.10/1.17 c localbranching : 0.00 0 0
1.10/1.17 c mutation : 0.00 0 0
1.10/1.17 c dins : 0.00 0 0
1.10/1.17 c undercover : 0.00 0 0
1.10/1.17 c nlp : 0.00 0 0
1.10/1.17 c trysol : 0.00 0 0
1.10/1.17 c LP : Time Calls Iterations Iter/call Iter/sec
1.10/1.17 c primal LP : 0.00 0 0 0.00 -
1.10/1.17 c dual LP : 0.05 17 560 32.94 10769.23
1.10/1.17 c lex dual LP : 0.00 0 0 0.00 -
1.10/1.17 c barrier LP : 0.00 0 0 0.00 -
1.10/1.17 c diving/probing LP: 0.00 0 0 0.00 -
1.10/1.17 c strong branching : 0.13 20 1568 78.40 11969.56
1.10/1.17 c (at root node) : - 20 1568 78.40 -
1.10/1.17 c conflict analysis: 0.00 0 0 0.00 -
1.10/1.17 c B&B Tree :
1.10/1.17 c number of runs : 1
1.10/1.17 c nodes : 6409
1.10/1.17 c nodes (total) : 6409
1.10/1.17 c nodes left : 0
1.10/1.17 c max depth : 37
1.10/1.17 c max depth (total): 37
1.10/1.17 c backtracks : 1206 (18.8%)
1.10/1.17 c delayed cutoffs : 1052
1.10/1.17 c repropagations : 9082 (12789 domain reductions, 965 cutoffs)
1.10/1.17 c avg switch length: 3.93
1.10/1.17 c switching time : 0.09
1.10/1.17 c Solution :
1.10/1.17 c Solutions found : 14 (9 improvements)
1.10/1.17 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.10/1.17 c Primal Bound : -1.30000000000000e+01 (in run 1, after 3442 nodes, 0.87 seconds, depth 14, found by <relaxation>)
1.10/1.17 c Dual Bound : -1.30000000000000e+01
1.10/1.17 c Gap : 0.00 %
1.10/1.17 c Root Dual Bound : -1.40000000000000e+01
1.10/1.17 c Root Iterations : 560
1.10/1.18 c Time complete: 1.17.