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-2666038-1276403581.opb>
0.00/0.01 c original problem has 99 variables (99 bin, 0 int, 0 impl, 0 cont) and 185 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 4087
0.00/0.01 o 3412
0.00/0.01 c feasible solution found by trivial heuristic, objective value 3.412000e+03
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 185 upgd conss, 232 impls, 0 clqs
0.00/0.03 c (round 2) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 185 upgd conss, 232 impls, 0 clqs
0.00/0.03 c (round 3) 4 del vars, 74 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 185 upgd conss, 232 impls, 0 clqs
0.00/0.03 c presolving (4 rounds):
0.00/0.03 c 4 deleted vars, 74 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 232 implications, 0 cliques
0.00/0.03 c presolved problem has 95 variables (95 bin, 0 int, 0 impl, 0 cont) and 111 constraints
0.00/0.03 c 111 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 = 1800
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.03 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.03 c t 0.0s| 1 | 0 | 46 | - | 563k| 0 | 25 | 95 | 111 | 95 | 111 | 0 | 0 | 0 | 6.860000e+02 | 3.412000e+03 | 397.38%
0.00/0.03 o 1294
0.00/0.03 c R 0.0s| 1 | 0 | 46 | - | 566k| 0 | 25 | 95 | 111 | 95 | 111 | 0 | 0 | 0 | 6.860000e+02 | 1.294000e+03 | 88.63%
0.00/0.03 o 1243
0.00/0.03 c s 0.0s| 1 | 0 | 46 | - | 568k| 0 | 25 | 95 | 111 | 95 | 111 | 0 | 0 | 0 | 6.860000e+02 | 1.243000e+03 | 81.20%
0.00/0.04 c 0.0s| 1 | 0 | 49 | - | 569k| 0 | 18 | 95 | 111 | 95 | 112 | 1 | 0 | 0 | 6.906667e+02 | 1.243000e+03 | 79.97%
0.00/0.04 o 721
0.00/0.04 c b 0.0s| 1 | 0 | 49 | - | 571k| 0 | 18 | 95 | 111 | 95 | 112 | 1 | 0 | 0 | 6.906667e+02 | 7.210000e+02 | 4.39%
0.00/0.04 c 0.0s| 1 | 0 | 52 | - | 572k| 0 | 0 | 95 | 111 | 95 | 113 | 2 | 0 | 0 | 6.940000e+02 | 7.210000e+02 | 3.89%
0.00/0.04 o 694
0.00/0.04 c * 0.0s| 1 | 0 | 52 | - | 574k| 0 | - | 95 | 111 | 95 | 113 | 2 | 0 | 0 | 6.940000e+02 | 6.940000e+02 | 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.02
0.00/0.04 c Solving Nodes : 1
0.00/0.04 c Primal Bound : +6.94000000000000e+02 (9 solutions)
0.00/0.04 c Dual Bound : +6.94000000000000e+02
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 -x73
0.00/0.04 v -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48
0.00/0.04 v -x47 -x46 -x45 x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 x32 -x31 -x30 x29 x28 -x27 -x26 -x25 -x24 -x23 -x22
0.00/0.04 v -x21 -x20 -x19 -x18 -x17 -x16 x15 x14 x13 x12 -x11 -x10 -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 Solving Time : 0.02
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-2666038-1276403581.opb
0.00/0.04 c Variables : 99 (99 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 185 initial, 185 maximal
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-2666038-1276403581.opb
0.00/0.04 c Variables : 95 (95 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 111 initial, 111 maximal
0.00/0.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.04 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 4 0 0 0 0 0 0 0
0.00/0.04 c logicor : 0.00 0 0 0 0 0 74 0 0
0.00/0.04 c root node : - 0 - - 0 - - - -
0.00/0.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 1 0 0 0 0 0 0
0.00/0.04 c logicor : 111 3 167 1 0 4 0 0 0 0
0.00/0.04 c countsols : 0 0 0 1 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.04 c integral : 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.04 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Propagators : Time Calls Cutoffs DomReds
0.00/0.04 c vbounds : 0.00 2 0 0
0.00/0.04 c rootredcost : 0.00 0 0 0
0.00/0.04 c pseudoobj : 0.00 4 0 0
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 0 0 0 0.0 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 0 0 0 0.0 0 0.0 -
0.00/0.04 c applied globally : - - - 0 0.0 - - -
0.00/0.04 c applied locally : - - - 0 0.0 - - -
0.00/0.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.04 c cut pool : 0.00 2 - - 0 - (maximal pool size: 4)
0.00/0.04 c redcost : 0.00 3 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 2 0 0 0 0
0.00/0.04 c intobj : 0.00 0 0 0 0 0
0.00/0.04 c cgmip : 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 2 0 0 70 0
0.00/0.04 c strongcg : 0.00 2 0 0 70 0
0.00/0.04 c cmir : 0.00 2 0 0 0 0
0.00/0.04 c flowcover : 0.00 2 0 0 0 0
0.00/0.04 c clique : 0.00 1 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0 0 0 0 0
0.00/0.04 c mcf : 0.00 1 0 0 0 0
0.00/0.04 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.04 c Pricers : Time Calls Vars
0.00/0.04 c problem variables: 0.00 0 0
0.00/0.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.04 c pscost : 0.00 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.04 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0 0 0 0 0 0
0.00/0.04 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : Time Calls Found
0.00/0.04 c LP solutions : 0.00 - 1
0.00/0.04 c pseudo solutions : 0.00 - 0
0.00/0.04 c crossover : 0.00 0 0
0.00/0.04 c trivial : 0.00 2 4
0.00/0.04 c simplerounding : 0.00 2 0
0.00/0.04 c zirounding : 0.00 0 0
0.00/0.04 c rounding : 0.00 2 1
0.00/0.04 c shifting : 0.00 2 2
0.00/0.04 c intshifting : 0.00 0 0
0.00/0.04 c oneopt : 0.00 2 1
0.00/0.04 c twoopt : 0.00 0 0
0.00/0.04 c fixandinfer : 0.00 0 0
0.00/0.04 c feaspump : 0.00 0 0
0.00/0.04 c coefdiving : 0.00 0 0
0.00/0.04 c pscostdiving : 0.00 0 0
0.00/0.04 c fracdiving : 0.00 0 0
0.00/0.04 c veclendiving : 0.00 0 0
0.00/0.04 c intdiving : 0.00 0 0
0.00/0.04 c actconsdiving : 0.00 0 0
0.00/0.04 c objpscostdiving : 0.00 0 0
0.00/0.04 c rootsoldiving : 0.00 0 0
0.00/0.04 c linesearchdiving : 0.00 0 0
0.00/0.04 c guideddiving : 0.00 0 0
0.00/0.04 c octane : 0.00 0 0
0.00/0.04 c rens : 0.00 0 0
0.00/0.04 c rins : 0.00 0 0
0.00/0.04 c localbranching : 0.00 0 0
0.00/0.04 c mutation : 0.00 0 0
0.00/0.04 c dins : 0.00 0 0
0.00/0.04 c undercover : 0.00 0 0
0.00/0.04 c nlp : 0.00 0 0
0.00/0.04 c trysol : 0.00 0 0
0.00/0.04 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.04 c primal LP : 0.00 0 0 0.00 -
0.00/0.04 c dual LP : 0.00 3 52 17.33 -
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.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 : 9 (6 improvements)
0.00/0.04 c First Solution : +4.08700000000000e+03 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.04 c Primal Bound : +6.94000000000000e+02 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <relaxation>)
0.00/0.04 c Dual Bound : +6.94000000000000e+02
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Root Dual Bound : +6.94000000000000e+02
0.00/0.04 c Root Iterations : 52
0.00/0.05 c Time complete: 0.04.