0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2663947-1276637355.opb>
0.00/0.01 c original problem has 103 variables (103 bin, 0 int, 0 impl, 0 cont) and 224 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 39 del vars, 75 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 420 impls, 0 clqs
0.00/0.02 c (round 2) 40 del vars, 98 del conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 420 impls, 0 clqs
0.00/0.02 c (round 3) 40 del vars, 100 del conss, 2 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 420 impls, 0 clqs
0.00/0.02 c (round 4) 40 del vars, 100 del conss, 2 chg bounds, 1 chg sides, 0 chg coeffs, 111 upgd conss, 420 impls, 0 clqs
0.00/0.03 c (round 5) 40 del vars, 100 del conss, 2 chg bounds, 1 chg sides, 0 chg coeffs, 124 upgd conss, 420 impls, 0 clqs
0.00/0.03 c (round 6) 43 del vars, 100 del conss, 2 chg bounds, 1 chg sides, 0 chg coeffs, 124 upgd conss, 480 impls, 0 clqs
0.00/0.03 c presolving (7 rounds):
0.00/0.03 c 43 deleted vars, 100 deleted constraints, 2 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.03 c 480 implications, 0 cliques
0.00/0.03 c presolved problem has 60 variables (60 bin, 0 int, 0 impl, 0 cont) and 124 constraints
0.00/0.03 c 124 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 = -1
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 0.0s| 1 | 2 | 0 | - | 466k| 0 | - | 60 | 124 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.00/0.04 o 5
0.00/0.04 c * 0.0s| 18 | 16 | 0 | 0.0 | 472k| 17 | - | 60 | 124 | 0 | 0 | 0 | 0 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.03/0.09 c
0.03/0.09 c SCIP Status : problem is solved [optimal solution found]
0.03/0.09 c Solving Time (sec) : 0.06
0.03/0.09 c Solving Nodes : 360
0.03/0.09 c Primal Bound : +5.00000000000000e+00 (1 solutions)
0.03/0.09 c Dual Bound : +5.00000000000000e+00
0.03/0.09 c Gap : 0.00 %
0.03/0.09 s OPTIMUM FOUND
0.03/0.09 v x18 -x17 x16 -x15 -x14 x13 -x12 x11 -x10 -x101 -x99 x96 -x9 x8 x7 -x6 -x90 x5 -x88 -x85 -x4 -x83 -x80 -x77 -x74 -x3 -x72 -x70 -x67
0.03/0.09 v -x65 -x63 -x2 -x61 -x59 -x57 -x55 -x53 -x50 -x1 -x48 -x46 -x44 -x42 x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19
0.03/0.09 v -x103 -x102 -x100 -x98 x97 -x95 x94 -x93 x92 -x91 -x89 -x87 -x86 -x84 x82 -x81 -x79 -x78 -x76 -x75 -x73 -x71 -x69 -x68 -x66
0.03/0.09 v -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x51 -x49 -x47 -x45 -x43 -x41 x40 -x38 -x36 -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20
0.03/0.09 c SCIP Status : problem is solved [optimal solution found]
0.03/0.09 c Solving Time : 0.06
0.03/0.09 c Original Problem :
0.03/0.09 c Problem name : HOME/instance-2663947-1276637355.opb
0.03/0.09 c Variables : 103 (103 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.09 c Constraints : 224 initial, 224 maximal
0.03/0.09 c Presolved Problem :
0.03/0.09 c Problem name : t_HOME/instance-2663947-1276637355.opb
0.03/0.09 c Variables : 60 (60 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.09 c Constraints : 124 initial, 142 maximal
0.03/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.03/0.09 c trivial : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c implics : 0.00 0 2 0 0 0 0 0 0
0.03/0.09 c probing : 0.01 0 3 0 0 0 0 0 0
0.03/0.09 c linear : 0.00 2 36 0 2 0 100 1 0
0.03/0.09 c logicor : 0.00 0 0 0 0 0 0 0 0
0.03/0.09 c root node : - 60 - - 60 - - - -
0.03/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.03/0.09 c integral : 0 0 0 0 0 0 0 0 0 0
0.03/0.09 c logicor : 124+ 0 834 0 1 188 941 0 0 0
0.03/0.09 c countsols : 0 0 0 0 1 0 0 0 0 0
0.03/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.03/0.09 c integral : 0.00 0.00 0.00 0.00 0.00
0.03/0.09 c logicor : 0.01 0.00 0.01 0.00 0.00
0.03/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00
0.03/0.09 c Propagators : Time Calls Cutoffs DomReds
0.03/0.09 c vbounds : 0.00 2 0 0
0.03/0.09 c rootredcost : 0.00 0 0 0
0.03/0.09 c pseudoobj : 0.01 1086 13 5016
0.03/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.03/0.09 c propagation : 0.00 201 183 183 6.1 0 0.0 -
0.03/0.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.09 c applied globally : - - - 183 6.1 - - -
0.03/0.09 c applied locally : - - - 0 0.0 - - -
0.03/0.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.03/0.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.03/0.09 c redcost : 0.00 0 0 0 0 0
0.03/0.09 c impliedbounds : 0.00 0 0 0 0 0
0.03/0.09 c intobj : 0.00 0 0 0 0 0
0.03/0.09 c cgmip : 0.00 0 0 0 0 0
0.03/0.09 c gomory : 0.00 0 0 0 0 0
0.03/0.09 c strongcg : 0.00 0 0 0 0 0
0.03/0.09 c cmir : 0.00 0 0 0 0 0
0.03/0.09 c flowcover : 0.00 0 0 0 0 0
0.03/0.09 c clique : 0.00 0 0 0 0 0
0.03/0.09 c zerohalf : 0.00 0 0 0 0 0
0.03/0.09 c mcf : 0.00 0 0 0 0 0
0.03/0.09 c rapidlearning : 0.00 0 0 0 0 0
0.03/0.09 c Pricers : Time Calls Vars
0.03/0.09 c problem variables: 0.00 0 0
0.03/0.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.03/0.09 c relpscost : 0.00 0 0 0 0 0 0
0.03/0.09 c pscost : 0.00 0 0 0 0 0 0
0.03/0.09 c inference : 0.00 258 0 0 0 0 516
0.03/0.09 c mostinf : 0.00 0 0 0 0 0 0
0.03/0.09 c leastinf : 0.00 0 0 0 0 0 0
0.03/0.09 c fullstrong : 0.00 0 0 0 0 0 0
0.03/0.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.03/0.09 c random : 0.00 0 0 0 0 0 0
0.03/0.09 c Primal Heuristics : Time Calls Found
0.03/0.09 c LP solutions : 0.00 - 0
0.03/0.09 c pseudo solutions : 0.00 - 1
0.03/0.09 c oneopt : 0.00 0 0
0.03/0.09 c trivial : 0.00 2 0
0.03/0.09 c simplerounding : 0.00 0 0
0.03/0.09 c zirounding : 0.00 0 0
0.03/0.09 c rounding : 0.00 0 0
0.03/0.09 c shifting : 0.00 0 0
0.03/0.09 c intshifting : 0.00 0 0
0.03/0.09 c twoopt : 0.00 0 0
0.03/0.09 c fixandinfer : 0.00 0 0
0.03/0.09 c feaspump : 0.00 0 0
0.03/0.09 c coefdiving : 0.00 0 0
0.03/0.09 c pscostdiving : 0.00 0 0
0.03/0.09 c fracdiving : 0.00 0 0
0.03/0.09 c veclendiving : 0.00 0 0
0.03/0.09 c intdiving : 0.00 0 0
0.03/0.09 c actconsdiving : 0.00 0 0
0.03/0.09 c objpscostdiving : 0.00 0 0
0.03/0.09 c rootsoldiving : 0.00 0 0
0.03/0.09 c linesearchdiving : 0.00 0 0
0.03/0.09 c guideddiving : 0.00 0 0
0.03/0.09 c octane : 0.00 0 0
0.03/0.09 c rens : 0.00 0 0
0.03/0.09 c rins : 0.00 0 0
0.03/0.09 c localbranching : 0.00 0 0
0.03/0.09 c mutation : 0.00 0 0
0.03/0.09 c crossover : 0.00 0 0
0.03/0.09 c dins : 0.00 0 0
0.03/0.09 c undercover : 0.00 0 0
0.03/0.09 c nlp : 0.00 0 0
0.03/0.09 c trysol : 0.00 0 0
0.03/0.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.03/0.09 c primal LP : 0.00 0 0 0.00 -
0.03/0.09 c dual LP : 0.00 0 0 0.00 -
0.03/0.09 c lex dual LP : 0.00 0 0 0.00 -
0.03/0.09 c barrier LP : 0.00 0 0 0.00 -
0.03/0.09 c diving/probing LP: 0.00 0 0 0.00 -
0.03/0.09 c strong branching : 0.00 0 0 0.00 -
0.03/0.09 c (at root node) : - 0 0 0.00 -
0.03/0.09 c conflict analysis: 0.00 0 0 0.00 -
0.03/0.09 c B&B Tree :
0.03/0.09 c number of runs : 1
0.03/0.09 c nodes : 360
0.03/0.09 c nodes (total) : 360
0.03/0.09 c nodes left : 0
0.03/0.09 c max depth : 23
0.03/0.09 c max depth (total): 23
0.03/0.09 c backtracks : 149 (41.4%)
0.03/0.09 c delayed cutoffs : 156
0.03/0.09 c repropagations : 376 (3185 domain reductions, 100 cutoffs)
0.03/0.09 c avg switch length: 3.21
0.03/0.09 c switching time : 0.02
0.03/0.09 c Solution :
0.03/0.09 c Solutions found : 1 (1 improvements)
0.03/0.09 c First Solution : +5.00000000000000e+00 (in run 1, after 18 nodes, 0.02 seconds, depth 17, found by <relaxation>)
0.03/0.09 c Primal Bound : +5.00000000000000e+00 (in run 1, after 18 nodes, 0.02 seconds, depth 17, found by <relaxation>)
0.03/0.09 c Dual Bound : +5.00000000000000e+00
0.03/0.09 c Gap : 0.00 %
0.03/0.09 c Root Dual Bound : +1.00000000000000e+00
0.03/0.09 c Root Iterations : 0
0.03/0.09 c Time complete: 0.09.