0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665252-1276661937.opb>
0.00/0.01 c original problem has 33 variables (33 bin, 0 int, 0 impl, 0 cont) and 33 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 23 del vars, 10 del conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 92 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 23 deleted vars, 10 deleted constraints, 23 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 138 implications, 0 cliques
0.00/0.02 c presolved problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 23 constraints
0.00/0.02 c 23 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.00
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.2
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1800
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = 0
0.00/0.02 c
0.00/0.02 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.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c t 0.0s| 1 | 0 | 10 | - | 192k| 0 | 10 | 10 | 23 | 10 | 23 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.00/0.02 o -1
0.00/0.02 c R 0.0s| 1 | 0 | 10 | - | 193k| 0 | 10 | 10 | 23 | 10 | 23 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.00/0.02 o -2
0.00/0.02 c s 0.0s| 1 | 0 | 10 | - | 193k| 0 | 10 | 10 | 23 | 10 | 23 | 0 | 0 | 0 |-5.000000e+00 |-2.000000e+00 | 60.00%
0.00/0.02 c 0.0s| 1 | 0 | 12 | - | 196k| 0 | 0 | 10 | 23 | 10 | 27 | 4 | 0 | 0 |-4.000000e+00 |-2.000000e+00 | 50.00%
0.00/0.02 o -3
0.00/0.02 c b 0.0s| 1 | 0 | 12 | - | 197k| 0 | 0 | 10 | 23 | 10 | 27 | 4 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.00/0.02 o -4
0.00/0.02 c * 0.0s| 1 | 0 | 12 | - | 197k| 0 | - | 10 | 23 | 10 | 27 | 4 | 0 | 0 |-4.000000e+00 |-4.000000e+00 | 0.00%
0.00/0.02 c
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time (sec) : 0.01
0.00/0.02 c Solving Nodes : 1
0.00/0.02 c Primal Bound : -4.00000000000000e+00 (6 solutions)
0.00/0.02 c Dual Bound : -4.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v x10 x9 -x8 x7 x6 -x5 -x4 -x3 -x2 -x1
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time : 0.01
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-2665252-1276661937.opb
0.00/0.02 c Variables : 33 (33 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 33 initial, 33 maximal
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-2665252-1276661937.opb
0.00/0.02 c Variables : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 23 initial, 23 maximal
0.00/0.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.02 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c linear : 0.00 23 0 0 23 0 10 0 0
0.00/0.02 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c root node : - 0 - - 0 - - - -
0.00/0.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.02 c integral : 0 0 0 1 0 0 0 0 0 0
0.00/0.02 c logicor : 23 2 21 1 0 0 0 0 0 0
0.00/0.02 c countsols : 0 0 0 1 0 0 0 0 0 0
0.00/0.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.02 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Propagators : Time Calls Cutoffs DomReds
0.00/0.02 c vbounds : 0.00 2 0 0
0.00/0.02 c rootredcost : 0.00 0 0 0
0.00/0.02 c pseudoobj : 0.00 3 0 0
0.00/0.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c applied globally : - - - 0 0.0 - - -
0.00/0.02 c applied locally : - - - 0 0.0 - - -
0.00/0.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.02 c cut pool : 0.00 1 - - 0 - (maximal pool size: 7)
0.00/0.02 c redcost : 0.00 2 0 0 0 0
0.00/0.02 c impliedbounds : 0.00 1 0 0 0 0
0.00/0.02 c intobj : 0.00 0 0 0 0 0
0.00/0.02 c cgmip : 0.00 0 0 0 0 0
0.00/0.02 c gomory : 0.00 1 0 0 10 0
0.00/0.02 c strongcg : 0.00 1 0 0 10 0
0.00/0.02 c cmir : 0.00 1 0 0 0 0
0.00/0.02 c flowcover : 0.00 1 0 0 0 0
0.00/0.02 c clique : 0.00 1 0 0 6 0
0.00/0.02 c zerohalf : 0.00 0 0 0 0 0
0.00/0.02 c mcf : 0.00 1 0 0 0 0
0.00/0.02 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.02 c Pricers : Time Calls Vars
0.00/0.02 c problem variables: 0.00 0 0
0.00/0.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.02 c pscost : 0.00 0 0 0 0 0 0
0.00/0.02 c inference : 0.00 0 0 0 0 0 0
0.00/0.02 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.02 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.02 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.02 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.02 c random : 0.00 0 0 0 0 0 0
0.00/0.02 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.02 c Primal Heuristics : Time Calls Found
0.00/0.02 c LP solutions : 0.00 - 1
0.00/0.02 c pseudo solutions : 0.00 - 0
0.00/0.02 c crossover : 0.00 0 0
0.00/0.02 c trivial : 0.00 2 2
0.00/0.02 c simplerounding : 0.00 1 0
0.00/0.02 c zirounding : 0.00 0 0
0.00/0.02 c rounding : 0.00 1 1
0.00/0.02 c shifting : 0.00 1 1
0.00/0.02 c intshifting : 0.00 0 0
0.00/0.02 c oneopt : 0.01 1 1
0.00/0.02 c twoopt : 0.00 0 0
0.00/0.02 c fixandinfer : 0.00 0 0
0.00/0.02 c feaspump : 0.00 0 0
0.00/0.02 c coefdiving : 0.00 0 0
0.00/0.02 c pscostdiving : 0.00 0 0
0.00/0.02 c fracdiving : 0.00 0 0
0.00/0.02 c veclendiving : 0.00 0 0
0.00/0.02 c intdiving : 0.00 0 0
0.00/0.02 c actconsdiving : 0.00 0 0
0.00/0.02 c objpscostdiving : 0.00 0 0
0.00/0.02 c rootsoldiving : 0.00 0 0
0.00/0.02 c linesearchdiving : 0.00 0 0
0.00/0.02 c guideddiving : 0.00 0 0
0.00/0.02 c octane : 0.00 0 0
0.00/0.02 c rens : 0.00 0 0
0.00/0.02 c rins : 0.00 0 0
0.00/0.02 c localbranching : 0.00 0 0
0.00/0.02 c mutation : 0.00 0 0
0.00/0.02 c dins : 0.00 0 0
0.00/0.02 c undercover : 0.00 0 0
0.00/0.02 c nlp : 0.00 0 0
0.00/0.02 c trysol : 0.00 0 0
0.00/0.02 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.02 c primal LP : 0.00 0 0 0.00 -
0.00/0.02 c dual LP : 0.00 2 12 6.00 -
0.00/0.02 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.02 c barrier LP : 0.00 0 0 0.00 -
0.00/0.02 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.02 c strong branching : 0.00 0 0 0.00 -
0.00/0.02 c (at root node) : - 0 0 0.00 -
0.00/0.02 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.02 c B&B Tree :
0.00/0.02 c number of runs : 1
0.00/0.02 c nodes : 1
0.00/0.02 c nodes (total) : 1
0.00/0.02 c nodes left : 0
0.00/0.02 c max depth : 0
0.00/0.02 c max depth (total): 0
0.00/0.02 c backtracks : 0 (0.0%)
0.00/0.02 c delayed cutoffs : 0
0.00/0.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.02 c avg switch length: 2.00
0.00/0.02 c switching time : 0.00
0.00/0.02 c Solution :
0.00/0.02 c Solutions found : 6 (5 improvements)
0.00/0.02 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.02 c Primal Bound : -4.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <relaxation>)
0.00/0.02 c Dual Bound : -4.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Root Dual Bound : -4.00000000000000e+00
0.00/0.02 c Root Iterations : 12
0.00/0.03 c Time complete: 0.02.