0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
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-2664958-1276646314.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.03 c (round 2) 19 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 0 upgd conss, 1170 impls, 0 clqs
0.00/0.03 c (round 3) 29 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 34 chg coeffs, 6 upgd conss, 1410 impls, 0 clqs
0.00/0.04 c (round 4) 39 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 6 upgd conss, 1570 impls, 0 clqs
0.00/0.04 c (round 5) 49 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 6 upgd conss, 1650 impls, 0 clqs
0.00/0.04 c (round 6) 59 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 6 upgd conss, 1650 impls, 0 clqs
0.00/0.05 c presolving (7 rounds):
0.00/0.05 c 59 deleted vars, 40 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 58 changed coefficients
0.00/0.05 c 1680 implications, 0 cliques
0.00/0.05 c presolved problem has 141 variables (141 bin, 0 int, 0 impl, 0 cont) and 91 constraints
0.00/0.05 c 78 constraints of type <and>
0.00/0.05 c 5 constraints of type <linear>
0.00/0.05 c 8 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 2)
0.00/0.05 c Presolving Time: 0.02
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.2
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1800
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c heuristics/undercover/freq = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.06 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.06 c 0.0s| 1 | 0 | 11 | - | 765k| 0 | 4 | 141 | 91 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.16 o 3
0.10/0.16 c y 0.1s| 1 | 0 | 11 | - | 784k| 0 | - | 141 | 91 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.10/0.17 c 0.1s| 1 | 0 | 11 | - | 920k| 0 | - | 141 | 179 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.10/0.17 c 0.1s| 1 | 0 | 11 | - | 920k| 0 | - | 141 | 179 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.10/0.17 c
0.10/0.17 c SCIP Status : problem is solved [optimal solution found]
0.10/0.17 c Solving Time (sec) : 0.12
0.10/0.17 c Solving Nodes : 1
0.10/0.17 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.10/0.17 c Dual Bound : +3.00000000000000e+00
0.10/0.17 c Gap : 0.00 %
0.10/0.17 s OPTIMUM FOUND
0.10/0.17 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
0.10/0.17 v x58 -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
0.10/0.17 v x21 -x20 -x19 -x18 x17 x16 -x15 x14 -x13 -x12 x11 x10 x9 -x8 x7 x6 -x5 -x4 -x3 x2 x1
0.10/0.17 c SCIP Status : problem is solved [optimal solution found]
0.10/0.17 c Solving Time : 0.12
0.10/0.17 c Original Problem :
0.10/0.17 c Problem name : HOME/instance-2664958-1276646314.opb
0.10/0.17 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.17 c Constraints : 136 initial, 136 maximal
0.10/0.17 c Presolved Problem :
0.10/0.17 c Problem name : t_HOME/instance-2664958-1276646314.opb
0.10/0.17 c Variables : 141 (141 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.17 c Constraints : 91 initial, 179 maximal
0.10/0.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.10/0.17 c trivial : 0.00 0 0 0 0 0 0 0 0
0.10/0.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.10/0.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.10/0.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.10/0.17 c implics : 0.00 0 0 0 0 0 0 0 0
0.10/0.17 c probing : 0.01 0 0 0 0 0 0 0 0
0.10/0.17 c and : 0.00 10 40 0 0 0 40 0 40
0.10/0.17 c linear : 0.00 3 6 0 0 0 0 0 18
0.10/0.17 c logicor : 0.00 0 0 0 0 0 0 0 0
0.10/0.17 c root node : - 19 - - 19 - - - -
0.10/0.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.10/0.17 c integral : 0 0 0 0 0 0 0 0 0 0
0.10/0.17 c and : 78 1 298 0 0 0 0 0 0 0
0.10/0.17 c linear : 5+ 1 298 0 0 0 0 0 0 0
0.10/0.17 c logicor : 8 1 82 0 0 0 0 0 0 0
0.10/0.17 c countsols : 0 0 0 0 0 0 0 0 0 0
0.10/0.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.10/0.17 c integral : 0.00 0.00 0.00 0.00 0.00
0.10/0.17 c and : 0.01 0.00 0.01 0.00 0.00
0.10/0.17 c linear : 0.00 0.00 0.00 0.00 0.00
0.10/0.17 c logicor : 0.00 0.00 0.00 0.00 0.00
0.10/0.17 c countsols : 0.00 0.00 0.00 0.00 0.00
0.10/0.17 c Propagators : Time Calls Cutoffs DomReds
0.10/0.17 c vbounds : 0.00 2 0 0
0.10/0.17 c rootredcost : 0.00 0 0 0
0.10/0.17 c pseudoobj : 0.00 3 1 0
0.10/0.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.10/0.17 c propagation : 0.00 1 0 0 0.0 0 0.0 -
0.10/0.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.10/0.17 c applied globally : - - - 0 0.0 - - -
0.10/0.17 c applied locally : - - - 0 0.0 - - -
0.10/0.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.10/0.17 c cut pool : 0.00 0 - - 0 - (maximal pool size: 11)
0.10/0.17 c redcost : 0.00 1 0 0 0 0
0.10/0.17 c impliedbounds : 0.00 1 0 0 0 0
0.10/0.17 c intobj : 0.00 0 0 0 0 0
0.10/0.17 c cgmip : 0.00 0 0 0 0 0
0.10/0.17 c gomory : 0.00 1 0 0 1 0
0.10/0.17 c strongcg : 0.00 1 0 0 1 0
0.10/0.17 c cmir : 0.00 1 0 0 4 0
0.10/0.17 c flowcover : 0.01 1 0 0 5 0
0.10/0.17 c clique : 0.00 1 0 0 0 0
0.10/0.17 c zerohalf : 0.00 0 0 0 0 0
0.10/0.17 c mcf : 0.00 1 0 0 0 0
0.10/0.17 c rapidlearning : 0.07 1 0 19 0 88
0.10/0.17 c Pricers : Time Calls Vars
0.10/0.17 c problem variables: 0.00 0 0
0.10/0.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.10/0.17 c pscost : 0.00 0 0 0 0 0 0
0.10/0.17 c inference : 0.00 0 0 0 0 0 0
0.10/0.17 c mostinf : 0.00 0 0 0 0 0 0
0.10/0.17 c leastinf : 0.00 0 0 0 0 0 0
0.10/0.17 c fullstrong : 0.00 0 0 0 0 0 0
0.10/0.17 c allfullstrong : 0.00 0 0 0 0 0 0
0.10/0.17 c random : 0.00 0 0 0 0 0 0
0.10/0.17 c relpscost : 0.00 0 0 0 0 0 0
0.10/0.17 c Primal Heuristics : Time Calls Found
0.10/0.17 c LP solutions : 0.00 - 0
0.10/0.17 c pseudo solutions : 0.00 - 0
0.10/0.17 c oneopt : 0.00 0 0
0.10/0.17 c trivial : 0.00 2 0
0.10/0.17 c simplerounding : 0.00 0 0
0.10/0.17 c zirounding : 0.00 0 0
0.10/0.17 c rounding : 0.00 1 0
0.10/0.17 c shifting : 0.00 1 0
0.10/0.17 c intshifting : 0.00 0 0
0.10/0.17 c twoopt : 0.00 0 0
0.10/0.17 c fixandinfer : 0.00 0 0
0.10/0.17 c feaspump : 0.00 1 0
0.10/0.17 c coefdiving : 0.00 0 0
0.10/0.17 c pscostdiving : 0.00 0 0
0.10/0.17 c fracdiving : 0.00 0 0
0.10/0.17 c veclendiving : 0.00 0 0
0.10/0.17 c intdiving : 0.00 0 0
0.10/0.17 c actconsdiving : 0.00 0 0
0.10/0.17 c objpscostdiving : 0.00 0 0
0.10/0.17 c rootsoldiving : 0.00 0 0
0.10/0.17 c linesearchdiving : 0.00 0 0
0.10/0.17 c guideddiving : 0.00 0 0
0.10/0.17 c octane : 0.00 0 0
0.10/0.17 c rens : 0.00 0 0
0.10/0.17 c rins : 0.00 0 0
0.10/0.17 c localbranching : 0.00 0 0
0.10/0.17 c mutation : 0.00 0 0
0.10/0.17 c crossover : 0.00 0 0
0.10/0.17 c dins : 0.00 0 0
0.10/0.17 c undercover : 0.01 1 0
0.10/0.17 c nlp : 0.00 0 0
0.10/0.17 c trysol : 0.00 0 0
0.10/0.17 c LP : Time Calls Iterations Iter/call Iter/sec
0.10/0.17 c primal LP : 0.00 0 0 0.00 -
0.10/0.17 c dual LP : 0.00 1 11 11.00 -
0.10/0.17 c lex dual LP : 0.00 0 0 0.00 -
0.10/0.17 c barrier LP : 0.00 0 0 0.00 -
0.10/0.17 c diving/probing LP: 0.00 0 0 0.00 -
0.10/0.17 c strong branching : 0.00 0 0 0.00 -
0.10/0.17 c (at root node) : - 0 0 0.00 -
0.10/0.17 c conflict analysis: 0.00 0 0 0.00 -
0.10/0.17 c B&B Tree :
0.10/0.17 c number of runs : 1
0.10/0.17 c nodes : 1
0.10/0.17 c nodes (total) : 1
0.10/0.17 c nodes left : 0
0.10/0.17 c max depth : 0
0.10/0.17 c max depth (total): 0
0.10/0.17 c backtracks : 0 (0.0%)
0.10/0.17 c delayed cutoffs : 0
0.10/0.17 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.10/0.17 c avg switch length: 2.00
0.10/0.17 c switching time : 0.00
0.10/0.17 c Solution :
0.10/0.17 c Solutions found : 1 (1 improvements)
0.10/0.17 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.11 seconds, depth 0, found by <trysol>)
0.10/0.17 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.11 seconds, depth 0, found by <trysol>)
0.10/0.17 c Dual Bound : +3.00000000000000e+00
0.10/0.17 c Gap : 0.00 %
0.10/0.17 c Root Dual Bound : +3.00000000000000e+00
0.10/0.17 c Root Iterations : 11
0.10/0.18 c Time complete: 0.17.