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-2703004-1278564386.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 136 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 0 upgd conss, 784 impls, 0 clqs
0.00/0.02 c (round 2) 18 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 0 upgd conss, 1151 impls, 0 clqs
0.00/0.03 c (round 3) 29 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 35 chg coeffs, 6 upgd conss, 1391 impls, 0 clqs
0.00/0.03 c (round 4) 39 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 43 chg coeffs, 6 upgd conss, 1551 impls, 0 clqs
0.00/0.03 c (round 5) 49 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 51 chg coeffs, 6 upgd conss, 1631 impls, 0 clqs
0.00/0.03 c (round 6) 59 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 59 chg coeffs, 6 upgd conss, 1631 impls, 0 clqs
0.00/0.04 c presolving (7 rounds):
0.00/0.04 c 59 deleted vars, 41 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 59 changed coefficients
0.00/0.04 c 1661 implications, 0 cliques
0.00/0.04 c presolved problem has 141 variables (141 bin, 0 int, 0 impl, 0 cont) and 90 constraints
0.00/0.04 c 78 constraints of type <and>
0.00/0.04 c 5 constraints of type <linear>
0.00/0.04 c 7 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 2)
0.00/0.04 c Presolving Time: 0.03
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.3
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1790
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 14 | - | 765k| 0 | 7 | 141 | 90 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.13 o 3
0.10/0.13 c y 0.1s| 1 | 0 | 155 | - | 823k| 0 | - | 141 | 90 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.10/0.14 c 0.1s| 1 | 0 | 155 | - | 967k| 0 | - | 141 | 196 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.10/0.14 c 0.1s| 1 | 0 | 155 | - | 967k| 0 | - | 141 | 196 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.10/0.14 c
0.10/0.14 c SCIP Status : problem is solved [optimal solution found]
0.10/0.14 c Solving Time (sec) : 0.13
0.10/0.14 c Solving Nodes : 1
0.10/0.14 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.10/0.14 c Dual Bound : +3.00000000000000e+00
0.10/0.14 c Gap : 0.00 %
0.10/0.14 s OPTIMUM FOUND
0.10/0.14 v -x75 -x74 x73 x72 x71 -x70 -x69 -x68 -x67 -x66 x50 x49 -x48 x47 x46 -x65 -x64 -x63 x62 -x61 -x45 -x44 -x43 -x42 x41 -x60 -x59 -x58
0.10/0.14 v -x57 x56 -x40 x39 x38 -x37 x36 -x55 -x54 -x53 -x52 -x51 -x35 x34 -x33 -x32 x31 -x30 x29 -x28 -x27 x26 x25 x24 -x23 x22 x21
0.10/0.14 v -x20 -x19 x18 -x17 x16 -x15 -x14 x13 -x12 x11 -x10 -x9 -x8 x7 x6 -x5 -x4 -x3 x2 x1
0.10/0.14 c SCIP Status : problem is solved [optimal solution found]
0.10/0.14 c Solving Time : 0.13
0.10/0.14 c Original Problem :
0.10/0.14 c Problem name : HOME/instance-2703004-1278564386.opb
0.10/0.14 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.14 c Constraints : 136 initial, 136 maximal
0.10/0.14 c Presolved Problem :
0.10/0.14 c Problem name : t_HOME/instance-2703004-1278564386.opb
0.10/0.14 c Variables : 141 (141 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.14 c Constraints : 90 initial, 196 maximal
0.10/0.14 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.10/0.14 c trivial : 0.00 0 0 0 0 0 0 0 0
0.10/0.14 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.10/0.14 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.10/0.14 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.10/0.14 c implics : 0.00 0 0 0 0 0 0 0 0
0.10/0.14 c probing : 0.01 0 0 0 0 0 0 0 0
0.10/0.14 c and : 0.01 10 41 0 0 0 41 0 41
0.10/0.14 c linear : 0.01 2 6 0 0 0 0 0 18
0.10/0.14 c logicor : 0.00 0 0 0 0 0 0 0 0
0.10/0.14 c root node : - 19 - - 19 - - - -
0.10/0.14 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.10/0.14 c integral : 0 0 0 0 0 0 0 0 0 0
0.10/0.14 c and : 78 1 298 0 0 0 0 1 0 0
0.10/0.14 c linear : 5+ 1 298 0 0 0 0 0 0 0
0.10/0.14 c logicor : 7 1 74 0 0 0 0 0 0 0
0.10/0.14 c countsols : 0 0 0 0 0 0 0 0 0 0
0.10/0.14 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.10/0.14 c integral : 0.00 0.00 0.00 0.00 0.00
0.10/0.14 c and : 0.00 0.00 0.00 0.00 0.00
0.10/0.14 c linear : 0.00 0.00 0.00 0.00 0.00
0.10/0.14 c logicor : 0.00 0.00 0.00 0.00 0.00
0.10/0.14 c countsols : 0.00 0.00 0.00 0.00 0.00
0.10/0.14 c Propagators : Time Calls Cutoffs DomReds
0.10/0.14 c vbounds : 0.00 2 0 0
0.10/0.14 c rootredcost : 0.00 0 0 0
0.10/0.14 c pseudoobj : 0.00 3 1 0
0.10/0.14 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.10/0.14 c propagation : 0.00 1 0 0 0.0 0 0.0 -
0.10/0.14 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.14 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.14 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.14 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.10/0.14 c applied globally : - - - 0 0.0 - - -
0.10/0.14 c applied locally : - - - 0 0.0 - - -
0.10/0.14 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.10/0.14 c cut pool : 0.00 0 - - 0 - (maximal pool size: 22)
0.10/0.14 c redcost : 0.00 1 0 0 0 0
0.10/0.14 c impliedbounds : 0.00 1 0 0 4 0
0.10/0.14 c intobj : 0.00 0 0 0 0 0
0.10/0.14 c cgmip : 0.00 0 0 0 0 0
0.10/0.14 c gomory : 0.00 1 0 0 20 0
0.10/0.14 c strongcg : 0.00 1 0 0 20 0
0.10/0.14 c cmir : 0.00 1 0 0 6 0
0.10/0.14 c flowcover : 0.00 1 0 0 9 0
0.10/0.14 c clique : 0.00 1 0 0 0 0
0.10/0.14 c zerohalf : 0.00 0 0 0 0 0
0.10/0.14 c mcf : 0.00 1 0 0 0 0
0.10/0.14 c rapidlearning : 0.07 1 0 19 0 106
0.10/0.14 c Pricers : Time Calls Vars
0.10/0.14 c problem variables: 0.00 0 0
0.10/0.14 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.10/0.14 c pscost : 0.00 0 0 0 0 0 0
0.10/0.14 c inference : 0.00 0 0 0 0 0 0
0.10/0.14 c mostinf : 0.00 0 0 0 0 0 0
0.10/0.14 c leastinf : 0.00 0 0 0 0 0 0
0.10/0.14 c fullstrong : 0.00 0 0 0 0 0 0
0.10/0.14 c allfullstrong : 0.00 0 0 0 0 0 0
0.10/0.14 c random : 0.00 0 0 0 0 0 0
0.10/0.14 c relpscost : 0.00 0 0 0 0 0 0
0.10/0.14 c Primal Heuristics : Time Calls Found
0.10/0.14 c LP solutions : 0.00 - 0
0.10/0.14 c pseudo solutions : 0.00 - 0
0.10/0.14 c oneopt : 0.00 0 0
0.10/0.14 c trivial : 0.00 2 0
0.10/0.14 c simplerounding : 0.00 0 0
0.10/0.14 c zirounding : 0.00 0 0
0.10/0.14 c rounding : 0.00 1 0
0.10/0.14 c shifting : 0.00 1 0
0.10/0.14 c intshifting : 0.00 0 0
0.10/0.14 c twoopt : 0.00 0 0
0.10/0.14 c fixandinfer : 0.00 0 0
0.10/0.14 c feaspump : 0.00 1 0
0.10/0.14 c coefdiving : 0.00 0 0
0.10/0.14 c pscostdiving : 0.00 0 0
0.10/0.14 c fracdiving : 0.00 0 0
0.10/0.14 c veclendiving : 0.00 0 0
0.10/0.14 c intdiving : 0.00 0 0
0.10/0.14 c actconsdiving : 0.00 0 0
0.10/0.14 c objpscostdiving : 0.00 0 0
0.10/0.14 c rootsoldiving : 0.00 0 0
0.10/0.14 c linesearchdiving : 0.00 0 0
0.10/0.14 c guideddiving : 0.00 0 0
0.10/0.14 c octane : 0.00 0 0
0.10/0.14 c rens : 0.00 0 0
0.10/0.14 c rins : 0.00 0 0
0.10/0.14 c localbranching : 0.00 0 0
0.10/0.14 c mutation : 0.00 0 0
0.10/0.14 c crossover : 0.00 0 0
0.10/0.14 c dins : 0.00 0 0
0.10/0.14 c undercover : 0.02 1 0
0.10/0.14 c nlp : 0.00 0 0
0.10/0.14 c trysol : 0.00 0 0
0.10/0.14 c LP : Time Calls Iterations Iter/call Iter/sec
0.10/0.14 c primal LP : 0.00 0 0 0.00 -
0.10/0.14 c dual LP : 0.00 1 14 14.00 -
0.10/0.14 c lex dual LP : 0.00 0 0 0.00 -
0.10/0.14 c barrier LP : 0.00 0 0 0.00 -
0.10/0.14 c diving/probing LP: 0.00 13 141 10.85 -
0.10/0.14 c strong branching : 0.00 0 0 0.00 -
0.10/0.14 c (at root node) : - 0 0 0.00 -
0.10/0.14 c conflict analysis: 0.00 0 0 0.00 -
0.10/0.14 c B&B Tree :
0.10/0.14 c number of runs : 1
0.10/0.14 c nodes : 1
0.10/0.14 c nodes (total) : 1
0.10/0.14 c nodes left : 0
0.10/0.14 c max depth : 0
0.10/0.14 c max depth (total): 0
0.10/0.14 c backtracks : 0 (0.0%)
0.10/0.14 c delayed cutoffs : 0
0.10/0.14 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.10/0.14 c avg switch length: 2.00
0.10/0.14 c switching time : 0.00
0.10/0.14 c Solution :
0.10/0.14 c Solutions found : 1 (1 improvements)
0.10/0.14 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.12 seconds, depth 0, found by <trysol>)
0.10/0.14 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.12 seconds, depth 0, found by <trysol>)
0.10/0.14 c Dual Bound : +3.00000000000000e+00
0.10/0.14 c Gap : 0.00 %
0.10/0.14 c Root Dual Bound : +3.00000000000000e+00
0.10/0.14 c Root Iterations : 155
0.10/0.15 c Time complete: 0.14.