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-2664688-1276454566.opb>
0.03/0.07 c original problem has 1972 variables (1972 bin, 0 int, 0 impl, 0 cont) and 3301 constraints
0.03/0.07 c problem read
0.03/0.07 c presolving settings loaded
0.03/0.07 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.03/0.09 c presolving:
0.19/0.22 c (round 1) 1536 del vars, 575 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 83932 impls, 0 clqs
0.19/0.24 c (round 2) 1542 del vars, 2258 del conss, 12 chg bounds, 6 chg sides, 15 chg coeffs, 0 upgd conss, 84330 impls, 0 clqs
0.19/0.24 c (round 3) 1543 del vars, 2264 del conss, 12 chg bounds, 6 chg sides, 15 chg coeffs, 0 upgd conss, 84330 impls, 0 clqs
0.19/0.28 c (round 4) 1543 del vars, 2306 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 0 upgd conss, 84330 impls, 0 clqs
0.29/0.31 c (round 5) 1543 del vars, 2321 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 938 upgd conss, 84330 impls, 0 clqs
0.29/0.32 c (round 6) 1543 del vars, 2321 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 84330 impls, 0 clqs
0.29/0.37 c (round 7) 1593 del vars, 2321 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 88736 impls, 0 clqs
0.29/0.38 c (round 8) 1593 del vars, 2325 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 88736 impls, 0 clqs
0.39/0.42 c (round 9) 1643 del vars, 2325 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 89508 impls, 0 clqs
0.39/0.44 c (round 10) 1671 del vars, 2325 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 89644 impls, 0 clqs
0.39/0.44 c presolving (11 rounds):
0.39/0.44 c 1671 deleted vars, 2325 deleted constraints, 12 tightened bounds, 0 added holes, 48 changed sides, 15 changed coefficients
0.39/0.44 c 89644 implications, 0 cliques
0.39/0.44 c presolved problem has 301 variables (301 bin, 0 int, 0 impl, 0 cont) and 976 constraints
0.39/0.44 c 976 constraints of type <logicor>
0.39/0.44 c transformed objective value is always integral (scale: 1)
0.39/0.44 c Presolving Time: 0.32
0.39/0.44 c - non default parameters ----------------------------------------------------------------------
0.39/0.44 c # SCIP version 1.2.1.2
0.39/0.44 c
0.39/0.44 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c conflict/interconss = 0
0.39/0.44 c
0.39/0.44 c # should binary conflicts be preferred?
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c conflict/preferbinary = TRUE
0.39/0.44 c
0.39/0.44 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c constraints/agelimit = 1
0.39/0.44 c
0.39/0.44 c # should enforcement of pseudo solution be disabled?
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/disableenfops = TRUE
0.39/0.44 c
0.39/0.44 c # frequency for displaying node information lines
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.44 c display/freq = 10000
0.39/0.44 c
0.39/0.44 c # maximal time in seconds to run
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.44 c limits/time = 1799.93
0.39/0.44 c
0.39/0.44 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.44 c limits/memory = 1620
0.39/0.44 c
0.39/0.44 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c lp/solvefreq = -1
0.39/0.44 c
0.39/0.44 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.39/0.44 c # [type: char, range: {lafpsqd}, default: l]
0.39/0.44 c lp/pricing = a
0.39/0.44 c
0.39/0.44 c # should presolving try to simplify inequalities
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/linear/simplifyinequalities = TRUE
0.39/0.44 c
0.39/0.44 c # should presolving try to simplify knapsacks
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.44 c
0.39/0.44 c # priority of node selection rule <dfs> in standard mode
0.39/0.44 c # [type: int, range: [-536870912,536870911], default: 0]
0.39/0.44 c nodeselection/dfs/stdpriority = 1000000
0.39/0.44 c
0.39/0.44 c -----------------------------------------------------------------------------------------------
0.39/0.44 c start solving
0.39/0.44 c
0.39/0.44 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.44 c 0.3s| 1 | 2 | 0 | - |5406k| 0 | - | 301 | 976 | 0 | 0 | 0 | 0 | 0 | 9.210000e+02 | -- | Inf
0.89/0.91 c
0.89/0.91 c SCIP Status : problem is solved [infeasible]
0.89/0.91 c Solving Time (sec) : 0.75
0.89/0.91 c Solving Nodes : 1161
0.89/0.91 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.89/0.91 c Dual Bound : +1.00000000000000e+20
0.89/0.91 c Gap : 0.00 %
0.89/0.91 s UNSATISFIABLE
0.89/0.91 c SCIP Status : problem is solved [infeasible]
0.89/0.91 c Solving Time : 0.75
0.89/0.91 c Original Problem :
0.89/0.91 c Problem name : HOME/instance-2664688-1276454566.opb
0.89/0.91 c Variables : 1972 (1972 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.91 c Constraints : 3301 initial, 3301 maximal
0.89/0.91 c Presolved Problem :
0.89/0.91 c Problem name : t_HOME/instance-2664688-1276454566.opb
0.89/0.91 c Variables : 301 (301 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.91 c Constraints : 976 initial, 1032 maximal
0.89/0.91 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.91 c trivial : 0.00 0 0 0 0 0 0 0 0
0.89/0.91 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.89/0.91 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.91 c implics : 0.09 0 1116 0 0 0 0 0 0
0.89/0.91 c probing : 0.09 2 126 0 0 0 0 0 0
0.89/0.91 c linear : 0.09 12 413 0 12 0 2306 48 15
0.89/0.91 c logicor : 0.03 0 0 0 0 0 19 0 0
0.89/0.91 c root node : - 52 - - 52 - - - -
0.89/0.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.91 c integral : 0 0 0 0 0 0 0 0 0 0
0.89/0.91 c logicor : 976+ 0 10036 0 0 579 18747 0 0 0
0.89/0.91 c countsols : 0 0 0 0 0 0 0 0 0 0
0.89/0.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.91 c integral : 0.00 0.00 0.00 0.00 0.00
0.89/0.91 c logicor : 0.13 0.00 0.13 0.00 0.00
0.89/0.91 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.91 c Propagators : Time Calls Cutoffs DomReds
0.89/0.91 c vbounds : 0.02 2 0 0
0.89/0.91 c rootredcost : 0.00 0 0 0
0.89/0.91 c pseudoobj : 0.11 9220 0 0
0.89/0.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.91 c propagation : 0.03 577 576 576 4.3 223 4.7 -
0.89/0.91 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.91 c applied globally : - - - 799 4.4 - - -
0.89/0.91 c applied locally : - - - 0 0.0 - - -
0.89/0.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.91 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.89/0.91 c redcost : 0.00 0 0 0 0 0
0.89/0.91 c impliedbounds : 0.00 0 0 0 0 0
0.89/0.91 c intobj : 0.00 0 0 0 0 0
0.89/0.91 c cgmip : 0.00 0 0 0 0 0
0.89/0.91 c gomory : 0.00 0 0 0 0 0
0.89/0.91 c strongcg : 0.00 0 0 0 0 0
0.89/0.91 c cmir : 0.00 0 0 0 0 0
0.89/0.91 c flowcover : 0.00 0 0 0 0 0
0.89/0.91 c clique : 0.00 0 0 0 0 0
0.89/0.91 c zerohalf : 0.00 0 0 0 0 0
0.89/0.91 c mcf : 0.00 0 0 0 0 0
0.89/0.91 c rapidlearning : 0.00 0 0 0 0 0
0.89/0.91 c Pricers : Time Calls Vars
0.89/0.91 c problem variables: 0.00 0 0
0.89/0.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.91 c relpscost : 0.00 0 0 0 0 0 0
0.89/0.91 c pscost : 0.00 0 0 0 0 0 0
0.89/0.91 c inference : 0.04 855 0 0 0 0 1710
0.89/0.91 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.91 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.91 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.91 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.91 c random : 0.00 0 0 0 0 0 0
0.89/0.91 c Primal Heuristics : Time Calls Found
0.89/0.91 c LP solutions : 0.00 - 0
0.89/0.91 c pseudo solutions : 0.00 - 0
0.89/0.91 c oneopt : 0.00 0 0
0.89/0.91 c trivial : 0.00 2 0
0.89/0.91 c simplerounding : 0.00 0 0
0.89/0.91 c zirounding : 0.00 0 0
0.89/0.91 c rounding : 0.00 0 0
0.89/0.91 c shifting : 0.00 0 0
0.89/0.91 c intshifting : 0.00 0 0
0.89/0.91 c twoopt : 0.00 0 0
0.89/0.91 c fixandinfer : 0.00 0 0
0.89/0.91 c feaspump : 0.00 0 0
0.89/0.91 c coefdiving : 0.00 0 0
0.89/0.91 c pscostdiving : 0.00 0 0
0.89/0.91 c fracdiving : 0.00 0 0
0.89/0.91 c veclendiving : 0.00 0 0
0.89/0.91 c intdiving : 0.00 0 0
0.89/0.91 c actconsdiving : 0.00 0 0
0.89/0.91 c objpscostdiving : 0.00 0 0
0.89/0.91 c rootsoldiving : 0.00 0 0
0.89/0.91 c linesearchdiving : 0.00 0 0
0.89/0.91 c guideddiving : 0.00 0 0
0.89/0.91 c octane : 0.00 0 0
0.89/0.91 c rens : 0.00 0 0
0.89/0.91 c rins : 0.00 0 0
0.89/0.91 c localbranching : 0.00 0 0
0.89/0.91 c mutation : 0.00 0 0
0.89/0.91 c crossover : 0.00 0 0
0.89/0.91 c dins : 0.00 0 0
0.89/0.91 c undercover : 0.00 0 0
0.89/0.91 c nlp : 0.00 0 0
0.89/0.91 c trysol : 0.00 0 0
0.89/0.91 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.91 c primal LP : 0.00 0 0 0.00 -
0.89/0.91 c dual LP : 0.00 0 0 0.00 -
0.89/0.91 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.91 c barrier LP : 0.00 0 0 0.00 -
0.89/0.91 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.91 c strong branching : 0.00 0 0 0.00 -
0.89/0.91 c (at root node) : - 0 0 0.00 -
0.89/0.91 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.91 c B&B Tree :
0.89/0.91 c number of runs : 1
0.89/0.91 c nodes : 1161
0.89/0.91 c nodes (total) : 1161
0.89/0.91 c nodes left : 0
0.89/0.91 c max depth : 31
0.89/0.91 c max depth (total): 31
0.89/0.91 c backtracks : 300 (25.8%)
0.89/0.91 c delayed cutoffs : 550
0.89/0.91 c repropagations : 1039 (7612 domain reductions, 271 cutoffs)
0.89/0.91 c avg switch length: 2.89
0.89/0.91 c switching time : 0.07
0.89/0.91 c Solution :
0.89/0.91 c Solutions found : 0 (0 improvements)
0.89/0.91 c Primal Bound : infeasible
0.89/0.91 c Dual Bound : -
0.89/0.91 c Gap : 0.00 %
0.89/0.91 c Root Dual Bound : +9.21000000000000e+02
0.89/0.91 c Root Iterations : 0
0.89/0.93 c Time complete: 0.92.