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-2663830-1276662671.opb>
0.00/0.01 c original problem has 790 variables (790 bin, 0 int, 0 impl, 0 cont) and 790 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.09/0.19 c (round 1) 740 del vars, 50 del conss, 740 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2960 impls, 0 clqs
0.19/0.21 c presolving (2 rounds):
0.19/0.21 c 740 deleted vars, 50 deleted constraints, 740 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.21 c 4440 implications, 0 cliques
0.19/0.21 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 740 constraints
0.19/0.21 c 740 constraints of type <logicor>
0.19/0.21 c transformed objective value is always integral (scale: 1)
0.19/0.21 c Presolving Time: 0.10
0.19/0.21 c - non default parameters ----------------------------------------------------------------------
0.19/0.21 c # SCIP version 1.2.1.2
0.19/0.21 c
0.19/0.21 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.21 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.21 c conflict/interconss = 0
0.19/0.21 c
0.19/0.21 c # should binary conflicts be preferred?
0.19/0.21 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.21 c conflict/preferbinary = TRUE
0.19/0.21 c
0.19/0.21 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.21 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.21 c constraints/agelimit = 1
0.19/0.21 c
0.19/0.21 c # should enforcement of pseudo solution be disabled?
0.19/0.21 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.21 c constraints/disableenfops = TRUE
0.19/0.21 c
0.19/0.21 c # frequency for displaying node information lines
0.19/0.21 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.21 c display/freq = 10000
0.19/0.21 c
0.19/0.21 c # maximal time in seconds to run
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22 c limits/time = 1799.99
0.19/0.22 c
0.19/0.22 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22 c limits/memory = 1620
0.19/0.22 c
0.19/0.22 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22 c lp/solvefreq = -1
0.19/0.22 c
0.19/0.22 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.19/0.22 c # [type: char, range: {lafpsqd}, default: l]
0.19/0.22 c lp/pricing = a
0.19/0.22 c
0.19/0.22 c # should presolving try to simplify inequalities
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/linear/simplifyinequalities = TRUE
0.19/0.22 c
0.19/0.22 c # should presolving try to simplify knapsacks
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.22 c
0.19/0.22 c # priority of node selection rule <dfs> in standard mode
0.19/0.22 c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.22 c nodeselection/dfs/stdpriority = 1000000
0.19/0.22 c
0.19/0.22 c -----------------------------------------------------------------------------------------------
0.19/0.22 c start solving
0.19/0.22 c
0.19/0.22 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.22 c t 0.1s| 1 | 2 | 0 | - |1884k| 0 | - | 50 | 740 | 0 | 0 | 0 | 0 | 0 |-5.000000e+01 | 0.000000e+00 | 100.00%
0.19/0.22 o -4
0.19/0.22 c * 0.1s| 5 | 2 | 0 | 0.0 |1888k| 4 | - | 50 | 740 | 0 | 0 | 0 | 0 | 0 |-4.900000e+01 |-4.000000e+00 | 91.84%
0.19/0.22 o -5
0.19/0.22 c * 0.1s| 41 | 2 | 0 | 0.0 |1891k| 9 | - | 50 | 753 | 0 | 0 | 0 | 13 | 0 |-4.800000e+01 |-5.000000e+00 | 89.58%
0.19/0.23 o -6
0.19/0.23 c * 0.1s| 78 | 2 | 0 | 0.0 |1893k| 11 | - | 50 | 764 | 0 | 0 | 0 | 32 | 0 |-4.700000e+01 |-6.000000e+00 | 87.23%
0.29/0.31 c
0.29/0.31 c SCIP Status : problem is solved [optimal solution found]
0.29/0.31 c Solving Time (sec) : 0.18
0.29/0.31 c Solving Nodes : 660
0.29/0.31 c Primal Bound : -6.00000000000000e+00 (5 solutions)
0.29/0.31 c Dual Bound : -6.00000000000000e+00
0.29/0.31 c Gap : 0.00 %
0.29/0.31 s OPTIMUM FOUND
0.29/0.31 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
0.29/0.31 v -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 -x1
0.29/0.31 c SCIP Status : problem is solved [optimal solution found]
0.29/0.31 c Solving Time : 0.18
0.29/0.31 c Original Problem :
0.29/0.31 c Problem name : HOME/instance-2663830-1276662671.opb
0.29/0.31 c Variables : 790 (790 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.31 c Constraints : 790 initial, 790 maximal
0.29/0.31 c Presolved Problem :
0.29/0.31 c Problem name : t_HOME/instance-2663830-1276662671.opb
0.29/0.31 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.31 c Constraints : 740 initial, 787 maximal
0.29/0.31 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.29/0.31 c trivial : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c implics : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c probing : 0.01 0 0 0 0 0 0 0 0
0.29/0.31 c linear : 0.01 740 0 0 740 0 50 0 0
0.29/0.31 c logicor : 0.01 0 0 0 0 0 0 0 0
0.29/0.31 c root node : - 50 - - 50 - - - -
0.29/0.31 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.29/0.31 c integral : 0 0 0 0 0 0 0 0 0 0
0.29/0.31 c logicor : 740+ 0 984 0 3 139 2813 0 0 0
0.29/0.31 c countsols : 0 0 0 0 3 0 0 0 0 0
0.29/0.31 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.29/0.31 c integral : 0.00 0.00 0.00 0.00 0.00
0.29/0.31 c logicor : 0.01 0.00 0.01 0.00 0.00
0.29/0.31 c countsols : 0.00 0.00 0.00 0.00 0.00
0.29/0.31 c Propagators : Time Calls Cutoffs DomReds
0.29/0.31 c vbounds : 0.00 2 0 0
0.29/0.31 c rootredcost : 0.00 0 0 0
0.29/0.31 c pseudoobj : 0.02 3332 229 686
0.29/0.31 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.31 c propagation : 0.01 368 361 361 2.2 0 0.0 -
0.29/0.31 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.31 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.31 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.31 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.31 c applied globally : - - - 361 2.2 - - -
0.29/0.31 c applied locally : - - - 0 0.0 - - -
0.29/0.31 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.31 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.29/0.31 c redcost : 0.00 0 0 0 0 0
0.29/0.31 c impliedbounds : 0.00 0 0 0 0 0
0.29/0.31 c intobj : 0.00 0 0 0 0 0
0.29/0.31 c cgmip : 0.00 0 0 0 0 0
0.29/0.31 c gomory : 0.00 0 0 0 0 0
0.29/0.31 c strongcg : 0.00 0 0 0 0 0
0.29/0.31 c cmir : 0.00 0 0 0 0 0
0.29/0.31 c flowcover : 0.00 0 0 0 0 0
0.29/0.31 c clique : 0.00 0 0 0 0 0
0.29/0.31 c zerohalf : 0.00 0 0 0 0 0
0.29/0.31 c mcf : 0.00 0 0 0 0 0
0.29/0.31 c rapidlearning : 0.00 0 0 0 0 0
0.29/0.31 c Pricers : Time Calls Vars
0.29/0.31 c problem variables: 0.00 0 0
0.29/0.31 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.31 c relpscost : 0.00 0 0 0 0 0 0
0.29/0.31 c pscost : 0.00 0 0 0 0 0 0
0.29/0.31 c inference : 0.00 376 0 0 0 0 752
0.29/0.31 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.31 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.32 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.32 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.32 c random : 0.00 0 0 0 0 0 0
0.29/0.32 c Primal Heuristics : Time Calls Found
0.29/0.32 c LP solutions : 0.00 - 0
0.29/0.32 c pseudo solutions : 0.00 - 3
0.29/0.32 c oneopt : 0.00 0 0
0.29/0.32 c trivial : 0.00 2 2
0.29/0.32 c simplerounding : 0.00 0 0
0.29/0.32 c zirounding : 0.00 0 0
0.29/0.32 c rounding : 0.00 0 0
0.29/0.32 c shifting : 0.00 0 0
0.29/0.32 c intshifting : 0.00 0 0
0.29/0.32 c twoopt : 0.00 0 0
0.29/0.32 c fixandinfer : 0.00 0 0
0.29/0.32 c feaspump : 0.00 0 0
0.29/0.32 c coefdiving : 0.00 0 0
0.29/0.32 c pscostdiving : 0.00 0 0
0.29/0.32 c fracdiving : 0.00 0 0
0.29/0.32 c veclendiving : 0.00 0 0
0.29/0.32 c intdiving : 0.00 0 0
0.29/0.32 c actconsdiving : 0.00 0 0
0.29/0.32 c objpscostdiving : 0.00 0 0
0.29/0.32 c rootsoldiving : 0.00 0 0
0.29/0.32 c linesearchdiving : 0.00 0 0
0.29/0.32 c guideddiving : 0.00 0 0
0.29/0.32 c octane : 0.00 0 0
0.29/0.32 c rens : 0.00 0 0
0.29/0.32 c rins : 0.00 0 0
0.29/0.32 c localbranching : 0.00 0 0
0.29/0.32 c mutation : 0.00 0 0
0.29/0.32 c crossover : 0.00 0 0
0.29/0.32 c dins : 0.00 0 0
0.29/0.32 c undercover : 0.00 0 0
0.29/0.32 c nlp : 0.00 0 0
0.29/0.32 c trysol : 0.00 0 0
0.29/0.32 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.32 c primal LP : 0.00 0 0 0.00 -
0.29/0.32 c dual LP : 0.00 0 0 0.00 -
0.29/0.32 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.32 c barrier LP : 0.00 0 0 0.00 -
0.29/0.32 c diving/probing LP: 0.00 0 0 0.00 -
0.29/0.32 c strong branching : 0.00 0 0 0.00 -
0.29/0.32 c (at root node) : - 0 0 0.00 -
0.29/0.32 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.32 c B&B Tree :
0.29/0.32 c number of runs : 1
0.29/0.32 c nodes : 660
0.29/0.32 c nodes (total) : 660
0.29/0.32 c nodes left : 0
0.29/0.32 c max depth : 43
0.29/0.32 c max depth (total): 43
0.29/0.32 c backtracks : 90 (13.6%)
0.29/0.32 c delayed cutoffs : 89
0.29/0.32 c repropagations : 1940 (812 domain reductions, 87 cutoffs)
0.29/0.32 c avg switch length: 6.79
0.29/0.32 c switching time : 0.01
0.29/0.32 c Solution :
0.29/0.32 c Solutions found : 5 (4 improvements)
0.29/0.32 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.29/0.32 c Primal Bound : -6.00000000000000e+00 (in run 1, after 78 nodes, 0.11 seconds, depth 11, found by <relaxation>)
0.29/0.32 c Dual Bound : -6.00000000000000e+00
0.29/0.32 c Gap : 0.00 %
0.29/0.32 c Root Dual Bound : -5.00000000000000e+01
0.29/0.32 c Root Iterations : 0
0.29/0.32 c Time complete: 0.31.