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-2664768-1276592180.opb>
0.00/0.01 c original problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 91 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.02 o 59
0.00/0.02 c feasible solution found by trivial heuristic, objective value 5.900000e+01
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 1 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.02 c (round 2) 1 del vars, 24 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.02 c (round 3) 1 del vars, 51 del conss, 1 chg bounds, 27 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.02 c (round 4) 2 del vars, 51 del conss, 1 chg bounds, 27 chg sides, 0 chg coeffs, 40 upgd conss, 2 impls, 0 clqs
0.00/0.03 c presolving (5 rounds):
0.00/0.03 c 2 deleted vars, 51 deleted constraints, 1 tightened bounds, 0 added holes, 27 changed sides, 0 changed coefficients
0.00/0.03 c 2 implications, 0 cliques
0.00/0.03 c presolved problem has 57 variables (57 bin, 0 int, 0 impl, 0 cont) and 40 constraints
0.00/0.03 c 40 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.00
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 o 58
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 | 0 | - | 364k| 0 | - | 57 | 40 | 0 | 0 | 0 | 0 | 0 | -- | 5.800000e+01 | Inf
0.00/0.03 c 0.0s| 1 | 2 | 0 | - | 363k| 0 | - | 57 | 40 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | 5.800000e+01 |5700.00%
0.00/0.03 o 8
0.00/0.03 c * 0.0s| 51 | 48 | 0 | 0.0 | 376k| 50 | - | 57 | 40 | 0 | 0 | 0 | 0 | 0 | 2.000000e+00 | 8.000000e+00 | 300.00%
0.00/0.03 o 7
0.00/0.03 c * 0.0s| 56 | 47 | 0 | 0.0 | 380k| 51 | - | 57 | 40 | 0 | 0 | 0 | 3 | 0 | 2.000000e+00 | 7.000000e+00 | 250.00%
0.59/0.62 o 6
0.59/0.62 c * 0.5s| 5273 | 42 | 0 | 0.0 | 405k| 54 | - | 57 | 49 | 0 | 0 | 0 |3020 | 0 | 2.000000e+00 | 6.000000e+00 | 200.00%
1.09/1.18 c 0.9s| 10000 | 18 | 0 | 0.0 | 408k| 54 | - | 57 | 45 | 0 | 0 | 0 |5786 | 0 | 2.000000e+00 | 6.000000e+00 | 200.00%
2.49/2.51 c 2.1s| 20000 | 16 | 0 | 0.0 | 421k| 54 | - | 57 | 47 | 0 | 0 | 0 | 11k| 0 | 2.000000e+00 | 6.000000e+00 | 200.00%
2.88/2.98 c
2.88/2.98 c SCIP Status : problem is solved [optimal solution found]
2.88/2.98 c Solving Time (sec) : 2.48
2.88/2.98 c Solving Nodes : 23284
2.88/2.98 c Primal Bound : +6.00000000000000e+00 (6 solutions)
2.88/2.98 c Dual Bound : +6.00000000000000e+00
2.88/2.98 c Gap : 0.00 %
2.88/2.98 s OPTIMUM FOUND
2.88/2.98 v -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
2.88/2.98 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
2.88/2.98 v -x7 -x6 -x5 x4 -x3 -x2 -x1
2.88/2.98 c SCIP Status : problem is solved [optimal solution found]
2.88/2.98 c Solving Time : 2.48
2.88/2.98 c Original Problem :
2.88/2.98 c Problem name : HOME/instance-2664768-1276592180.opb
2.88/2.98 c Variables : 59 (59 binary, 0 integer, 0 implicit integer, 0 continuous)
2.88/2.98 c Constraints : 91 initial, 91 maximal
2.88/2.98 c Presolved Problem :
2.88/2.98 c Problem name : t_HOME/instance-2664768-1276592180.opb
2.88/2.98 c Variables : 57 (57 binary, 0 integer, 0 implicit integer, 0 continuous)
2.88/2.98 c Constraints : 40 initial, 114 maximal
2.88/2.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.88/2.98 c trivial : 0.00 0 0 0 0 0 0 0 0
2.88/2.98 c dualfix : 0.00 1 0 0 0 0 0 0 0
2.88/2.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.88/2.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.88/2.98 c implics : 0.00 0 0 0 0 0 0 0 0
2.88/2.98 c probing : 0.00 0 0 0 0 0 0 0 0
2.88/2.98 c linear : 0.00 1 0 0 1 0 51 27 0
2.88/2.98 c logicor : 0.00 0 0 0 0 0 0 0 0
2.88/2.98 c root node : - 57 - - 57 - - - -
2.88/2.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.88/2.98 c integral : 0 0 0 0 0 0 0 0 0 0
2.88/2.98 c logicor : 40+ 0 40330 0 2 13657 22035 0 0 0
2.88/2.98 c countsols : 0 0 0 0 3 0 0 0 0 0
2.88/2.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.88/2.98 c integral : 0.00 0.00 0.00 0.00 0.00
2.88/2.98 c logicor : 0.47 0.00 0.47 0.00 0.00
2.88/2.98 c countsols : 0.00 0.00 0.00 0.00 0.00
2.88/2.98 c Propagators : Time Calls Cutoffs DomReds
2.88/2.98 c vbounds : 0.03 2 0 0
2.88/2.98 c rootredcost : 0.00 0 0 0
2.88/2.98 c pseudoobj : 0.66 65770 130 350478
2.88/2.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.88/2.98 c propagation : 0.26 13787 13741 13741 16.4 217 15.7 -
2.88/2.98 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.88/2.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.88/2.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.88/2.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.88/2.98 c applied globally : - - - 12307 13.7 - - -
2.88/2.98 c applied locally : - - - 1637 36.2 - - -
2.88/2.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.88/2.98 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.88/2.98 c redcost : 0.00 0 0 0 0 0
2.88/2.98 c impliedbounds : 0.00 0 0 0 0 0
2.88/2.98 c intobj : 0.00 0 0 0 0 0
2.88/2.98 c cgmip : 0.00 0 0 0 0 0
2.88/2.98 c gomory : 0.00 0 0 0 0 0
2.88/2.98 c strongcg : 0.00 0 0 0 0 0
2.88/2.98 c cmir : 0.00 0 0 0 0 0
2.88/2.98 c flowcover : 0.00 0 0 0 0 0
2.88/2.98 c clique : 0.00 0 0 0 0 0
2.88/2.98 c zerohalf : 0.00 0 0 0 0 0
2.88/2.98 c mcf : 0.00 0 0 0 0 0
2.88/2.98 c rapidlearning : 0.00 0 0 0 0 0
2.88/2.98 c Pricers : Time Calls Vars
2.88/2.98 c problem variables: 0.00 0 0
2.88/2.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.88/2.98 c relpscost : 0.00 0 0 0 0 0 0
2.88/2.98 c pscost : 0.00 0 0 0 0 0 0
2.88/2.98 c inference : 0.14 17238 0 0 0 0 34476
2.88/2.98 c mostinf : 0.00 0 0 0 0 0 0
2.88/2.98 c leastinf : 0.00 0 0 0 0 0 0
2.88/2.98 c fullstrong : 0.00 0 0 0 0 0 0
2.88/2.98 c allfullstrong : 0.00 0 0 0 0 0 0
2.88/2.98 c random : 0.00 0 0 0 0 0 0
2.88/2.98 c Primal Heuristics : Time Calls Found
2.88/2.98 c LP solutions : 0.00 - 0
2.88/2.98 c pseudo solutions : 0.00 - 3
2.88/2.98 c oneopt : 0.01 0 0
2.88/2.98 c trivial : 0.00 2 3
2.88/2.98 c simplerounding : 0.00 0 0
2.88/2.98 c zirounding : 0.00 0 0
2.88/2.98 c rounding : 0.00 0 0
2.88/2.98 c shifting : 0.00 0 0
2.88/2.98 c intshifting : 0.00 0 0
2.88/2.98 c twoopt : 0.00 0 0
2.88/2.98 c fixandinfer : 0.00 0 0
2.88/2.98 c feaspump : 0.00 0 0
2.88/2.98 c coefdiving : 0.00 0 0
2.88/2.98 c pscostdiving : 0.00 0 0
2.88/2.98 c fracdiving : 0.00 0 0
2.88/2.98 c veclendiving : 0.00 0 0
2.88/2.98 c intdiving : 0.00 0 0
2.88/2.98 c actconsdiving : 0.00 0 0
2.88/2.98 c objpscostdiving : 0.00 0 0
2.88/2.98 c rootsoldiving : 0.00 0 0
2.88/2.98 c linesearchdiving : 0.00 0 0
2.88/2.98 c guideddiving : 0.00 0 0
2.88/2.98 c octane : 0.00 0 0
2.88/2.98 c rens : 0.00 0 0
2.88/2.98 c rins : 0.00 0 0
2.88/2.98 c localbranching : 0.00 0 0
2.88/2.98 c mutation : 0.00 0 0
2.88/2.98 c crossover : 0.00 0 0
2.88/2.98 c dins : 0.00 0 0
2.88/2.98 c undercover : 0.00 0 0
2.88/2.98 c nlp : 0.01 0 0
2.88/2.98 c trysol : 0.01 0 0
2.88/2.98 c LP : Time Calls Iterations Iter/call Iter/sec
2.88/2.98 c primal LP : 0.00 0 0 0.00 -
2.88/2.98 c dual LP : 0.00 0 0 0.00 -
2.88/2.98 c lex dual LP : 0.00 0 0 0.00 -
2.88/2.98 c barrier LP : 0.00 0 0 0.00 -
2.88/2.98 c diving/probing LP: 0.00 0 0 0.00 -
2.88/2.98 c strong branching : 0.00 0 0 0.00 -
2.88/2.98 c (at root node) : - 0 0 0.00 -
2.88/2.98 c conflict analysis: 0.00 0 0 0.00 -
2.88/2.98 c B&B Tree :
2.88/2.98 c number of runs : 1
2.88/2.98 c nodes : 23284
2.88/2.98 c nodes (total) : 23284
2.88/2.98 c nodes left : 0
2.88/2.98 c max depth : 54
2.88/2.98 c max depth (total): 54
2.88/2.98 c backtracks : 10737 (46.1%)
2.88/2.98 c delayed cutoffs : 11182
2.88/2.98 c repropagations : 24509 (219653 domain reductions, 7744 cutoffs)
2.88/2.98 c avg switch length: 3.08
2.88/2.98 c switching time : 0.37
2.88/2.98 c Solution :
2.88/2.98 c Solutions found : 6 (5 improvements)
2.88/2.98 c First Solution : +5.90000000000000e+01 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
2.88/2.98 c Primal Bound : +6.00000000000000e+00 (in run 1, after 5273 nodes, 0.48 seconds, depth 54, found by <relaxation>)
2.88/2.98 c Dual Bound : +6.00000000000000e+00
2.88/2.98 c Gap : 0.00 %
2.88/2.98 c Root Dual Bound : +1.00000000000000e+00
2.88/2.98 c Root Iterations : 0
2.88/2.99 c Time complete: 2.98.