0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3447900-1307902121.wbo>
0.00/0.00 c original problem has 552 variables (552 bin, 0 int, 0 impl, 0 cont) and 461 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 874 del vars, 438 del conss, 0 add conss, 437 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 23 clqs
0.00/0.01 c (round 2) 886 del vars, 472 del conss, 0 add conss, 449 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 796 impls, 22 clqs
0.00/0.01 c (round 3) 891 del vars, 516 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 796 impls, 22 clqs
0.00/0.01 c (round 4) 891 del vars, 533 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 796 impls, 22 clqs
0.00/0.02 c (round 5) 891 del vars, 537 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 796 impls, 22 clqs
0.01/0.02 c (round 6) 944 del vars, 537 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 1657 impls, 12 clqs
0.01/0.02 c (round 7) 949 del vars, 763 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 1738 impls, 11 clqs
0.01/0.02 c (round 8) 949 del vars, 770 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 1738 impls, 11 clqs
0.01/0.02 c (round 9) 949 del vars, 779 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 1738 impls, 11 clqs
0.01/0.03 c (round 10) 968 del vars, 779 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 1842 impls, 7 clqs
0.01/0.03 c (round 11) 976 del vars, 851 del conss, 0 add conss, 462 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 1842 impls, 2 clqs
0.01/0.03 c (round 12) 987 del vars, 894 del conss, 0 add conss, 467 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 1882 impls, 0 clqs
0.01/0.03 c presolving (13 rounds):
0.01/0.03 c 989 deleted vars, 898 deleted constraints, 0 added constraints, 467 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 1882 implications, 0 cliques
0.01/0.03 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.02
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 2.0.1.4
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 = 1800
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 = 13950
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.03 c # [type: int, range: [1,2], default: 1]
0.01/0.03 c timing/clocktype = 2
0.01/0.03 c
0.01/0.03 c # belongs reading time to solving time?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c timing/reading = TRUE
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/indicator/addCouplingCons = 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 o 0
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 * 0.0s| 1 | 0 | 0 | - |1966k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.01/0.03 c 0.0s| 1 | 0 | 0 | - |1966k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.01/0.03 c
0.01/0.03 c SCIP Status : problem is solved [optimal solution found]
0.01/0.03 c Solving Time (sec) : 0.03
0.01/0.03 c Solving Nodes : 1
0.01/0.03 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.01/0.03 c Dual Bound : +0.00000000000000e+00
0.01/0.03 c Gap : 0.00 %
0.01/0.03 s OPTIMUM FOUND
0.01/0.03 v -x115 -x114 -x113 -x112 x111 x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 -x102 -x101 -x100 -x99 -x98 x97 -x96 x95 -x94 -x93 -x92
0.01/0.03 v -x91 -x90 -x89 -x88 x87 -x86 -x85 -x84 x83 -x82 -x81 -x80 x79 -x78 -x77 -x76 x75 -x74 -x73 -x72 -x71 -x70 x69 -x68 -x67 -x66
0.01/0.03 v -x65 -x64 -x63 -x62 x61 -x60 -x59 -x58 x57 -x56 -x55 -x54 x53 -x52 -x51 x50 -x49 -x48 -x47 -x46 -x45 x44 -x43 -x42 -x41 -x40
0.01/0.03 v -x39 -x38 x37 -x36 -x35 -x34 -x33 -x32 x31 -x30 -x29 x28 -x27 -x26 -x25 x24 -x23 -x22 -x21 -x20 -x19 -x18 x17 -x16 -x15 -x14
0.01/0.03 v -x13 -x12 x11 -x10 -x9 x8 -x7 -x6 x5 -x4 -x3 -x2 -x1
0.01/0.03 c SCIP Status : problem is solved [optimal solution found]
0.01/0.03 c Total Time : 0.03
0.01/0.03 c solving : 0.03
0.01/0.03 c presolving : 0.02 (included in solving)
0.01/0.03 c reading : 0.00 (included in solving)
0.01/0.03 c Original Problem :
0.01/0.03 c Problem name : HOME/instance-3447900-1307902121.wbo
0.01/0.03 c Variables : 552 (552 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.03 c Constraints : 461 initial, 461 maximal
0.01/0.03 c Presolved Problem :
0.01/0.03 c Problem name : t_HOME/instance-3447900-1307902121.wbo
0.01/0.03 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.03 c Constraints : 0 initial, 0 maximal
0.01/0.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.01/0.03 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.01/0.03 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.01/0.03 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.01/0.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.01/0.03 c implics : 0.00 0 2 0 0 0 0 0 0 0
0.01/0.03 c probing : 0.01 49 23 0 0 0 0 0 0 0
0.01/0.03 c setppc : 0.00 5 3 0 0 0 22 0 0 0
0.01/0.03 c linear : 0.01 470 0 0 467 0 439 0 0 0
0.01/0.03 c indicator : 0.00 437 0 0 0 0 437 0 0 0
0.01/0.03 c root node : - 0 - - 0 - - - - -
0.01/0.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.01/0.03 c integral : 0 0 0 0 0 3 0 0 0 0 0 0
0.01/0.03 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.01/0.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.01/0.03 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.01/0.03 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.01/0.03 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.01/0.03 c vbounds : 0 0 0 0
0.01/0.03 c rootredcost : 0 0 0 0
0.01/0.03 c pseudoobj : 0 0 0 0
0.01/0.03 c Propagator Timings : TotalTime Propagate Resprop
0.01/0.03 c vbounds : 0.00 0.00 0.00
0.01/0.03 c rootredcost : 0.00 0.00 0.00
0.01/0.03 c pseudoobj : 0.00 0.00 0.00
0.01/0.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.01/0.03 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.03 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.03 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.01/0.03 c applied globally : - - - 0 0.0 - - -
0.01/0.03 c applied locally : - - - 0 0.0 - - -
0.01/0.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.01/0.03 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.01/0.03 c redcost : 0.00 0 0 0 0 0
0.01/0.03 c impliedbounds : 0.00 0 0 0 0 0
0.01/0.03 c intobj : 0.00 0 0 0 0 0
0.01/0.03 c gomory : 0.00 0 0 0 0 0
0.01/0.03 c cgmip : 0.00 0 0 0 0 0
0.01/0.03 c closecuts : 0.00 0 0 0 0 0
0.01/0.03 c strongcg : 0.00 0 0 0 0 0
0.01/0.03 c cmir : 0.00 0 0 0 0 0
0.01/0.03 c flowcover : 0.00 0 0 0 0 0
0.01/0.03 c clique : 0.00 0 0 0 0 0
0.01/0.03 c zerohalf : 0.00 0 0 0 0 0
0.01/0.03 c mcf : 0.00 0 0 0 0 0
0.01/0.03 c oddcycle : 0.00 0 0 0 0 0
0.01/0.03 c rapidlearning : 0.00 0 0 0 0 0
0.01/0.03 c Pricers : Time Calls Vars
0.01/0.03 c problem variables: 0.00 0 0
0.01/0.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.01/0.03 c pscost : 0.00 0 0 0 0 0 0
0.01/0.03 c inference : 0.00 0 0 0 0 0 0
0.01/0.03 c mostinf : 0.00 0 0 0 0 0 0
0.01/0.03 c leastinf : 0.00 0 0 0 0 0 0
0.01/0.03 c fullstrong : 0.00 0 0 0 0 0 0
0.01/0.03 c allfullstrong : 0.00 0 0 0 0 0 0
0.01/0.03 c random : 0.00 0 0 0 0 0 0
0.01/0.03 c relpscost : 0.00 0 0 0 0 0 0
0.01/0.03 c Primal Heuristics : Time Calls Found
0.01/0.03 c LP solutions : 0.00 - 0
0.01/0.03 c pseudo solutions : 0.00 - 0
0.01/0.03 c oneopt : 0.00 0 0
0.01/0.03 c trivial : 0.00 1 0
0.01/0.03 c shiftandpropagate: 0.00 0 0
0.01/0.03 c simplerounding : 0.00 0 0
0.01/0.03 c zirounding : 0.00 0 0
0.01/0.03 c rounding : 0.00 0 0
0.01/0.03 c shifting : 0.00 0 0
0.01/0.03 c intshifting : 0.00 0 0
0.01/0.03 c twoopt : 0.00 0 0
0.01/0.03 c fixandinfer : 0.00 0 0
0.01/0.03 c feaspump : 0.00 0 0
0.01/0.03 c clique : 0.00 0 0
0.01/0.03 c coefdiving : 0.00 0 0
0.01/0.03 c pscostdiving : 0.00 0 0
0.01/0.03 c fracdiving : 0.00 0 0
0.01/0.03 c veclendiving : 0.00 0 0
0.01/0.03 c intdiving : 0.00 0 0
0.01/0.03 c actconsdiving : 0.00 0 0
0.01/0.03 c objpscostdiving : 0.00 0 0
0.01/0.03 c rootsoldiving : 0.00 0 0
0.01/0.03 c linesearchdiving : 0.00 0 0
0.01/0.03 c guideddiving : 0.00 0 0
0.01/0.03 c octane : 0.00 0 0
0.01/0.03 c rens : 0.00 0 0
0.01/0.03 c rins : 0.00 0 0
0.01/0.03 c localbranching : 0.00 0 0
0.01/0.03 c mutation : 0.00 0 0
0.01/0.03 c crossover : 0.00 0 0
0.01/0.03 c dins : 0.00 0 0
0.01/0.03 c vbounds : 0.00 0 0
0.01/0.03 c undercover : 0.00 0 0
0.01/0.03 c subnlp : 0.00 0 0
0.01/0.03 c trysol : 0.00 0 0
0.01/0.03 c LP : Time Calls Iterations Iter/call Iter/sec
0.01/0.03 c primal LP : 0.00 0 0 0.00 -
0.01/0.03 c dual LP : 0.00 0 0 0.00 -
0.01/0.03 c lex dual LP : 0.00 0 0 0.00 -
0.01/0.03 c barrier LP : 0.00 0 0 0.00 -
0.01/0.03 c diving/probing LP: 0.00 0 0 0.00 -
0.01/0.03 c strong branching : 0.00 0 0 0.00 -
0.01/0.03 c (at root node) : - 0 0 0.00 -
0.01/0.03 c conflict analysis: 0.00 0 0 0.00 -
0.01/0.03 c B&B Tree :
0.01/0.03 c number of runs : 1
0.01/0.03 c nodes : 1
0.01/0.03 c nodes (total) : 1
0.01/0.03 c nodes left : 0
0.01/0.03 c max depth : 0
0.01/0.03 c max depth (total): 0
0.01/0.03 c backtracks : 0 (0.0%)
0.01/0.03 c delayed cutoffs : 0
0.01/0.03 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.01/0.03 c avg switch length: 2.00
0.01/0.03 c switching time : 0.00
0.01/0.03 c Solution :
0.01/0.03 c Solutions found : 1 (1 improvements)
0.01/0.03 c First Solution : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <relaxation>)
0.01/0.03 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <relaxation>)
0.01/0.03 c Dual Bound : +0.00000000000000e+00
0.01/0.03 c Gap : 0.00 %
0.01/0.03 c Root Dual Bound : +0.00000000000000e+00
0.01/0.03 c Root Iterations : 0
0.01/0.03 c Time complete: 0.02.