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-2666218-1276594945.opb>
0.00/0.01 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 100
0.00/0.02 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 0 cliques
0.00/0.03 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.03 c 50 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
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 = 1799.99
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 = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = 0
0.00/0.03 c
0.00/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.00/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = 1000000
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.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 t 0.0s| 1 | 0 | 102 | - | 797k| 0 | 37 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.073893e+00 | 1.000000e+02 |9211.91%
0.00/0.04 o 37
0.00/0.04 c r 0.0s| 1 | 0 | 102 | - | 799k| 0 | 37 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.073893e+00 | 3.700000e+01 |3345.41%
0.00/0.04 o 36
0.00/0.04 c R 0.0s| 1 | 0 | 102 | - | 801k| 0 | 37 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.073893e+00 | 3.600000e+01 |3252.29%
0.00/0.04 o 35
0.00/0.04 c s 0.0s| 1 | 0 | 102 | - | 804k| 0 | 37 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.073893e+00 | 3.500000e+01 |3159.17%
0.00/0.06 c 0.0s| 1 | 0 | 226 | - | 812k| 0 | 0 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.000000e+00 | 3.500000e+01 |1650.00%
0.00/0.06 o 2
0.00/0.06 c b 0.0s| 1 | 0 | 226 | - | 815k| 0 | - | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.06 c 0.0s| 1 | 0 | 226 | - | 814k| 0 | - | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.06 c
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time (sec) : 0.04
0.00/0.06 c Solving Nodes : 1
0.00/0.06 c Primal Bound : +1.99999999999999e+00 (7 solutions)
0.00/0.06 c Dual Bound : +1.99999999999999e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v -x100 -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
0.00/0.06 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
0.00/0.06 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25
0.00/0.06 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time : 0.04
0.00/0.06 c Original Problem :
0.00/0.06 c Problem name : HOME/instance-2666218-1276594945.opb
0.00/0.06 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 50 initial, 50 maximal
0.00/0.06 c Presolved Problem :
0.00/0.06 c Problem name : t_HOME/instance-2666218-1276594945.opb
0.00/0.06 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 50 initial, 50 maximal
0.00/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c probing : 0.01 0 0 0 0 0 0 0 0
0.00/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c root node : - 0 - - 0 - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.06 c logicor : 50 1 19 0 0 0 0 0 0 0
0.00/0.06 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : Time Calls Cutoffs DomReds
0.00/0.06 c vbounds : 0.00 2 0 0
0.00/0.06 c rootredcost : 0.00 0 0 0
0.00/0.06 c pseudoobj : 0.01 3 0 0
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c applied globally : - - - 0 0.0 - - -
0.00/0.06 c applied locally : - - - 0 0.0 - - -
0.00/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 1)
0.00/0.06 c redcost : 0.00 1 0 0 0 0
0.00/0.06 c impliedbounds : 0.00 1 0 0 0 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c cgmip : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 0.00 1 0 0 4 0
0.00/0.06 c strongcg : 0.00 1 0 0 1 0
0.00/0.06 c cmir : 0.00 1 0 0 0 0
0.00/0.06 c flowcover : 0.01 1 0 0 0 0
0.00/0.06 c clique : 0.00 1 0 0 0 0
0.00/0.06 c zerohalf : 0.00 0 0 0 0 0
0.00/0.06 c mcf : 0.00 1 0 0 0 0
0.00/0.06 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.06 c Pricers : Time Calls Vars
0.00/0.06 c problem variables: 0.00 0 0
0.00/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.06 c pscost : 0.00 0 0 0 0 0 0
0.00/0.06 c inference : 0.00 0 0 0 0 0 0
0.00/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c random : 0.00 0 0 0 0 0 0
0.00/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.06 c Primal Heuristics : Time Calls Found
0.00/0.06 c LP solutions : 0.00 - 0
0.00/0.06 c pseudo solutions : 0.00 - 0
0.00/0.06 c trivial : 0.00 2 3
0.00/0.06 c simplerounding : 0.00 1 1
0.00/0.06 c zirounding : 0.00 0 0
0.00/0.06 c rounding : 0.00 1 1
0.00/0.06 c shifting : 0.00 1 1
0.00/0.06 c intshifting : 0.00 0 0
0.00/0.06 c oneopt : 0.00 1 1
0.00/0.06 c twoopt : 0.00 0 0
0.00/0.06 c fixandinfer : 0.00 0 0
0.00/0.06 c feaspump : 0.00 0 0
0.00/0.06 c coefdiving : 0.00 0 0
0.00/0.06 c pscostdiving : 0.00 0 0
0.00/0.06 c fracdiving : 0.00 0 0
0.00/0.06 c veclendiving : 0.00 0 0
0.00/0.06 c intdiving : 0.00 0 0
0.00/0.06 c actconsdiving : 0.00 0 0
0.00/0.06 c objpscostdiving : 0.00 0 0
0.00/0.06 c rootsoldiving : 0.00 0 0
0.00/0.06 c linesearchdiving : 0.00 0 0
0.00/0.06 c guideddiving : 0.00 0 0
0.00/0.06 c octane : 0.00 0 0
0.00/0.06 c rens : 0.00 0 0
0.00/0.06 c rins : 0.00 0 0
0.00/0.06 c localbranching : 0.00 0 0
0.00/0.06 c mutation : 0.00 0 0
0.00/0.06 c crossover : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c undercover : 0.00 0 0
0.00/0.06 c nlp : 0.00 0 0
0.00/0.06 c trysol : 0.00 0 0
0.00/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.06 c primal LP : 0.00 0 0 0.00 -
0.00/0.06 c dual LP : 0.02 2 226 113.00 11300.00
0.00/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.06 c barrier LP : 0.00 0 0 0.00 -
0.00/0.06 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.06 c strong branching : 0.00 0 0 0.00 -
0.00/0.06 c (at root node) : - 0 0 0.00 -
0.00/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.06 c B&B Tree :
0.00/0.06 c number of runs : 1
0.00/0.06 c nodes : 1
0.00/0.06 c nodes (total) : 1
0.00/0.06 c nodes left : 0
0.00/0.06 c max depth : 0
0.00/0.06 c max depth (total): 0
0.00/0.06 c backtracks : 0 (0.0%)
0.00/0.06 c delayed cutoffs : 0
0.00/0.06 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.06 c avg switch length: 2.00
0.00/0.06 c switching time : 0.00
0.00/0.06 c Solution :
0.00/0.06 c Solutions found : 7 (5 improvements)
0.00/0.06 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.06 c Primal Bound : +1.99999999999999e+00 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <oneopt>)
0.00/0.06 c Dual Bound : +1.99999999999999e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +1.99999999999999e+00
0.00/0.06 c Root Iterations : 226
0.00/0.07 c Time complete: 0.06.