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-2666041-1276404617.opb>
0.00/0.01 c original problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 229 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 5699
0.00/0.02 c feasible solution found by trivial heuristic, objective value 5.699000e+03
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 16 del vars, 35 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs
0.00/0.02 c (round 2) 16 del vars, 37 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs
0.00/0.02 c (round 3) 16 del vars, 55 del conss, 11 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs
0.00/0.02 c (round 4) 22 del vars, 61 del conss, 11 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs
0.00/0.03 c (round 5) 24 del vars, 63 del conss, 11 chg bounds, 5 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs
0.00/0.03 c (round 6) 24 del vars, 76 del conss, 11 chg bounds, 5 chg sides, 0 chg coeffs, 159 upgd conss, 108 impls, 0 clqs
0.00/0.03 c (round 7) 24 del vars, 77 del conss, 11 chg bounds, 5 chg sides, 0 chg coeffs, 166 upgd conss, 108 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 107/109 (98.2%) - 0 fixings, 0 aggregations, 5 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (8 rounds):
0.00/0.04 c 24 deleted vars, 77 deleted constraints, 11 tightened bounds, 0 added holes, 5 changed sides, 0 changed coefficients
0.00/0.04 c 118 implications, 0 cliques
0.00/0.04 c presolved problem has 109 variables (109 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.04 c 152 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
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 = 1800
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = 0
0.00/0.04 c
0.00/0.04 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.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
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 # 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 # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
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 o 5271
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 | 0 | - | 573k| 0 | - | 109 | 152 | 0 | 0 | 0 | 0 | 0 | -- | 5.271000e+03 | Inf
0.00/0.04 o 4641
0.00/0.04 c t 0.0s| 1 | 0 | 0 | - | 574k| 0 | - | 109 | 152 | 0 | 0 | 0 | 0 | 0 | -- | 4.641000e+03 | Inf
0.00/0.04 o 1905
0.00/0.04 c b 0.0s| 1 | 0 | 0 | - | 677k| 0 | - | 109 | 152 | 109 | 152 | 0 | 0 | 0 | -- | 1.905000e+03 | Inf
0.00/0.04 c 0.0s| 1 | 0 | 59 | - | 676k| 0 | 12 | 109 | 152 | 109 | 152 | 0 | 0 | 0 | 1.560500e+03 | 1.905000e+03 | 22.08%
0.00/0.04 o 1735
0.00/0.04 c R 0.0s| 1 | 0 | 59 | - | 679k| 0 | 12 | 109 | 152 | 109 | 152 | 0 | 0 | 0 | 1.560500e+03 | 1.735000e+03 | 11.18%
0.00/0.04 o 1567
0.00/0.04 c b 0.0s| 1 | 0 | 59 | - | 684k| 0 | 12 | 109 | 152 | 109 | 152 | 0 | 0 | 0 | 1.560500e+03 | 1.567000e+03 | 0.42%
0.00/0.05 c 0.0s| 1 | 0 | 64 | - | 652k| 0 | - | 109 | 100 | 109 | 80 | 3 | 0 | 0 | 1.567000e+03 | 1.567000e+03 | 0.00%
0.00/0.05 c 0.0s| 1 | 0 | 64 | - | 652k| 0 | - | 109 | 100 | 109 | 80 | 3 | 0 | 0 | 1.567000e+03 | 1.567000e+03 | 0.00%
0.00/0.05 c
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Solving Time (sec) : 0.03
0.00/0.05 c Solving Nodes : 1
0.00/0.05 c Primal Bound : +1.56700000000000e+03 (6 solutions)
0.00/0.05 c Dual Bound : +1.56700000000000e+03
0.00/0.05 c Gap : 0.00 %
0.00/0.05 s OPTIMUM FOUND
0.00/0.05 v -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 x116 -x115 x114 -x113 -x112
0.00/0.05 v x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 x90 -x89
0.00/0.05 v -x88 -x87 -x86 -x85 -x84 x83 x82 x81 -x80 -x79 x78 x77 -x76 x75 x74 x73 -x72 -x71 x70 x69 x68 -x67 x66 -x65 x64 x63 x62 -x61
0.00/0.05 v x60 -x59 -x58 x57 -x56 -x55 x54 x53 -x52 x51 x50 x49 x48 -x47 -x46 -x45 -x44 x43 -x42 -x41 -x40 x39 -x38 -x37 x36 -x35 -x34
0.00/0.05 v -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 x18 -x17 x16 -x15 -x14 x13 x12 -x11 x10 x9 -x8 x7
0.00/0.05 v -x6 x5 -x4 -x3 x2 -x1
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Solving Time : 0.03
0.00/0.05 c Original Problem :
0.00/0.05 c Problem name : HOME/instance-2666041-1276404617.opb
0.00/0.05 c Variables : 133 (133 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 229 initial, 229 maximal
0.00/0.05 c Presolved Problem :
0.00/0.05 c Problem name : t_HOME/instance-2666041-1276404617.opb
0.00/0.05 c Variables : 109 (109 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 152 initial, 152 maximal
0.00/0.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.05 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.00/0.05 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c probing : 0.01 0 0 0 0 0 0 0 0
0.00/0.05 c linear : 0.01 11 11 0 11 0 63 5 0
0.00/0.05 c logicor : 0.00 0 0 0 0 0 14 0 0
0.00/0.05 c root node : - 64 - - 64 - - - -
0.00/0.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.05 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c logicor : 152 1 186 0 0 0 23 0 0 0
0.00/0.05 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.05 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c Propagators : Time Calls Cutoffs DomReds
0.00/0.05 c vbounds : 0.00 2 0 0
0.00/0.05 c rootredcost : 0.01 0 0 0
0.00/0.05 c pseudoobj : 0.00 4 1 0
0.00/0.05 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.05 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.05 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.05 c applied globally : - - - 0 0.0 - - -
0.00/0.05 c applied locally : - - - 0 0.0 - - -
0.00/0.05 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.05 c cut pool : 0.00 0 - - 0 - (maximal pool size: 3)
0.00/0.05 c redcost : 0.00 1 0 41 0 0
0.00/0.05 c impliedbounds : 0.00 1 0 0 2 0
0.00/0.05 c intobj : 0.00 0 0 0 0 0
0.00/0.05 c cgmip : 0.00 0 0 0 0 0
0.00/0.05 c gomory : 0.00 1 0 0 20 0
0.00/0.05 c strongcg : 0.00 1 0 0 20 0
0.00/0.05 c cmir : 0.00 1 0 0 0 0
0.00/0.05 c flowcover : 0.00 1 0 0 0 0
0.00/0.05 c clique : 0.00 1 0 0 0 0
0.00/0.05 c zerohalf : 0.00 0 0 0 0 0
0.00/0.05 c mcf : 0.00 1 0 0 0 0
0.00/0.05 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.05 c Pricers : Time Calls Vars
0.00/0.05 c problem variables: 0.00 0 0
0.00/0.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.05 c pscost : 0.00 0 0 0 0 0 0
0.00/0.05 c inference : 0.00 0 0 0 0 0 0
0.00/0.05 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.05 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.05 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c random : 0.00 0 0 0 0 0 0
0.00/0.05 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.05 c Primal Heuristics : Time Calls Found
0.00/0.05 c LP solutions : 0.00 - 0
0.00/0.05 c pseudo solutions : 0.00 - 0
0.00/0.05 c trivial : 0.00 2 3
0.00/0.05 c simplerounding : 0.00 1 0
0.00/0.05 c zirounding : 0.00 0 0
0.00/0.05 c rounding : 0.00 1 1
0.00/0.05 c shifting : 0.00 1 0
0.00/0.05 c intshifting : 0.00 0 0
0.00/0.05 c oneopt : 0.00 2 2
0.00/0.05 c twoopt : 0.00 0 0
0.00/0.05 c fixandinfer : 0.00 0 0
0.00/0.05 c feaspump : 0.00 0 0
0.00/0.05 c coefdiving : 0.00 0 0
0.00/0.05 c pscostdiving : 0.00 0 0
0.00/0.05 c fracdiving : 0.00 0 0
0.00/0.05 c veclendiving : 0.00 0 0
0.00/0.05 c intdiving : 0.00 0 0
0.00/0.05 c actconsdiving : 0.00 0 0
0.00/0.05 c objpscostdiving : 0.00 0 0
0.00/0.05 c rootsoldiving : 0.00 0 0
0.00/0.05 c linesearchdiving : 0.00 0 0
0.00/0.05 c guideddiving : 0.00 0 0
0.00/0.05 c octane : 0.00 0 0
0.00/0.05 c rens : 0.00 0 0
0.00/0.05 c rins : 0.00 0 0
0.00/0.05 c localbranching : 0.00 0 0
0.00/0.05 c mutation : 0.00 0 0
0.00/0.05 c crossover : 0.00 0 0
0.00/0.05 c dins : 0.00 0 0
0.00/0.05 c undercover : 0.00 0 0
0.00/0.05 c nlp : 0.00 0 0
0.00/0.05 c trysol : 0.00 0 0
0.00/0.05 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.05 c primal LP : 0.00 0 0 0.00 -
0.00/0.05 c dual LP : 0.01 2 64 32.00 6400.00
0.00/0.05 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.05 c barrier LP : 0.00 0 0 0.00 -
0.00/0.05 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.05 c strong branching : 0.00 0 0 0.00 -
0.00/0.05 c (at root node) : - 0 0 0.00 -
0.00/0.05 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.05 c B&B Tree :
0.00/0.05 c number of runs : 1
0.00/0.05 c nodes : 1
0.00/0.05 c nodes (total) : 1
0.00/0.05 c nodes left : 0
0.00/0.05 c max depth : 0
0.00/0.05 c max depth (total): 0
0.00/0.05 c backtracks : 0 (0.0%)
0.00/0.05 c delayed cutoffs : 0
0.00/0.05 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.05 c avg switch length: 2.00
0.00/0.05 c switching time : 0.00
0.00/0.05 c Solution :
0.00/0.05 c Solutions found : 6 (6 improvements)
0.00/0.05 c First Solution : +5.69900000000000e+03 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.05 c Primal Bound : +1.56700000000000e+03 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <oneopt>)
0.00/0.05 c Dual Bound : +1.56700000000000e+03
0.00/0.05 c Gap : 0.00 %
0.00/0.05 c Root Dual Bound : +1.56700000000000e+03
0.00/0.05 c Root Iterations : 64
0.00/0.06 c Time complete: 0.05.