0.09/0.17 c SCIP version 1.1.0.7
0.09/0.17 c LP-Solver SoPlex 1.4.1
0.09/0.17 c user parameter file <scip.set> not found - using default parameters
0.09/0.17 c read problem <HOME/instance-3740055-1338757437.opb>
0.09/0.17 c original problem has 8418 variables (8418 bin, 0 int, 0 impl, 0 cont) and 27487 constraints
0.19/0.21 c No objective function, only one solution is needed.
0.19/0.21 c start presolving problem
0.19/0.21 c presolving:
0.49/0.55 c presolving (1 rounds):
0.49/0.55 c 827 deleted vars, 2696 deleted constraints, 827 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.55 c 1004692 implications, 0 cliques
0.49/0.55 c presolving detected infeasibility
0.49/0.55 c Presolving Time: 0.32
0.49/0.55 c SATUNSAT-LIN
0.49/0.55 c -----------------------------------------------------------------------------------------------
0.49/0.55 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.55 c separating/flowcover/freq = c -1
0.49/0.55 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.55 c separating/cmir/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/veclendiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/veclendiving/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.55 c heuristics/simplerounding/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/shifting/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.55 c heuristics/rounding/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.55 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.49/0.55 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.55 c heuristics/rootsoldiving/freq = c -1
0.49/0.55 c # number of nodes added to the contingent of the total nodes
0.49/0.55 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.55 c heuristics/rens/nodesofs = c 2000
0.49/0.55 c # minimum percentage of integer variables that have to be fixable
0.49/0.55 c # [type: real, range: [0,1], default: 0.5]
0.49/0.55 c heuristics/rens/minfixingrate = c 0.3
0.49/0.55 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.55 c heuristics/rens/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/pscostdiving/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.55 c heuristics/oneopt/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.55 c # [type: real, range: [0,1], default: 0.01]
0.49/0.55 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.49/0.55 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.55 c heuristics/objpscostdiving/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/linesearchdiving/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/intshifting/freq = c -1
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/intdiving/maxlpiterquot = c 0.075
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/guideddiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/guideddiving/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/fracdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/fracdiving/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/feaspump/maxlpiterofs = c 2000
0.49/0.55 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.55 c heuristics/feaspump/freq = c -1
0.49/0.55 c # minimum percentage of integer variables that have to be fixed
0.49/0.55 c # [type: real, range: [0,1], default: 0.666]
0.49/0.55 c heuristics/crossover/minfixingrate = c 0.5
0.49/0.55 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.55 c # [type: real, range: [0,1], default: 0.1]
0.49/0.55 c heuristics/crossover/nodesquot = c 0.15
0.49/0.55 c # number of nodes without incumbent change that heuristic should wait
0.49/0.55 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.55 c heuristics/crossover/nwaitingnodes = c 100
0.49/0.55 c # number of nodes added to the contingent of the total nodes
0.49/0.55 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.55 c heuristics/crossover/nodesofs = c 750
0.49/0.55 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.55 c heuristics/crossover/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/coefdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/coefdiving/freq = c -1
0.49/0.55 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.55 c presolving/probing/maxrounds = c 0
0.49/0.55 c # should presolving try to simplify knapsacks
0.49/0.55 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.55 c constraints/knapsack/simplifyinequalities = c TRUE
0.49/0.55 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.55 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.55 c constraints/knapsack/disaggregation = c FALSE
0.49/0.55 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.55 c constraints/knapsack/maxnumcardlift = c 0
0.49/0.55 c # should presolving try to simplify inequalities
0.49/0.55 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.55 c constraints/linear/simplifyinequalities = c TRUE
0.49/0.55 c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.55 c separating/maxroundsroot = c 5
0.49/0.55 c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.55 c separating/maxrounds = c 1
0.49/0.55 c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.55 c limits/solutions = c 1
0.49/0.55 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.55 c limits/memory = c 13950
0.49/0.55 c # maximal time in seconds to run
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.55 c limits/time = c 1791
0.49/0.55 c # frequency for displaying node information lines
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.55 c display/freq = c 10000
0.49/0.55 c -----------------------------------------------------------------------------------------------
0.49/0.55 c start solving problem
0.49/0.55 c
0.49/0.55 c SCIP Status : problem is solved [infeasible]
0.49/0.55 c Solving Time (sec) : 0.35
0.49/0.55 c Solving Nodes : 0
0.49/0.55 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.49/0.55 c Dual Bound : -1.00000000000000e+20
0.49/0.55 c Gap : infinite
0.49/0.55 c NODE 0
0.49/0.55 c DUAL BOUND -1e+20
0.49/0.55 c PRIMAL BOUND 1e+20
0.49/0.55 c GAP 1e+20
0.49/0.55 s UNSATISFIABLE
0.49/0.55 c SCIP Status : problem is solved [infeasible]
0.49/0.55 c Solving Time : 0.35
0.49/0.55 c Original Problem :
0.49/0.55 c Problem name : HOME/instance-3740055-1338757437.opb
0.49/0.55 c Variables : 8418 (8418 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.55 c Constraints : 27487 initial, 27487 maximal
0.49/0.55 c Presolved Problem :
0.49/0.55 c Problem name : t_HOME/instance-3740055-1338757437.opb
0.49/0.55 c Variables : 7591 (7591 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.55 c Constraints : 24791 initial, 24791 maximal
0.49/0.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.55 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c probing : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c linear : 0.32 827 0 0 827 0 2696 0 0
0.49/0.55 c root node : - 0 - - 0 - - - -
0.49/0.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.55 c integral : 0 0 0 0 0 0 0 0 0 0
0.49/0.55 c linear : 24791 0 0 0 0 0 0 0 0 0
0.49/0.55 c countsols : 0 0 0 0 0 0 0 0 0 0
0.49/0.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.55 c integral : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c linear : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c Propagators : Time Calls Cutoffs DomReds
0.49/0.55 c pseudoobj : 0.00 0 0 0
0.49/0.55 c rootredcost : 0.00 0 0 0
0.49/0.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.55 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.55 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.55 c applied globally : - - - 0 0.0 - - -
0.49/0.55 c applied locally : - - - 0 0.0 - - -
0.49/0.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.55 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.49/0.55 c redcost : 0.00 0 0 0 0 0
0.49/0.55 c impliedbounds : 0.00 0 0 0 0 0
0.49/0.55 c intobj : 0.00 0 0 0 0 0
0.49/0.55 c gomory : 0.00 0 0 0 0 0
0.49/0.55 c strongcg : 0.00 0 0 0 0 0
0.49/0.55 c cmir : 0.00 0 0 0 0 0
0.49/0.55 c flowcover : 0.00 0 0 0 0 0
0.49/0.55 c clique : 0.00 0 0 0 0 0
0.49/0.55 c zerohalf : 0.00 0 0 0 0 0
0.49/0.55 c mcf : 0.00 0 0 0 0 0
0.49/0.55 c Pricers : Time Calls Vars
0.49/0.55 c problem variables: 0.00 0 0
0.49/0.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.55 c pscost : 0.00 0 0 0 0 0 0
0.49/0.55 c inference : 0.00 0 0 0 0 0 0
0.49/0.55 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.55 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.55 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.55 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.55 c random : 0.00 0 0 0 0 0 0
0.49/0.55 c relpscost : 0.00 0 0 0 0 0 0
0.49/0.55 c Primal Heuristics : Time Calls Found
0.49/0.55 c LP solutions : 0.00 - 0
0.49/0.55 c pseudo solutions : 0.00 - 0
0.49/0.55 c simplerounding : 0.00 0 0
0.49/0.55 c rounding : 0.00 0 0
0.49/0.55 c shifting : 0.00 0 0
0.49/0.55 c intshifting : 0.00 0 0
0.49/0.55 c oneopt : 0.00 0 0
0.49/0.55 c fixandinfer : 0.00 0 0
0.49/0.55 c feaspump : 0.00 0 0
0.49/0.55 c coefdiving : 0.00 0 0
0.49/0.55 c pscostdiving : 0.00 0 0
0.49/0.55 c fracdiving : 0.00 0 0
0.49/0.55 c veclendiving : 0.00 0 0
0.49/0.55 c intdiving : 0.00 0 0
0.49/0.55 c actconsdiving : 0.00 0 0
0.49/0.55 c objpscostdiving : 0.00 0 0
0.49/0.55 c rootsoldiving : 0.00 0 0
0.49/0.55 c linesearchdiving : 0.00 0 0
0.49/0.55 c guideddiving : 0.00 0 0
0.49/0.55 c octane : 0.00 0 0
0.49/0.55 c rens : 0.00 0 0
0.49/0.55 c rins : 0.00 0 0
0.49/0.55 c localbranching : 0.00 0 0
0.49/0.55 c mutation : 0.00 0 0
0.49/0.55 c crossover : 0.00 0 0
0.49/0.55 c dins : 0.00 0 0
0.49/0.55 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.55 c primal LP : 0.00 0 0 0.00 -
0.49/0.55 c dual LP : 0.00 0 0 0.00 -
0.49/0.55 c barrier LP : 0.00 0 0 0.00 -
0.49/0.55 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.55 c strong branching : 0.00 0 0 0.00 -
0.49/0.55 c (at root node) : - 0 0 0.00 -
0.49/0.55 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.55 c B&B Tree :
0.49/0.55 c number of runs : 1
0.49/0.55 c nodes : 0
0.49/0.55 c nodes (total) : 0
0.49/0.55 c nodes left : 1
0.49/0.55 c max depth : -1
0.49/0.55 c max depth (total): -1
0.49/0.55 c backtracks : 0 (0.0%)
0.49/0.55 c delayed cutoffs : 0
0.49/0.55 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.55 c avg switch length: 0.00
0.49/0.55 c switching time : 0.00
0.49/0.55 c Solution :
0.49/0.55 c Solutions found : 0 (0 improvements)
0.49/0.55 c Primal Bound : infeasible
0.49/0.55 c Dual Bound : -
0.49/0.55 c Gap : infinite
0.49/0.55 c Root Dual Bound : -
0.49/0.59 c Time complete: 0.59.