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: 947bdb7-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-3692266-1338033414.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.00 c (round 1) 47 del vars, 0 del conss, 0 add conss, 45 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 328 impls, 0 clqs
0.00/0.01 c (round 2) 65 del vars, 124 del conss, 0 add conss, 49 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1138 impls, 0 clqs
0.00/0.01 c (round 3) 66 del vars, 152 del conss, 0 add conss, 49 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 1160 impls, 0 clqs
0.00/0.01 c (round 4) 68 del vars, 155 del conss, 0 add conss, 49 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 1204 impls, 0 clqs
0.00/0.01 c (round 5) 68 del vars, 158 del conss, 0 add conss, 49 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 1204 impls, 0 clqs
0.00/0.01 c (round 6) 68 del vars, 158 del conss, 0 add conss, 49 chg bounds, 2 chg sides, 2 chg coeffs, 85 upgd conss, 1204 impls, 0 clqs
0.00/0.01 c (0.0s) probing cycle finished: starting next cycle
0.00/0.01 c (round 7) 75 del vars, 215 del conss, 19 add conss, 49 chg bounds, 2 chg sides, 2 chg coeffs, 85 upgd conss, 1320 impls, 0 clqs
0.00/0.01 c (round 8) 75 del vars, 222 del conss, 25 add conss, 49 chg bounds, 2 chg sides, 2 chg coeffs, 85 upgd conss, 1354 impls, 0 clqs
0.00/0.01 c (0.0s) probing cycle finished: starting next cycle
0.00/0.01 c (round 9) 79 del vars, 222 del conss, 25 add conss, 49 chg bounds, 2 chg sides, 2 chg coeffs, 85 upgd conss, 1370 impls, 0 clqs
0.00/0.01 c (round 10) 79 del vars, 235 del conss, 25 add conss, 49 chg bounds, 2 chg sides, 2 chg coeffs, 85 upgd conss, 1370 impls, 0 clqs
0.00/0.01 c (round 11) 79 del vars, 246 del conss, 25 add conss, 49 chg bounds, 2 chg sides, 2 chg coeffs, 85 upgd conss, 1370 impls, 0 clqs
0.00/0.01 c (0.0s) probing cycle finished: starting next cycle
0.00/0.01 c presolving (12 rounds):
0.00/0.01 c 79 deleted vars, 246 deleted constraints, 25 added constraints, 49 tightened bounds, 0 added holes, 2 changed sides, 2 changed coefficients
0.00/0.01 c 1370 implications, 0 cliques
0.00/0.01 c presolved problem has 20 variables (20 bin, 0 int, 0 impl, 0 cont) and 23 constraints
0.00/0.01 c 10 constraints of type <setppc>
0.00/0.01 c 12 constraints of type <and>
0.00/0.01 c 1 constraints of type <linear>
0.00/0.01 c transformed objective value is always integral (scale: 2)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 o 217
0.00/0.02 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.02 c T 0.0s| 1 | 0 | 0 | - | 519k| 0 | - | 20 | 23 | 20 | 35 | 0 | 0 | 0 | -- | 2.170000e+02 | Inf
0.00/0.02 c 0.0s| 1 | 0 | 4 | - | 512k| 0 | 2 | 20 | 18 | 20 | 35 | 0 | 0 | 0 | 1.000000e+00 | 2.170000e+02 | Large
0.00/0.03 o 1
0.00/0.03 c U 0.0s| 1 | 0 | 4 | - | 514k| 0 | - | 20 | 21 | 20 | 35 | 0 | 3 | 0 | 1.000000e+00 | 1.000000e+00 | 0.00%
0.00/0.04 c 0.0s| 1 | 0 | 4 | - | 514k| 0 | - | 20 | 22 | 20 | 35 | 0 | 3 | 0 | 1.000000e+00 | 1.000000e+00 | 0.00%
0.00/0.04 c
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Solving Time (sec) : 0.04
0.00/0.04 c Solving Nodes : 1
0.00/0.04 c Primal Bound : +1.00000000000000e+00 (2 solutions)
0.00/0.04 c Dual Bound : +1.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 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
0.00/0.04 v -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49
0.00/0.04 v -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x18 -x27 x17 x26
0.00/0.04 v x16 x25 -x15 -x24 x14 x23 x13 x22 -x12 -x21 -x11 -x20 x10 x19 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Total Time : 0.04
0.00/0.04 c solving : 0.04
0.00/0.04 c presolving : 0.01 (included in solving)
0.00/0.04 c reading : 0.00 (included in solving)
0.00/0.04 c copying : 0.00 (1 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-3692266-1338033414.opb
0.00/0.04 c Variables : 99 (99 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 244 initial, 244 maximal
0.00/0.04 c Objective sense : minimize
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-3692266-1338033414.opb
0.00/0.04 c Variables : 20 (20 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 23 initial, 23 maximal
0.00/0.04 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.04 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c gateextraction : 0.00 0.00 0 0 0 0 0 57 19 0 0
0.00/0.04 c implics : 0.00 0.00 0 16 0 0 0 0 0 0 0
0.00/0.04 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 0.00 8 3 0 0 0 0 0 0 0
0.00/0.04 c setppc : 0.00 0.00 0 0 0 0 0 24 0 0 0
0.00/0.04 c and : 0.00 0.00 0 0 0 0 0 7 6 0 0
0.00/0.04 c linear : 0.00 0.00 50 2 0 49 0 158 0 2 2
0.00/0.04 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c root node : - - 1 - - 1 - - - - -
0.00/0.04 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 0 0 0 8 0 0 0 0 0 0
0.00/0.04 c setppc : 10 10 0 188 0 0 5 5 1 0 0 0 0
0.00/0.04 c and : 12 12 0 199 0 0 4 55 4 0 0 0 0
0.00/0.04 c linear : 1 1 0 193 0 0 3 20 6 0 0 0 0
0.00/0.04 c logicor : 0+ 4 0 6 0 0 0 1 0 0 0 0 0
0.00/0.04 c countsols : 0 0 0 0 0 0 4 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.04 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.04 c rootredcost : 0 0 0 0
0.00/0.04 c pseudoobj : 38 0 0 1
0.00/0.04 c vbounds : 0 0 0 0
0.00/0.04 c redcost : 1 0 0 0
0.00/0.04 c probing : 0 0 0 0
0.00/0.04 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.04 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c probing : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 11 3 8 6.2 0 0.0 -
0.00/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.00/0.04 c applied globally : - - - 3 2.7 - - -
0.00/0.04 c applied locally : - - - 0 0.0 - - -
0.00/0.04 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.04 c clique : 0.00 0.00 0 0 0 0 0
0.00/0.04 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.04 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.04 c cmir : 0.00 0.00 0 0 0 0 0
0.00/0.04 c flowcover : 0.00 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0.00 0 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.04 c mcf : 0.00 0.00 0 0 0 0 0
0.00/0.04 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.04 c strongcg : 0.00 0.00 0 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.04 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.04 c problem variables: 0.00 - 0 0
0.00/0.04 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.04 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.04 c LP solutions : 0.00 - - 0
0.00/0.04 c pseudo solutions : 0.00 - - 0
0.00/0.04 c oneopt : 0.00 0.00 1 0
0.00/0.04 c smallcard : 0.00 0.00 0 0
0.00/0.04 c trivial : 0.00 0.00 2 0
0.00/0.04 c shiftandpropagate: 0.00 0.00 1 1
0.00/0.04 c simplerounding : 0.00 0.00 0 0
0.00/0.04 c zirounding : 0.00 0.00 0 0
0.00/0.04 c rounding : 0.00 0.00 1 0
0.00/0.04 c shifting : 0.00 0.00 1 0
0.00/0.04 c intshifting : 0.00 0.00 0 0
0.00/0.04 c twoopt : 0.00 0.00 0 0
0.00/0.04 c indtwoopt : 0.00 0.00 0 0
0.00/0.04 c indoneopt : 0.00 0.00 0 0
0.00/0.04 c fixandinfer : 0.00 0.00 0 0
0.00/0.04 c feaspump : 0.00 0.00 0 0
0.00/0.04 c clique : 0.00 0.00 0 0
0.00/0.04 c indrounding : 0.00 0.00 0 0
0.00/0.04 c indcoefdiving : 0.00 0.00 0 0
0.00/0.04 c coefdiving : 0.00 0.00 0 0
0.00/0.04 c pscostdiving : 0.00 0.00 0 0
0.00/0.04 c nlpdiving : 0.00 0.00 0 0
0.00/0.04 c fracdiving : 0.00 0.00 0 0
0.00/0.04 c veclendiving : 0.00 0.00 0 0
0.00/0.04 c intdiving : 0.00 0.00 0 0
0.00/0.04 c actconsdiving : 0.00 0.00 0 0
0.00/0.04 c objpscostdiving : 0.00 0.00 0 0
0.00/0.04 c rootsoldiving : 0.00 0.00 0 0
0.00/0.04 c linesearchdiving : 0.00 0.00 0 0
0.00/0.04 c guideddiving : 0.00 0.00 0 0
0.00/0.04 c octane : 0.00 0.00 0 0
0.00/0.04 c rens : 0.00 0.00 0 0
0.00/0.04 c rins : 0.00 0.00 0 0
0.00/0.04 c localbranching : 0.00 0.00 0 0
0.00/0.04 c mutation : 0.00 0.00 0 0
0.00/0.04 c crossover : 0.00 0.00 0 0
0.00/0.04 c dins : 0.00 0.00 0 0
0.00/0.04 c vbounds : 0.00 0.00 0 0
0.00/0.04 c undercover : 0.02 0.00 1 1
0.00/0.04 c subnlp : 0.00 0.00 0 0
0.00/0.04 c trysol : 0.00 0.00 0 0
0.00/0.04 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.04 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c dual LP : 0.00 1 4 4.00 - 0.00 0
0.00/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.04 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.04 c strong branching : 0.00 0 0 0.00 -
0.00/0.04 c (at root node) : - 0 0 0.00 -
0.00/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.04 c B&B Tree :
0.00/0.04 c number of runs : 1
0.00/0.04 c nodes : 1
0.00/0.04 c nodes (total) : 1
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 0
0.00/0.04 c max depth (total): 0
0.00/0.04 c backtracks : 0 (0.0%)
0.00/0.04 c delayed cutoffs : 0
0.00/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.04 c avg switch length: 2.00
0.00/0.04 c switching time : 0.00
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 2 (2 improvements)
0.00/0.04 c First Solution : +2.17000000000000e+02 (in run 1, after 1 nodes, 0.02 seconds, depth 15, found by <shiftandpropagate>)
0.00/0.04 c Primal Bound : +1.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <undercover>)
0.00/0.04 c Dual Bound : +1.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Root Dual Bound : +1.00000000000000e+00
0.00/0.04 c Root Iterations : 4
0.00/0.04 c Time complete: 0.03.