0.09/0.18 c SCIP version 1.1.0.7
0.09/0.18 c LP-Solver SoPlex 1.4.1
0.09/0.18 c user parameter file <scip.set> not found - using default parameters
0.09/0.18 c read problem <HOME/instance-3739964-1338757372.opb>
0.09/0.18 c original problem has 9150 variables (9150 bin, 0 int, 0 impl, 0 cont) and 28514 constraints
0.19/0.22 c No objective function, only one solution is needed.
0.19/0.22 c start presolving problem
0.19/0.22 c presolving:
0.69/0.74 c (round 1) 2455 del vars, 6606 del conss, 1633 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1477970 impls, 0 clqs
0.89/0.94 c (round 2) 5590 del vars, 17067 del conss, 4597 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1496066 impls, 0 clqs
0.89/0.97 c (round 3) 6440 del vars, 21095 del conss, 5021 chg bounds, 63 chg sides, 48 chg coeffs, 0 upgd conss, 1501162 impls, 0 clqs
0.89/0.99 c (round 4) 6897 del vars, 22440 del conss, 5331 chg bounds, 110 chg sides, 86 chg coeffs, 0 upgd conss, 1507016 impls, 0 clqs
0.89/1.00 c (round 5) 7164 del vars, 23364 del conss, 5481 chg bounds, 121 chg sides, 100 chg coeffs, 0 upgd conss, 1510407 impls, 0 clqs
0.99/1.00 c (round 6) 7286 del vars, 23772 del conss, 5543 chg bounds, 124 chg sides, 105 chg coeffs, 0 upgd conss, 1512031 impls, 0 clqs
0.99/1.01 c (round 7) 7396 del vars, 24042 del conss, 5620 chg bounds, 128 chg sides, 111 chg coeffs, 0 upgd conss, 1512773 impls, 0 clqs
0.99/1.01 c (round 8) 7545 del vars, 24359 del conss, 5694 chg bounds, 138 chg sides, 121 chg coeffs, 0 upgd conss, 1514350 impls, 1 clqs
0.99/1.02 c presolving (9 rounds):
0.99/1.02 c 7592 deleted vars, 24562 deleted constraints, 5718 tightened bounds, 0 added holes, 146 changed sides, 129 changed coefficients
0.99/1.02 c 1514913 implications, 1 cliques
0.99/1.02 c presolving detected infeasibility
0.99/1.02 c Presolving Time: 0.75
0.99/1.02 c SATUNSAT-LIN
0.99/1.02 c -----------------------------------------------------------------------------------------------
0.99/1.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.02 c separating/flowcover/freq = c -1
0.99/1.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.02 c separating/cmir/freq = c -1
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.99/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.99/1.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.02 c heuristics/veclendiving/freq = c -1
0.99/1.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.02 c heuristics/simplerounding/freq = c -1
0.99/1.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.02 c heuristics/shifting/freq = c -1
0.99/1.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.02 c heuristics/rounding/freq = c -1
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.99/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.99/1.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.99/1.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.02 c heuristics/rootsoldiving/freq = c -1
0.99/1.02 c # number of nodes added to the contingent of the total nodes
0.99/1.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.99/1.02 c heuristics/rens/nodesofs = c 2000
0.99/1.02 c # minimum percentage of integer variables that have to be fixable
0.99/1.02 c # [type: real, range: [0,1], default: 0.5]
0.99/1.02 c heuristics/rens/minfixingrate = c 0.3
0.99/1.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.02 c heuristics/rens/freq = c -1
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.99/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.99/1.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.02 c heuristics/pscostdiving/freq = c -1
0.99/1.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.02 c heuristics/oneopt/freq = c -1
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.99/1.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.99/1.02 c # [type: real, range: [0,1], default: 0.01]
0.99/1.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.99/1.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.02 c heuristics/objpscostdiving/freq = c -1
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.99/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.99/1.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.02 c heuristics/linesearchdiving/freq = c -1
0.99/1.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.02 c heuristics/intshifting/freq = c -1
0.99/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.99/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.99/1.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.02 c heuristics/guideddiving/freq = c -1
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.99/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.99/1.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.02 c heuristics/fracdiving/freq = c -1
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.99/1.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.02 c heuristics/feaspump/freq = c -1
0.99/1.02 c # minimum percentage of integer variables that have to be fixed
0.99/1.02 c # [type: real, range: [0,1], default: 0.666]
0.99/1.02 c heuristics/crossover/minfixingrate = c 0.5
0.99/1.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.99/1.02 c # [type: real, range: [0,1], default: 0.1]
0.99/1.02 c heuristics/crossover/nodesquot = c 0.15
0.99/1.02 c # number of nodes without incumbent change that heuristic should wait
0.99/1.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.99/1.02 c heuristics/crossover/nwaitingnodes = c 100
0.99/1.02 c # number of nodes added to the contingent of the total nodes
0.99/1.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.99/1.02 c heuristics/crossover/nodesofs = c 750
0.99/1.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 30]
0.99/1.02 c heuristics/crossover/freq = c -1
0.99/1.02 c # additional number of allowed LP iterations
0.99/1.02 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.02 c heuristics/coefdiving/maxlpiterofs = c 1500
0.99/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.02 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.99/1.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.02 c heuristics/coefdiving/freq = c -1
0.99/1.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.02 c presolving/probing/maxrounds = c 0
0.99/1.02 c # should presolving try to simplify knapsacks
0.99/1.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.99/1.02 c constraints/knapsack/simplifyinequalities = c TRUE
0.99/1.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.99/1.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.99/1.02 c constraints/knapsack/disaggregation = c FALSE
0.99/1.02 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.02 c constraints/knapsack/maxnumcardlift = c 0
0.99/1.02 c # should presolving try to simplify inequalities
0.99/1.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.99/1.02 c constraints/linear/simplifyinequalities = c TRUE
0.99/1.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.02 c separating/maxroundsroot = c 5
0.99/1.02 c # maximal number of separation rounds per node (-1: unlimited)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 5]
0.99/1.02 c separating/maxrounds = c 1
0.99/1.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.99/1.02 c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.02 c limits/solutions = c 1
0.99/1.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.99/1.02 c limits/memory = c 13950
0.99/1.02 c # maximal time in seconds to run
0.99/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.99/1.02 c limits/time = c 1791
0.99/1.02 c # frequency for displaying node information lines
0.99/1.02 c # [type: int, range: [-1,2147483647], default: 100]
0.99/1.02 c display/freq = c 10000
0.99/1.02 c -----------------------------------------------------------------------------------------------
0.99/1.02 c start solving problem
0.99/1.02 c
0.99/1.02 c SCIP Status : problem is solved [infeasible]
0.99/1.02 c Solving Time (sec) : 0.78
0.99/1.02 c Solving Nodes : 0
0.99/1.02 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.99/1.02 c Dual Bound : -1.00000000000000e+20
0.99/1.02 c Gap : infinite
0.99/1.02 c NODE 0
0.99/1.02 c DUAL BOUND -1e+20
0.99/1.02 c PRIMAL BOUND 1e+20
0.99/1.02 c GAP 1e+20
0.99/1.02 s UNSATISFIABLE
0.99/1.02 c SCIP Status : problem is solved [infeasible]
0.99/1.02 c Solving Time : 0.78
0.99/1.02 c Original Problem :
0.99/1.02 c Problem name : HOME/instance-3739964-1338757372.opb
0.99/1.02 c Variables : 9150 (9150 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.02 c Constraints : 28514 initial, 28514 maximal
0.99/1.02 c Presolved Problem :
0.99/1.02 c Problem name : t_HOME/instance-3739964-1338757372.opb
0.99/1.02 c Variables : 1558 (1558 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.02 c Constraints : 3952 initial, 3952 maximal
0.99/1.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.99/1.02 c trivial : 0.00 375 0 0 0 0 0 0 0
0.99/1.02 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.99/1.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c implics : 0.02 0 92 0 0 0 0 0 0
0.99/1.02 c probing : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c linear : 0.72 5343 1780 0 5718 0 24562 146 129
0.99/1.02 c root node : - 0 - - 0 - - - -
0.99/1.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.99/1.02 c integral : 0 0 0 0 0 0 0 0 0 0
0.99/1.02 c linear : 3952 0 0 0 0 0 0 0 0 0
0.99/1.02 c countsols : 0 0 0 0 0 0 0 0 0 0
0.99/1.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.99/1.02 c integral : 0.00 0.00 0.00 0.00 0.00
0.99/1.02 c linear : 0.00 0.00 0.00 0.00 0.00
0.99/1.02 c countsols : 0.00 0.00 0.00 0.00 0.00
0.99/1.02 c Propagators : Time Calls Cutoffs DomReds
0.99/1.02 c pseudoobj : 0.00 0 0 0
0.99/1.02 c rootredcost : 0.00 0 0 0
0.99/1.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.99/1.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.02 c applied globally : - - - 0 0.0 - - -
0.99/1.02 c applied locally : - - - 0 0.0 - - -
0.99/1.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.99/1.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.99/1.02 c redcost : 0.00 0 0 0 0 0
0.99/1.02 c impliedbounds : 0.00 0 0 0 0 0
0.99/1.02 c intobj : 0.00 0 0 0 0 0
0.99/1.02 c gomory : 0.00 0 0 0 0 0
0.99/1.02 c strongcg : 0.00 0 0 0 0 0
0.99/1.02 c cmir : 0.00 0 0 0 0 0
0.99/1.02 c flowcover : 0.00 0 0 0 0 0
0.99/1.02 c clique : 0.00 0 0 0 0 0
0.99/1.02 c zerohalf : 0.00 0 0 0 0 0
0.99/1.02 c mcf : 0.00 0 0 0 0 0
0.99/1.02 c Pricers : Time Calls Vars
0.99/1.02 c problem variables: 0.00 0 0
0.99/1.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.99/1.02 c pscost : 0.00 0 0 0 0 0 0
0.99/1.02 c inference : 0.00 0 0 0 0 0 0
0.99/1.02 c mostinf : 0.00 0 0 0 0 0 0
0.99/1.02 c leastinf : 0.00 0 0 0 0 0 0
0.99/1.02 c fullstrong : 0.00 0 0 0 0 0 0
0.99/1.02 c allfullstrong : 0.00 0 0 0 0 0 0
0.99/1.02 c random : 0.00 0 0 0 0 0 0
0.99/1.02 c relpscost : 0.00 0 0 0 0 0 0
0.99/1.02 c Primal Heuristics : Time Calls Found
0.99/1.02 c LP solutions : 0.00 - 0
0.99/1.02 c pseudo solutions : 0.00 - 0
0.99/1.02 c simplerounding : 0.00 0 0
0.99/1.02 c rounding : 0.00 0 0
0.99/1.02 c shifting : 0.00 0 0
0.99/1.02 c intshifting : 0.00 0 0
0.99/1.02 c oneopt : 0.00 0 0
0.99/1.02 c fixandinfer : 0.00 0 0
0.99/1.02 c feaspump : 0.00 0 0
0.99/1.02 c coefdiving : 0.00 0 0
0.99/1.02 c pscostdiving : 0.00 0 0
0.99/1.02 c fracdiving : 0.00 0 0
0.99/1.02 c veclendiving : 0.00 0 0
0.99/1.02 c intdiving : 0.00 0 0
0.99/1.02 c actconsdiving : 0.00 0 0
0.99/1.02 c objpscostdiving : 0.00 0 0
0.99/1.02 c rootsoldiving : 0.00 0 0
0.99/1.02 c linesearchdiving : 0.00 0 0
0.99/1.02 c guideddiving : 0.00 0 0
0.99/1.02 c octane : 0.00 0 0
0.99/1.02 c rens : 0.00 0 0
0.99/1.02 c rins : 0.00 0 0
0.99/1.02 c localbranching : 0.00 0 0
0.99/1.02 c mutation : 0.00 0 0
0.99/1.02 c crossover : 0.00 0 0
0.99/1.02 c dins : 0.00 0 0
0.99/1.02 c LP : Time Calls Iterations Iter/call Iter/sec
0.99/1.02 c primal LP : 0.00 0 0 0.00 -
0.99/1.02 c dual LP : 0.00 0 0 0.00 -
0.99/1.02 c barrier LP : 0.00 0 0 0.00 -
0.99/1.02 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.02 c strong branching : 0.00 0 0 0.00 -
0.99/1.02 c (at root node) : - 0 0 0.00 -
0.99/1.02 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.02 c B&B Tree :
0.99/1.02 c number of runs : 1
0.99/1.02 c nodes : 0
0.99/1.02 c nodes (total) : 0
0.99/1.02 c nodes left : 1
0.99/1.02 c max depth : -1
0.99/1.02 c max depth (total): -1
0.99/1.02 c backtracks : 0 (0.0%)
0.99/1.02 c delayed cutoffs : 0
0.99/1.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.99/1.02 c avg switch length: 0.00
0.99/1.02 c switching time : 0.00
0.99/1.02 c Solution :
0.99/1.02 c Solutions found : 0 (0 improvements)
0.99/1.02 c Primal Bound : infeasible
0.99/1.02 c Dual Bound : -
0.99/1.02 c Gap : infinite
0.99/1.02 c Root Dual Bound : -
0.99/1.05 c Time complete: 1.04.