0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3693425-1338033172.opb>
0.00/0.00 c original problem has 99 variables (99 bin, 0 int, 0 impl, 0 cont) and 244 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 3 del vars, 0 del conss, 0 add conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 336 impls, 0 clqs
0.00/0.01 c (round 2) 23 del vars, 24 del conss, 0 add conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 685 impls, 0 clqs
0.00/0.01 c (round 3) 40 del vars, 71 del conss, 0 add conss, 8 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 981 impls, 0 clqs
0.00/0.01 c (round 4) 40 del vars, 102 del conss, 0 add conss, 8 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 981 impls, 0 clqs
0.00/0.01 c (round 5) 40 del vars, 102 del conss, 0 add conss, 8 chg bounds, 1 chg sides, 1 chg coeffs, 141 upgd conss, 981 impls, 0 clqs
0.00/0.02 c (0.0s) probing cycle finished: starting next cycle
0.00/0.02 c (round 6) 49 del vars, 243 del conss, 47 add conss, 8 chg bounds, 1 chg sides, 1 chg coeffs, 141 upgd conss, 1063 impls, 0 clqs
0.00/0.02 c (round 7) 55 del vars, 255 del conss, 47 add conss, 8 chg bounds, 1 chg sides, 13 chg coeffs, 141 upgd conss, 1063 impls, 0 clqs
0.00/0.02 c (0.0s) probing cycle finished: starting next cycle
0.00/0.02 c (round 8) 57 del vars, 255 del conss, 47 add conss, 8 chg bounds, 1 chg sides, 13 chg coeffs, 141 upgd conss, 1135 impls, 0 clqs
0.00/0.02 c (round 9) 57 del vars, 256 del conss, 48 add conss, 8 chg bounds, 1 chg sides, 13 chg coeffs, 141 upgd conss, 1135 impls, 0 clqs
0.00/0.03 c (0.0s) probing cycle finished: starting next cycle
0.00/0.03 c presolving (10 rounds):
0.00/0.03 c 57 deleted vars, 256 deleted constraints, 48 added constraints, 8 tightened bounds, 0 added holes, 1 changed sides, 13 changed coefficients
0.00/0.03 c 1183 implications, 0 cliques
0.00/0.03 c presolved problem has 42 variables (42 bin, 0 int, 0 impl, 0 cont) and 34 constraints
0.00/0.03 c 1 constraints of type <setppc>
0.00/0.03 c 32 constraints of type <and>
0.00/0.03 c 1 constraints of type <linear>
0.00/0.03 c transformed objective value is always integral (scale: 2)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 2.1.1.4
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1797
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # belongs reading time to solving time?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c timing/reading = TRUE
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/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.00/0.03 c 0.0s| 1 | 0 | 38 | - | 552k| 0 | 29 | 42 | 43 | 42 | 66 | 0 | 9 | 0 | 3.894052e+02 | -- | Inf
0.00/0.05 c 0.1s| 1 | 0 | 115 | - | 612k| 0 | 11 | 42 | 45 | 42 | 108 | 42 | 10 | 0 | 4.022574e+02 | -- | Inf
0.00/0.05 c 0.1s| 1 | 0 | 126 | - | 627k| 0 | 12 | 42 | 45 | 42 | 119 | 53 | 10 | 0 | 4.027719e+02 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 145 | - | 644k| 0 | 17 | 42 | 45 | 42 | 127 | 61 | 10 | 0 | 4.032662e+02 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 154 | - | 654k| 0 | 26 | 42 | 45 | 42 | 130 | 64 | 10 | 0 | 4.043451e+02 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 160 | - | 660k| 0 | 15 | 42 | 45 | 42 | 132 | 66 | 10 | 0 | 4.064269e+02 | -- | Inf
0.00/0.06 o 409
0.00/0.06 c R 0.1s| 1 | 0 | 160 | - | 662k| 0 | 15 | 42 | 45 | 42 | 132 | 66 | 10 | 0 | 4.064269e+02 | 4.090000e+02 | 0.63%
0.00/0.07 c 0.1s| 1 | 0 | 171 | - | 670k| 0 | - | 42 | 45 | 42 | 135 | 69 | 10 | 0 | 4.090000e+02 | 4.090000e+02 | 0.00%
0.00/0.07 c 0.1s| 1 | 0 | 171 | - | 670k| 0 | - | 42 | 45 | 42 | 135 | 69 | 10 | 0 | 4.090000e+02 | 4.090000e+02 | 0.00%
0.00/0.07 c
0.00/0.07 c SCIP Status : problem is solved [optimal solution found]
0.00/0.07 c Solving Time (sec) : 0.07
0.00/0.07 c Solving Nodes : 1
0.00/0.07 c Primal Bound : +4.09000000000000e+02 (1 solutions)
0.00/0.07 c Dual Bound : +4.09000000000000e+02
0.00/0.07 c Gap : 0.00 %
0.00/0.07 s OPTIMUM FOUND
0.00/0.07 v x99 x98 x97 x96 x95 -x94 -x93 x92 x91 x90 x89 x88 x87 x86 -x85 -x84 x83 x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71
0.00/0.07 v -x70 -x69 -x68 -x67 -x66 -x65 -x64 x63 x62 x61 x60 x59 -x58 -x57 x56 x55 x54 x53 x52 x51 x50 -x49 -x48 x47 x46 -x45 -x44
0.00/0.07 v -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 x18 x27 x17 x26 x16 x25 x15 x24 x14 x23 -x13
0.00/0.07 v -x22 -x12 -x21 x11 x20 x10 x19 x9 x8 -x7 -x6 x5 x4 -x3 -x2 x1
0.00/0.07 c SCIP Status : problem is solved [optimal solution found]
0.00/0.07 c Total Time : 0.07
0.00/0.07 c solving : 0.07
0.00/0.07 c presolving : 0.02 (included in solving)
0.00/0.07 c reading : 0.00 (included in solving)
0.00/0.07 c copying : 0.00 (1 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.00/0.07 c Original Problem :
0.00/0.07 c Problem name : HOME/instance-3693425-1338033172.opb
0.00/0.07 c Variables : 99 (99 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.07 c Constraints : 244 initial, 244 maximal
0.00/0.07 c Objective sense : minimize
0.00/0.07 c Presolved Problem :
0.00/0.07 c Problem name : t_HOME/instance-3693425-1338033172.opb
0.00/0.07 c Variables : 42 (42 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.07 c Constraints : 34 initial, 45 maximal
0.00/0.07 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.07 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c gateextraction : 0.00 0.00 0 0 0 0 0 141 47 0 0
0.00/0.07 c implics : 0.00 0.00 0 29 0 0 0 0 0 0 0
0.00/0.07 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c probing : 0.01 0.00 4 7 0 0 0 0 0 0 0
0.00/0.07 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c and : 0.00 0.00 0 6 0 0 0 13 1 0 12
0.00/0.07 c linear : 0.01 0.00 9 2 0 8 0 102 0 1 1
0.00/0.07 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c root node : - - 0 - - 0 - - - - -
0.00/0.07 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.07 c integral : 0 0 0 0 0 0 7 0 0 0 0 0 0
0.00/0.07 c setppc : 1 1 6 137 0 0 4 3 1 0 0 0 0
0.00/0.07 c and : 32 32 6 377 0 0 3 76 1 0 35 0 0
0.00/0.07 c linear : 1 1 6 376 0 0 1 9 9 0 6 0 0
0.00/0.07 c logicor : 0+ 11 6 8 0 0 0 3 2 0 1 0 0
0.00/0.07 c countsols : 0 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.07 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.07 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.07 c rootredcost : 0 0 0 0
0.00/0.07 c pseudoobj : 55 0 0 0
0.00/0.07 c vbounds : 0 0 0 0
0.00/0.07 c redcost : 6 0 0 0
0.00/0.07 c probing : 0 0 0 0
0.00/0.07 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.07 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c probing : 0.01 0.00 0.01 0.00 0.00
0.00/0.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.07 c propagation : 0.00 13 10 11 7.5 0 0.0 -
0.00/0.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.07 c applied globally : - - - 10 7.7 - - -
0.00/0.07 c applied locally : - - - 0 0.0 - - -
0.00/0.07 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.07 c cut pool : 0.00 5 - - 20 - (maximal pool size: 105)
0.00/0.07 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.07 c impliedbounds : 0.00 0.00 6 0 0 65 0
0.00/0.07 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.07 c gomory : 0.01 0.00 6 0 0 66 0
0.00/0.07 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.07 c strongcg : 0.00 0.00 6 0 0 129 0
0.00/0.07 c cmir : 0.00 0.00 6 0 0 46 0
0.00/0.07 c flowcover : 0.00 0.00 6 0 0 90 0
0.00/0.07 c clique : 0.00 0.00 6 0 0 5 0
0.00/0.07 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.07 c mcf : 0.00 0.00 1 0 0 0 0
0.00/0.07 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.07 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.07 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.07 c problem variables: 0.00 - 0 0
0.00/0.07 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.07 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.07 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.07 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.07 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.07 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.07 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.07 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.07 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.07 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.07 c LP solutions : 0.00 - - 0
0.00/0.07 c pseudo solutions : 0.00 - - 0
0.00/0.07 c oneopt : 0.00 0.00 0 0
0.00/0.07 c smallcard : 0.00 0.00 0 0
0.00/0.07 c trivial : 0.00 0.00 2 0
0.00/0.07 c shiftandpropagate: 0.00 0.00 1 0
0.00/0.07 c simplerounding : 0.00 0.00 0 0
0.00/0.07 c zirounding : 0.00 0.00 0 0
0.00/0.07 c rounding : 0.00 0.00 6 1
0.00/0.07 c shifting : 0.00 0.00 6 0
0.00/0.07 c intshifting : 0.00 0.00 0 0
0.00/0.07 c twoopt : 0.00 0.00 0 0
0.00/0.07 c indtwoopt : 0.00 0.00 0 0
0.00/0.07 c indoneopt : 0.00 0.00 0 0
0.00/0.07 c fixandinfer : 0.00 0.00 0 0
0.00/0.07 c feaspump : 0.00 0.00 1 0
0.00/0.07 c clique : 0.00 0.00 0 0
0.00/0.07 c indrounding : 0.00 0.00 0 0
0.00/0.07 c indcoefdiving : 0.00 0.00 0 0
0.00/0.07 c coefdiving : 0.00 0.00 0 0
0.00/0.07 c pscostdiving : 0.00 0.00 0 0
0.00/0.07 c nlpdiving : 0.00 0.00 0 0
0.00/0.07 c fracdiving : 0.00 0.00 0 0
0.00/0.07 c veclendiving : 0.00 0.00 0 0
0.00/0.07 c intdiving : 0.00 0.00 0 0
0.00/0.07 c actconsdiving : 0.00 0.00 0 0
0.00/0.07 c objpscostdiving : 0.00 0.00 0 0
0.00/0.07 c rootsoldiving : 0.00 0.00 0 0
0.00/0.07 c linesearchdiving : 0.00 0.00 0 0
0.00/0.07 c guideddiving : 0.00 0.00 0 0
0.00/0.07 c octane : 0.00 0.00 0 0
0.00/0.07 c rens : 0.00 0.00 0 0
0.00/0.07 c rins : 0.00 0.00 0 0
0.00/0.07 c localbranching : 0.00 0.00 0 0
0.00/0.07 c mutation : 0.00 0.00 0 0
0.00/0.07 c crossover : 0.00 0.00 0 0
0.00/0.07 c dins : 0.00 0.00 0 0
0.00/0.07 c vbounds : 0.00 0.00 0 0
0.00/0.07 c undercover : 0.02 0.00 1 0
0.00/0.07 c subnlp : 0.00 0.00 0 0
0.00/0.07 c trysol : 0.00 0.00 0 0
0.00/0.07 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.07 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.07 c dual LP : 0.00 8 123 17.57 - 0.00 1
0.00/0.07 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.07 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.07 c diving/probing LP: 0.00 10 48 4.80 -
0.00/0.07 c strong branching : 0.00 0 0 0.00 -
0.00/0.07 c (at root node) : - 0 0 0.00 -
0.00/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.07 c B&B Tree :
0.00/0.07 c number of runs : 1
0.00/0.07 c nodes : 1
0.00/0.07 c nodes (total) : 1
0.00/0.07 c nodes left : 0
0.00/0.07 c max depth : 0
0.00/0.07 c max depth (total): 0
0.00/0.07 c backtracks : 0 (0.0%)
0.00/0.07 c delayed cutoffs : 0
0.00/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.07 c avg switch length: 2.00
0.00/0.07 c switching time : 0.00
0.00/0.07 c Solution :
0.00/0.07 c Solutions found : 1 (1 improvements)
0.00/0.07 c First Solution : +4.09000000000000e+02 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <rounding>)
0.00/0.07 c Primal Bound : +4.09000000000000e+02 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <rounding>)
0.00/0.07 c Dual Bound : +4.09000000000000e+02
0.00/0.07 c Gap : 0.00 %
0.00/0.07 c Root Dual Bound : +4.09000000000000e+02
0.00/0.07 c Root Iterations : 171
0.00/0.07 c Time complete: 0.07.