0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-3737881-1338751207.opb>
0.00/0.01 c original problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.07 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11812 impls, 100 clqs
0.09/0.12 c presolving (2 rounds):
0.09/0.12 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12 c 11812 implications, 100 cliques
0.09/0.12 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.09/0.12 c 1 constraints of type <knapsack>
0.09/0.12 c 100 constraints of type <setppc>
0.09/0.12 c 1464 constraints of type <and>
0.09/0.12 c 1 constraints of type <linear>
0.09/0.12 c 50 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.03
0.09/0.12 c SATUNSAT-NLC
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/flowcover/freq = c -1
0.09/0.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/cmir/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/veclendiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/simplerounding/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/shifting/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/rounding/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/rootsoldiving/freq = c -1
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/rens/nodesofs = c 2000
0.09/0.12 c # minimum percentage of integer variables that have to be fixable
0.09/0.12 c # [type: real, range: [0,1], default: 0.5]
0.09/0.12 c heuristics/rens/minfixingrate = c 0.3
0.09/0.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c heuristics/rens/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/pscostdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/oneopt/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12 c # [type: real, range: [0,1], default: 0.01]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/objpscostdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/linesearchdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/intshifting/freq = c -1
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/guideddiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/fracdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/feaspump/freq = c -1
0.09/0.12 c # minimum percentage of integer variables that have to be fixed
0.09/0.12 c # [type: real, range: [0,1], default: 0.666]
0.09/0.12 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12 c # [type: real, range: [0,1], default: 0.1]
0.09/0.12 c heuristics/crossover/nodesquot = c 0.15
0.09/0.12 c # number of nodes without incumbent change that heuristic should wait
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/crossover/nodesofs = c 750
0.09/0.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12 c heuristics/crossover/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/coefdiving/freq = c -1
0.09/0.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c presolving/probing/maxrounds = c 0
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12 c constraints/knapsack/disaggregation = c FALSE
0.09/0.12 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/maxroundsroot = c 5
0.09/0.12 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12 c separating/maxrounds = c 1
0.09/0.12 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c limits/solutions = c 1
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = c 13950
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = c 1791
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = c 10000
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving problem
0.09/0.12 c
0.09/0.13 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.13 c 0.1s| 1 | 0 | 96 |7044k| 0 | 60 |1564 |1616 |1616 |1564 |3080 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.18/0.21 c 0.1s| 1 | 0 | 102 |7058k| 0 | 61 |1564 |1616 |1616 |1564 |3081 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.18/0.29 c 0.2s| 1 | 0 | 123 |7087k| 0 | 62 |1564 |1616 |1616 |1564 |3082 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 173 |7105k| 0 | 62 |1564 |1616 |1616 |1564 |3083 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
0.59/0.60 c 0.5s| 1 | 0 | 200 |7127k| 0 | 63 |1564 |1616 |1616 |1564 |3084 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 234 |7141k| 0 | 63 |1564 |1616 |1616 |1564 |3085 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
3.20/3.27 c 3.2s| 1 | 2 | 234 |7141k| 0 | 63 |1564 |1616 |1616 |1564 |3085 | 5 | 0 | 18 | 3.000000e+01 | -- | Inf
8.09/8.13 c
8.09/8.13 c SCIP Status : problem is solved [infeasible]
8.09/8.13 c Solving Time (sec) : 7.95
8.09/8.13 c Solving Nodes : 250
8.09/8.13 c Primal Bound : +1.00000000000000e+20 (0 solutions)
8.09/8.13 c Dual Bound : +1.00000000000000e+20
8.09/8.13 c Gap : 0.00 %
8.09/8.13 c NODE 250
8.09/8.13 c DUAL BOUND 1e+20
8.09/8.13 c PRIMAL BOUND 1e+20
8.09/8.13 c GAP 0
8.09/8.13 s UNSATISFIABLE
8.09/8.13 c SCIP Status : problem is solved [infeasible]
8.09/8.13 c Solving Time : 7.95
8.09/8.13 c Original Problem :
8.09/8.13 c Problem name : HOME/instance-3737881-1338751207.opb
8.09/8.13 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
8.09/8.13 c Constraints : 1616 initial, 1616 maximal
8.09/8.13 c Presolved Problem :
8.09/8.13 c Problem name : t_HOME/instance-3737881-1338751207.opb
8.09/8.13 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
8.09/8.13 c Constraints : 1616 initial, 1704 maximal
8.09/8.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
8.09/8.13 c trivial : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c dualfix : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c implics : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c probing : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c knapsack : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c setppc : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c and : 0.03 0 0 0 0 0 0 0 0
8.09/8.13 c linear : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c logicor : 0.00 0 0 0 0 0 0 0 0
8.09/8.13 c root node : - 71 - - 71 - - - -
8.09/8.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
8.09/8.13 c integral : 0 0 0 171 0 2 67 0 0 268
8.09/8.13 c knapsack : 1 5 1081 10 0 15 95 0 0 0
8.09/8.13 c setppc : 100 5 1073 10 0 2 1573 0 0 0
8.09/8.13 c and : 1464 223 1071 10 0 1 26180 25316 0 0
8.09/8.13 c linear : 1 5 1070 0 0 4 13 0 0 0
8.09/8.13 c logicor : 50+ 5 320 0 0 2 226 0 0 0
8.09/8.13 c countsols : 0 0 0 0 0 0 0 0 0 0
8.09/8.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
8.09/8.13 c integral : 5.33 0.00 0.00 5.33 0.00
8.09/8.13 c knapsack : 0.00 0.00 0.00 0.00 0.00
8.09/8.13 c setppc : 0.00 0.00 0.00 0.00 0.00
8.09/8.13 c and : 0.08 0.02 0.06 0.00 0.00
8.09/8.13 c linear : 0.01 0.00 0.01 0.00 0.00
8.09/8.13 c logicor : 0.00 0.00 0.00 0.00 0.00
8.09/8.13 c countsols : 0.00 0.00 0.00 0.00 0.00
8.09/8.13 c Propagators : Time Calls Cutoffs DomReds
8.09/8.13 c rootredcost : 0.00 0 0 0
8.09/8.13 c pseudoobj : 0.02 1091 1 0
8.09/8.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
8.09/8.13 c propagation : 0.00 24 23 88 18.1 0 0.0 -
8.09/8.13 c infeasible LP : 0.01 82 81 349 19.0 3 19.0 0
8.09/8.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
8.09/8.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
8.09/8.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
8.09/8.13 c applied globally : - - - 161 17.4 - - -
8.09/8.13 c applied locally : - - - 0 0.0 - - -
8.09/8.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
8.09/8.13 c cut pool : 0.00 4 - - 5 - (maximal pool size: 20)
8.09/8.13 c redcost : 0.00 223 0 0 0 0
8.09/8.13 c impliedbounds : 0.00 5 0 0 0 0
8.09/8.13 c intobj : 0.00 0 0 0 0 0
8.09/8.13 c gomory : 0.36 5 0 0 1500 0
8.09/8.13 c strongcg : 0.29 5 0 0 2032 0
8.09/8.13 c cmir : 0.00 0 0 0 0 0
8.09/8.13 c flowcover : 0.00 0 0 0 0 0
8.09/8.13 c clique : 0.00 5 0 0 0 0
8.09/8.13 c zerohalf : 0.00 0 0 0 0 0
8.09/8.13 c mcf : 0.00 2 0 0 0 0
8.09/8.13 c Pricers : Time Calls Vars
8.09/8.13 c problem variables: 0.00 0 0
8.09/8.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
8.09/8.13 c relpscost : 5.33 161 2 67 0 0 268
8.09/8.13 c pscost : 0.00 0 0 0 0 0 0
8.09/8.13 c inference : 0.00 0 0 0 0 0 0
8.09/8.13 c mostinf : 0.00 0 0 0 0 0 0
8.09/8.13 c leastinf : 0.00 0 0 0 0 0 0
8.09/8.13 c fullstrong : 0.00 0 0 0 0 0 0
8.09/8.13 c allfullstrong : 0.00 0 0 0 0 0 0
8.09/8.13 c random : 0.00 0 0 0 0 0 0
8.09/8.13 c Primal Heuristics : Time Calls Found
8.09/8.13 c LP solutions : 0.00 - 0
8.09/8.13 c pseudo solutions : 0.00 - 0
8.09/8.13 c simplerounding : 0.00 0 0
8.09/8.13 c rounding : 0.00 0 0
8.09/8.13 c shifting : 0.00 0 0
8.09/8.13 c intshifting : 0.00 0 0
8.09/8.13 c oneopt : 0.00 0 0
8.09/8.13 c fixandinfer : 0.00 0 0
8.09/8.13 c feaspump : 0.00 0 0
8.09/8.13 c coefdiving : 0.00 0 0
8.09/8.13 c pscostdiving : 0.00 0 0
8.09/8.13 c fracdiving : 0.00 0 0
8.09/8.13 c veclendiving : 0.00 0 0
8.09/8.13 c intdiving : 0.00 0 0
8.09/8.13 c actconsdiving : 0.00 0 0
8.09/8.13 c objpscostdiving : 0.00 0 0
8.09/8.13 c rootsoldiving : 0.00 0 0
8.09/8.13 c linesearchdiving : 0.00 0 0
8.09/8.13 c guideddiving : 0.00 0 0
8.09/8.13 c octane : 0.00 0 0
8.09/8.13 c rens : 0.00 0 0
8.09/8.13 c rins : 0.00 0 0
8.09/8.13 c localbranching : 0.00 0 0
8.09/8.13 c mutation : 0.00 0 0
8.09/8.13 c crossover : 0.00 0 0
8.09/8.13 c dins : 0.00 0 0
8.09/8.13 c LP : Time Calls Iterations Iter/call Iter/sec
8.09/8.13 c primal LP : 0.01 0 0 0.00 0.00
8.09/8.13 c dual LP : 1.56 472 20450 43.33 13108.97
8.09/8.13 c barrier LP : 0.00 0 0 0.00 -
8.09/8.13 c diving/probing LP: 0.00 0 0 0.00 -
8.09/8.13 c strong branching : 5.32 1247 45024 36.11 8463.16
8.09/8.13 c (at root node) : - 18 9713 539.61 -
8.09/8.13 c conflict analysis: 0.00 0 0 0.00 -
8.09/8.13 c B&B Tree :
8.09/8.13 c number of runs : 1
8.09/8.13 c nodes : 250
8.09/8.13 c nodes (total) : 250
8.09/8.13 c nodes left : 0
8.09/8.13 c max depth : 46
8.09/8.13 c max depth (total): 46
8.09/8.13 c backtracks : 60 (24.0%)
8.09/8.13 c delayed cutoffs : 19
8.09/8.13 c repropagations : 354 (4196 domain reductions, 5 cutoffs)
8.09/8.13 c avg switch length: 4.60
8.09/8.13 c switching time : 0.05
8.09/8.13 c Solution :
8.09/8.13 c Solutions found : 0 (0 improvements)
8.09/8.13 c Primal Bound : infeasible
8.09/8.13 c Dual Bound : -
8.09/8.13 c Gap : 0.00 %
8.09/8.13 c Root Dual Bound : +3.00000000000000e+01
8.09/8.14 c Time complete: 8.13.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3737881-1338751207/watcher-3737881-1338751207 -o /tmp/evaluation-result-3737881-1338751207/solver-3737881-1338751207 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3737881-1338751207.opb
running on 4 cores: 1,3,5,7
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.05 2.01 1.93 3/177 32535
/proc/meminfo: memFree=28460752/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=8896 CPUtime=0 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 1564 0 0 0 0 0 0 0 20 0 1 0 341249302 9109504 1517 33554432000 4194304 7823515 140737009545728 140737009477832 5878822 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 2224 1517 351 887 0 1334 0
[startup+0.0854149 s]
/proc/loadavg: 2.05 2.01 1.93 3/177 32535
/proc/meminfo: memFree=28460752/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=19036 CPUtime=0.07 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 4223 0 0 0 3 4 0 0 20 0 1 0 341249302 19492864 3822 33554432000 4194304 7823515 140737009545728 140737009477832 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 4759 3822 442 887 0 3869 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 19036
[startup+0.100323 s]
/proc/loadavg: 2.05 2.01 1.93 3/177 32535
/proc/meminfo: memFree=28460752/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=19036 CPUtime=0.09 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 4223 0 0 0 4 5 0 0 20 0 1 0 341249302 19492864 3822 33554432000 4194304 7823515 140737009545728 140737009477832 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 4759 3822 442 887 0 3869 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 19036
[startup+0.300272 s]
/proc/loadavg: 2.05 2.01 1.93 3/177 32535
/proc/meminfo: memFree=28460752/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=32056 CPUtime=0.29 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 7681 0 0 0 22 7 0 0 20 0 1 0 341249302 32825344 7209 33554432000 4194304 7823515 140737009545728 140737009477832 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 8014 7209 554 887 0 7124 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 32056
[startup+0.700264 s]
/proc/loadavg: 2.05 2.01 1.93 3/177 32535
/proc/meminfo: memFree=28460752/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=36172 CPUtime=0.69 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 8722 0 0 0 62 7 0 0 20 0 1 0 341249302 37040128 8250 33554432000 4194304 7823515 140737009545728 140737009540872 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 9043 8250 554 887 0 8153 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 36172
[startup+1.50023 s]
/proc/loadavg: 2.05 2.01 1.93 3/178 32536
/proc/meminfo: memFree=28427520/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=38452 CPUtime=1.48 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 9352 0 0 0 141 7 0 0 20 0 1 0 341249302 39374848 8820 33554432000 4194304 7823515 140737009545728 140737009540872 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 9613 8820 557 887 0 8723 0
Current children cumulated CPU time (s) 1.48
Current children cumulated vsize (KiB) 38452
[startup+3.10023 s]
/proc/loadavg: 2.05 2.01 1.93 3/178 32536
/proc/meminfo: memFree=28427024/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=38452 CPUtime=3.09 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 9384 0 0 0 300 9 0 0 20 0 1 0 341249302 39374848 8852 33554432000 4194304 7823515 140737009545728 140737009540840 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 9613 8852 558 887 0 8723 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 38452
[startup+6.30026 s]
/proc/loadavg: 2.05 2.01 1.93 3/178 32536
/proc/meminfo: memFree=28427280/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=38452 CPUtime=6.29 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 9420 0 0 0 615 14 0 0 20 0 1 0 341249302 39374848 8864 33554432000 4194304 7823515 140737009545728 140737009541528 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 9613 8864 569 887 0 8723 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 38452
Solver just ended. Dumping a history of the last processes samples
[startup+7.10023 s]
/proc/loadavg: 2.05 2.01 1.93 3/178 32536
/proc/meminfo: memFree=28427304/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=38452 CPUtime=7.09 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 9420 0 0 0 694 15 0 0 20 0 1 0 341249302 39374848 8864 33554432000 4194304 7823515 140737009545728 140737009540936 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 9613 8864 569 887 0 8723 0
Current children cumulated CPU time (s) 7.09
Current children cumulated vsize (KiB) 38452
[startup+7.90027 s]
/proc/loadavg: 2.05 2.01 1.93 3/178 32536
/proc/meminfo: memFree=28427428/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=38452 CPUtime=7.88 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 9420 0 0 0 772 16 0 0 20 0 1 0 341249302 39374848 8864 33554432000 4194304 7823515 140737009545728 140737009542216 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 9613 8864 569 887 0 8723 0
Current children cumulated CPU time (s) 7.88
Current children cumulated vsize (KiB) 38452
[startup+8.10023 s]
/proc/loadavg: 2.05 2.01 1.93 3/178 32536
/proc/meminfo: memFree=28427428/32873844 swapFree=7372/7372
[pid=32535] ppid=32533 vsize=38452 CPUtime=8.09 cores=1,3,5,7
/proc/32535/stat : 32535 (pbscip.linux.x8) R 32533 32535 32091 0 -1 4202496 9420 0 0 0 792 17 0 0 20 0 1 0 341249302 39374848 8864 33554432000 4194304 7823515 140737009545728 140737009542216 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32535/statm: 9613 8864 569 887 0 8723 0
Current children cumulated CPU time (s) 8.09
Current children cumulated vsize (KiB) 38452
Child status: 0
Real time (s): 8.14622
CPU time (s): 8.14376
CPU user time (s): 7.96479
CPU system time (s): 0.178972
CPU usage (%): 99.9699
Max. virtual memory (cumulated for all children) (KiB): 38452
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 7.96479
system time used= 0.178972
maximum resident set size= 35472
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 9428
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 10
runsolver used 0.010998 second user time and 0.038994 second system time
The end