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-2663795-1276658760.opb>
0.00/0.01 c original problem has 353 variables (353 bin, 0 int, 0 impl, 0 cont) and 353 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.00/0.06 c (round 1) 303 del vars, 50 del conss, 303 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1212 impls, 0 clqs
0.00/0.07 c presolving (2 rounds):
0.00/0.07 c 303 deleted vars, 50 deleted constraints, 303 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.07 c 1818 implications, 0 cliques
0.00/0.07 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 303 constraints
0.00/0.07 c 303 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.04
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c conflict/interconss = 0
0.00/0.07 c
0.00/0.07 c # should binary conflicts be preferred?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c conflict/preferbinary = TRUE
0.00/0.07 c
0.00/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c constraints/agelimit = 1
0.00/0.07 c
0.00/0.07 c # should enforcement of pseudo solution be disabled?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/disableenfops = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c lp/solvefreq = -1
0.00/0.07 c
0.00/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.00/0.07 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.07 c lp/pricing = a
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # priority of node selection rule <dfs> in standard mode
0.00/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.07 c nodeselection/dfs/stdpriority = 1000000
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/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.00/0.07 c t 0.1s| 1 | 2 | 0 | - | 925k| 0 | - | 50 | 303 | 0 | 0 | 0 | 0 | 0 |-5.000000e+01 | 0.000000e+00 | 100.00%
0.00/0.07 o -8
0.00/0.07 c * 0.1s| 9 | 6 | 0 | 0.0 | 929k| 8 | - | 50 | 303 | 0 | 0 | 0 | 0 | 0 |-4.900000e+01 |-8.000000e+00 | 83.67%
0.00/0.07 o -9
0.00/0.07 c * 0.1s| 20 | 6 | 0 | 0.0 | 930k| 9 | - | 50 | 304 | 0 | 0 | 0 | 1 | 0 |-4.900000e+01 |-9.000000e+00 | 81.63%
0.08/0.09 o -10
0.08/0.09 c * 0.1s| 191 | 7 | 0 | 0.0 | 931k| 13 | - | 50 | 303 | 0 | 0 | 0 | 4 | 0 |-4.900000e+01 |-1.000000e+01 | 79.59%
0.09/0.10 o -12
0.09/0.10 c * 0.1s| 329 | 5 | 0 | 0.0 | 932k| 15 | - | 50 | 304 | 0 | 0 | 0 | 8 | 0 |-4.900000e+01 |-1.200000e+01 | 75.51%
0.49/0.53 o -13
0.49/0.53 c * 0.4s| 3729 | 5 | 0 | 0.0 | 949k| 27 | - | 50 | 304 | 0 | 0 | 0 |1791 | 0 |-4.500000e+01 |-1.300000e+01 | 71.11%
0.89/0.92 c
0.89/0.92 c SCIP Status : problem is solved [optimal solution found]
0.89/0.92 c Solving Time (sec) : 0.74
0.89/0.92 c Solving Nodes : 6656
0.89/0.92 c Primal Bound : -1.30000000000000e+01 (7 solutions)
0.89/0.92 c Dual Bound : -1.30000000000000e+01
0.89/0.92 c Gap : 0.00 %
0.89/0.92 s OPTIMUM FOUND
0.89/0.92 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 -x23
0.89/0.92 v -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.89/0.92 c SCIP Status : problem is solved [optimal solution found]
0.89/0.92 c Solving Time : 0.74
0.89/0.92 c Original Problem :
0.89/0.92 c Problem name : HOME/instance-2663795-1276658760.opb
0.89/0.92 c Variables : 353 (353 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.92 c Constraints : 353 initial, 353 maximal
0.89/0.92 c Presolved Problem :
0.89/0.92 c Problem name : t_HOME/instance-2663795-1276658760.opb
0.89/0.92 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.92 c Constraints : 303 initial, 496 maximal
0.89/0.92 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.92 c trivial : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c probing : 0.01 0 0 0 0 0 0 0 0
0.89/0.92 c linear : 0.00 303 0 0 303 0 50 0 0
0.89/0.92 c logicor : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c root node : - 50 - - 50 - - - -
0.89/0.92 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.92 c integral : 0 0 0 0 0 0 0 0 0 0
0.89/0.92 c logicor : 303+ 0 9695 0 5 1951 18613 0 0 0
0.89/0.92 c countsols : 0 0 0 0 5 0 0 0 0 0
0.89/0.92 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.92 c integral : 0.00 0.00 0.00 0.00 0.00
0.89/0.92 c logicor : 0.11 0.00 0.11 0.00 0.00
0.89/0.92 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.92 c Propagators : Time Calls Cutoffs DomReds
0.89/0.92 c vbounds : 0.00 2 0 0
0.89/0.92 c rootredcost : 0.01 0 0 0
0.89/0.92 c pseudoobj : 0.25 24908 1899 19131
0.89/0.92 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.92 c propagation : 0.09 3850 3513 3513 3.6 0 0.0 -
0.89/0.92 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.92 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.92 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.92 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.92 c applied globally : - - - 3513 3.6 - - -
0.89/0.92 c applied locally : - - - 0 0.0 - - -
0.89/0.92 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.92 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.89/0.92 c redcost : 0.00 0 0 0 0 0
0.89/0.92 c impliedbounds : 0.00 0 0 0 0 0
0.89/0.92 c intobj : 0.00 0 0 0 0 0
0.89/0.92 c cgmip : 0.00 0 0 0 0 0
0.89/0.92 c gomory : 0.00 0 0 0 0 0
0.89/0.92 c strongcg : 0.00 0 0 0 0 0
0.89/0.92 c cmir : 0.00 0 0 0 0 0
0.89/0.92 c flowcover : 0.00 0 0 0 0 0
0.89/0.92 c clique : 0.00 0 0 0 0 0
0.89/0.92 c zerohalf : 0.00 0 0 0 0 0
0.89/0.92 c mcf : 0.00 0 0 0 0 0
0.89/0.92 c rapidlearning : 0.00 0 0 0 0 0
0.89/0.92 c Pricers : Time Calls Vars
0.89/0.92 c problem variables: 0.00 0 0
0.89/0.92 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.92 c relpscost : 0.00 0 0 0 0 0 0
0.89/0.92 c pscost : 0.00 0 0 0 0 0 0
0.89/0.92 c inference : 0.03 3922 0 0 0 0 7844
0.89/0.92 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.92 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.92 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.92 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.92 c random : 0.00 0 0 0 0 0 0
0.89/0.92 c Primal Heuristics : Time Calls Found
0.89/0.92 c LP solutions : 0.00 - 0
0.89/0.92 c pseudo solutions : 0.00 - 5
0.89/0.92 c oneopt : 0.00 0 0
0.89/0.92 c trivial : 0.00 2 2
0.89/0.92 c simplerounding : 0.00 0 0
0.89/0.92 c zirounding : 0.00 0 0
0.89/0.92 c rounding : 0.00 0 0
0.89/0.92 c shifting : 0.00 0 0
0.89/0.92 c intshifting : 0.00 0 0
0.89/0.92 c twoopt : 0.00 0 0
0.89/0.92 c fixandinfer : 0.00 0 0
0.89/0.92 c feaspump : 0.00 0 0
0.89/0.92 c coefdiving : 0.00 0 0
0.89/0.92 c pscostdiving : 0.00 0 0
0.89/0.92 c fracdiving : 0.00 0 0
0.89/0.92 c veclendiving : 0.00 0 0
0.89/0.92 c intdiving : 0.00 0 0
0.89/0.92 c actconsdiving : 0.00 0 0
0.89/0.92 c objpscostdiving : 0.00 0 0
0.89/0.92 c rootsoldiving : 0.00 0 0
0.89/0.92 c linesearchdiving : 0.00 0 0
0.89/0.92 c guideddiving : 0.00 0 0
0.89/0.92 c octane : 0.00 0 0
0.89/0.92 c rens : 0.00 0 0
0.89/0.92 c rins : 0.00 0 0
0.89/0.92 c localbranching : 0.00 0 0
0.89/0.92 c mutation : 0.00 0 0
0.89/0.92 c crossover : 0.00 0 0
0.89/0.92 c dins : 0.00 0 0
0.89/0.92 c undercover : 0.00 0 0
0.89/0.92 c nlp : 0.00 0 0
0.89/0.92 c trysol : 0.02 0 0
0.89/0.92 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.92 c primal LP : 0.00 0 0 0.00 -
0.89/0.92 c dual LP : 0.00 0 0 0.00 -
0.89/0.92 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.92 c barrier LP : 0.00 0 0 0.00 -
0.89/0.92 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.92 c strong branching : 0.00 0 0 0.00 -
0.89/0.92 c (at root node) : - 0 0 0.00 -
0.89/0.92 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.92 c B&B Tree :
0.89/0.92 c number of runs : 1
0.89/0.92 c nodes : 6656
0.89/0.92 c nodes (total) : 6656
0.89/0.92 c nodes left : 0
0.89/0.92 c max depth : 36
0.89/0.92 c max depth (total): 36
0.89/0.92 c backtracks : 1238 (18.6%)
0.89/0.92 c delayed cutoffs : 1175
0.89/0.92 c repropagations : 10859 (14907 domain reductions, 1121 cutoffs)
0.89/0.92 c avg switch length: 4.21
0.89/0.92 c switching time : 0.08
0.89/0.92 c Solution :
0.89/0.92 c Solutions found : 7 (6 improvements)
0.89/0.92 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.89/0.92 c Primal Bound : -1.30000000000000e+01 (in run 1, after 3729 nodes, 0.43 seconds, depth 20, found by <relaxation>)
0.89/0.92 c Dual Bound : -1.30000000000000e+01
0.89/0.92 c Gap : 0.00 %
0.89/0.92 c Root Dual Bound : -5.00000000000000e+01
0.89/0.92 c Root Iterations : 0
0.89/0.93 c Time complete: 0.92.