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-2663802-1276659745.opb>
0.00/0.01 c original problem has 355 variables (355 bin, 0 int, 0 impl, 0 cont) and 355 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 0
0.00/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.02 c presolving:
0.02/0.06 c (round 1) 305 del vars, 50 del conss, 305 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1220 impls, 0 clqs
0.02/0.07 c presolving (2 rounds):
0.02/0.07 c 305 deleted vars, 50 deleted constraints, 305 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.07 c 1830 implications, 0 cliques
0.02/0.07 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 305 constraints
0.02/0.07 c 305 constraints of type <logicor>
0.02/0.07 c transformed objective value is always integral (scale: 1)
0.02/0.07 c Presolving Time: 0.04
0.02/0.07 c - non default parameters ----------------------------------------------------------------------
0.02/0.07 c # SCIP version 1.2.1.2
0.02/0.07 c
0.02/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07 c conflict/interconss = 0
0.02/0.07 c
0.02/0.07 c # should binary conflicts be preferred?
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c conflict/preferbinary = TRUE
0.02/0.07 c
0.02/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.07 c constraints/agelimit = 1
0.02/0.07 c
0.02/0.07 c # should enforcement of pseudo solution be disabled?
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/disableenfops = TRUE
0.02/0.07 c
0.02/0.07 c # frequency for displaying node information lines
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.07 c display/freq = 10000
0.02/0.07 c
0.02/0.07 c # maximal time in seconds to run
0.02/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07 c limits/time = 1800
0.02/0.07 c
0.02/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07 c limits/memory = 1620
0.02/0.07 c
0.02/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07 c lp/solvefreq = -1
0.02/0.07 c
0.02/0.07 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.02/0.07 c # [type: char, range: {lafpsqd}, default: l]
0.02/0.07 c lp/pricing = a
0.02/0.07 c
0.02/0.07 c # should presolving try to simplify inequalities
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/linear/simplifyinequalities = TRUE
0.02/0.07 c
0.02/0.07 c # should presolving try to simplify knapsacks
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.07 c
0.02/0.07 c # priority of node selection rule <dfs> in standard mode
0.02/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.02/0.07 c nodeselection/dfs/stdpriority = 1000000
0.02/0.07 c
0.02/0.07 c -----------------------------------------------------------------------------------------------
0.02/0.07 c start solving
0.02/0.07 c
0.02/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.07 c t 0.0s| 1 | 2 | 0 | - | 929k| 0 | - | 50 | 305 | 0 | 0 | 0 | 0 | 0 |-5.000000e+01 | 0.000000e+00 | 100.00%
0.02/0.08 o -8
0.02/0.08 c * 0.0s| 9 | 5 | 0 | 0.0 | 933k| 8 | - | 50 | 305 | 0 | 0 | 0 | 0 | 0 |-4.900000e+01 |-8.000000e+00 | 83.67%
0.02/0.09 o -9
0.02/0.09 c * 0.1s| 158 | 5 | 0 | 0.0 | 934k| 14 | - | 50 | 305 | 0 | 0 | 0 | 5 | 0 |-4.900000e+01 |-9.000000e+00 | 81.63%
0.02/0.09 o -10
0.02/0.09 c * 0.1s| 230 | 6 | 0 | 0.0 | 935k| 14 | - | 50 | 305 | 0 | 0 | 0 | 6 | 0 |-4.900000e+01 |-1.000000e+01 | 79.59%
0.09/0.14 o -11
0.09/0.14 c * 0.1s| 835 | 6 | 0 | 0.0 | 936k| 22 | - | 50 | 305 | 0 | 0 | 0 | 15 | 0 |-4.800000e+01 |-1.100000e+01 | 77.08%
0.19/0.24 o -12
0.19/0.24 c * 0.2s| 1617 | 7 | 0 | 0.0 | 958k| 22 | - | 50 | 377 | 0 | 0 | 0 | 479 | 0 |-4.800000e+01 |-1.200000e+01 | 75.00%
1.00/1.04 c
1.00/1.04 c SCIP Status : problem is solved [optimal solution found]
1.00/1.04 c Solving Time (sec) : 0.83
1.00/1.04 c Solving Nodes : 7667
1.00/1.04 c Primal Bound : -1.20000000000000e+01 (7 solutions)
1.00/1.04 c Dual Bound : -1.20000000000000e+01
1.00/1.04 c Gap : 0.00 %
1.00/1.04 s OPTIMUM FOUND
1.00/1.04 v -x50 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 -x24
1.00/1.04 v -x23 -x22 x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.00/1.04 c SCIP Status : problem is solved [optimal solution found]
1.00/1.04 c Solving Time : 0.83
1.00/1.04 c Original Problem :
1.00/1.04 c Problem name : HOME/instance-2663802-1276659745.opb
1.00/1.04 c Variables : 355 (355 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.04 c Constraints : 355 initial, 355 maximal
1.00/1.04 c Presolved Problem :
1.00/1.04 c Problem name : t_HOME/instance-2663802-1276659745.opb
1.00/1.04 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.04 c Constraints : 305 initial, 515 maximal
1.00/1.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.00/1.04 c trivial : 0.00 0 0 0 0 0 0 0 0
1.00/1.04 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.00/1.04 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.00/1.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.00/1.04 c implics : 0.00 0 0 0 0 0 0 0 0
1.00/1.04 c probing : 0.01 0 0 0 0 0 0 0 0
1.00/1.04 c linear : 0.00 305 0 0 305 0 50 0 0
1.00/1.04 c logicor : 0.00 0 0 0 0 0 0 0 0
1.00/1.04 c root node : - 50 - - 50 - - - -
1.00/1.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.00/1.04 c integral : 0 0 0 0 0 0 0 0 0 0
1.00/1.04 c logicor : 305+ 0 11265 0 5 2329 20588 0 0 0
1.00/1.04 c countsols : 0 0 0 0 5 0 0 0 0 0
1.00/1.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.00/1.04 c integral : 0.00 0.00 0.00 0.00 0.00
1.00/1.04 c logicor : 0.16 0.00 0.16 0.00 0.00
1.00/1.04 c countsols : 0.00 0.00 0.00 0.00 0.00
1.00/1.04 c Propagators : Time Calls Cutoffs DomReds
1.00/1.04 c vbounds : 0.00 2 0 0
1.00/1.04 c rootredcost : 0.03 0 0 0
1.00/1.04 c pseudoobj : 0.17 28281 2126 21063
1.00/1.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.00/1.04 c propagation : 0.09 4455 4062 4062 4.0 0 0.0 -
1.00/1.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.04 c applied globally : - - - 4062 4.0 - - -
1.00/1.04 c applied locally : - - - 0 0.0 - - -
1.00/1.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.00/1.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.00/1.04 c redcost : 0.00 0 0 0 0 0
1.00/1.04 c impliedbounds : 0.00 0 0 0 0 0
1.00/1.04 c intobj : 0.00 0 0 0 0 0
1.00/1.04 c cgmip : 0.00 0 0 0 0 0
1.00/1.04 c gomory : 0.00 0 0 0 0 0
1.00/1.04 c strongcg : 0.00 0 0 0 0 0
1.00/1.04 c cmir : 0.00 0 0 0 0 0
1.00/1.04 c flowcover : 0.00 0 0 0 0 0
1.00/1.04 c clique : 0.00 0 0 0 0 0
1.00/1.04 c zerohalf : 0.00 0 0 0 0 0
1.00/1.04 c mcf : 0.00 0 0 0 0 0
1.00/1.04 c rapidlearning : 0.00 0 0 0 0 0
1.00/1.04 c Pricers : Time Calls Vars
1.00/1.04 c problem variables: 0.00 0 0
1.00/1.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.00/1.04 c relpscost : 0.00 0 0 0 0 0 0
1.00/1.04 c pscost : 0.00 0 0 0 0 0 0
1.00/1.04 c inference : 0.01 4544 0 0 0 0 9088
1.00/1.04 c mostinf : 0.00 0 0 0 0 0 0
1.00/1.04 c leastinf : 0.00 0 0 0 0 0 0
1.00/1.04 c fullstrong : 0.00 0 0 0 0 0 0
1.00/1.04 c allfullstrong : 0.00 0 0 0 0 0 0
1.00/1.04 c random : 0.00 0 0 0 0 0 0
1.00/1.04 c Primal Heuristics : Time Calls Found
1.00/1.04 c LP solutions : 0.00 - 0
1.00/1.04 c pseudo solutions : 0.00 - 5
1.00/1.04 c oneopt : 0.00 0 0
1.00/1.04 c trivial : 0.00 2 2
1.00/1.04 c simplerounding : 0.00 0 0
1.00/1.04 c zirounding : 0.00 0 0
1.00/1.04 c rounding : 0.00 0 0
1.00/1.04 c shifting : 0.00 0 0
1.00/1.04 c intshifting : 0.00 0 0
1.00/1.04 c twoopt : 0.00 0 0
1.00/1.04 c fixandinfer : 0.00 0 0
1.00/1.04 c feaspump : 0.00 0 0
1.00/1.04 c coefdiving : 0.00 0 0
1.00/1.04 c pscostdiving : 0.00 0 0
1.00/1.04 c fracdiving : 0.00 0 0
1.00/1.04 c veclendiving : 0.00 0 0
1.00/1.04 c intdiving : 0.00 0 0
1.00/1.04 c actconsdiving : 0.00 0 0
1.00/1.04 c objpscostdiving : 0.00 0 0
1.00/1.04 c rootsoldiving : 0.00 0 0
1.00/1.04 c linesearchdiving : 0.00 0 0
1.00/1.04 c guideddiving : 0.00 0 0
1.00/1.04 c octane : 0.00 0 0
1.00/1.04 c rens : 0.00 0 0
1.00/1.04 c rins : 0.00 0 0
1.00/1.04 c localbranching : 0.00 0 0
1.00/1.04 c mutation : 0.00 0 0
1.00/1.04 c crossover : 0.00 0 0
1.00/1.04 c dins : 0.00 0 0
1.00/1.04 c undercover : 0.00 0 0
1.00/1.04 c nlp : 0.01 0 0
1.00/1.04 c trysol : 0.01 0 0
1.00/1.04 c LP : Time Calls Iterations Iter/call Iter/sec
1.00/1.04 c primal LP : 0.00 0 0 0.00 -
1.00/1.04 c dual LP : 0.00 0 0 0.00 -
1.00/1.04 c lex dual LP : 0.00 0 0 0.00 -
1.00/1.04 c barrier LP : 0.00 0 0 0.00 -
1.00/1.04 c diving/probing LP: 0.00 0 0 0.00 -
1.00/1.04 c strong branching : 0.00 0 0 0.00 -
1.00/1.04 c (at root node) : - 0 0 0.00 -
1.00/1.04 c conflict analysis: 0.00 0 0 0.00 -
1.00/1.04 c B&B Tree :
1.00/1.04 c number of runs : 1
1.00/1.04 c nodes : 7667
1.00/1.04 c nodes (total) : 7667
1.00/1.04 c nodes left : 0
1.00/1.04 c max depth : 37
1.00/1.04 c max depth (total): 37
1.00/1.04 c backtracks : 1484 (19.4%)
1.00/1.04 c delayed cutoffs : 1413
1.00/1.04 c repropagations : 12073 (16569 domain reductions, 1337 cutoffs)
1.00/1.04 c avg switch length: 4.09
1.00/1.04 c switching time : 0.11
1.00/1.04 c Solution :
1.00/1.04 c Solutions found : 7 (6 improvements)
1.00/1.04 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.00/1.04 c Primal Bound : -1.20000000000000e+01 (in run 1, after 1617 nodes, 0.17 seconds, depth 17, found by <relaxation>)
1.00/1.04 c Dual Bound : -1.20000000000000e+01
1.00/1.04 c Gap : 0.00 %
1.00/1.04 c Root Dual Bound : -5.00000000000000e+01
1.00/1.04 c Root Iterations : 0
1.00/1.04 c Time complete: 1.03.